/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-SemanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:11:52,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:11:52,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:11:52,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:11:52,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:11:52,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:11:52,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:11:52,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:11:52,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:11:52,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:11:52,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:11:52,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:11:52,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:11:52,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:11:52,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:11:52,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:11:52,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:11:52,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:11:52,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:11:52,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:11:52,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:11:52,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:11:52,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:11:52,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:11:52,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:11:52,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:11:52,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:11:52,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:11:52,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:11:52,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:11:52,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:11:52,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:11:52,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:11:52,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:11:52,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:11:52,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:11:52,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:11:52,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:11:52,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:11:52,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:11:52,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:11:52,469 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-SemanticLbe.epf [2020-02-10 20:11:52,483 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:11:52,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:11:52,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:11:52,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:11:52,485 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:11:52,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:11:52,486 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:11:52,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:11:52,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:11:52,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:11:52,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:11:52,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:11:52,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:11:52,487 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:11:52,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:11:52,487 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:11:52,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:11:52,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:11:52,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:11:52,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:11:52,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:11:52,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:11:52,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:11:52,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:11:52,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:11:52,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:11:52,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:11:52,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:11:52,490 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:11:52,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:11:52,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:11:52,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:11:52,781 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:11:52,781 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:11:52,782 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl [2020-02-10 20:11:52,783 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl' [2020-02-10 20:11:52,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:11:52,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:11:52,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:11:52,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:11:52,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:11:52,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/1) ... [2020-02-10 20:11:52,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/1) ... [2020-02-10 20:11:52,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:11:52,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:11:52,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:11:52,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:11:52,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/1) ... [2020-02-10 20:11:52,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/1) ... [2020-02-10 20:11:52,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/1) ... [2020-02-10 20:11:52,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/1) ... [2020-02-10 20:11:52,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/1) ... [2020-02-10 20:11:52,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/1) ... [2020-02-10 20:11:52,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/1) ... [2020-02-10 20:11:52,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:11:52,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:11:52,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:11:52,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:11:52,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:11:52,955 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:11:52,956 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:11:52,956 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:11:52,958 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:11:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:11:52,958 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:11:52,959 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:11:52,959 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:11:52,959 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:11:52,959 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:11:52,959 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:11:52,960 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:11:52,960 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:11:52,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:11:52,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:11:52,961 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:11:53,152 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:11:53,153 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:11:53,156 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:11:53 BoogieIcfgContainer [2020-02-10 20:11:53,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:11:53,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:11:53,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:11:53,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:11:53,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:11:52" (1/2) ... [2020-02-10 20:11:53,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25979577 and model type example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:11:53, skipping insertion in model container [2020-02-10 20:11:53,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:11:53" (2/2) ... [2020-02-10 20:11:53,165 INFO L109 eAbstractionObserver]: Analyzing ICFG example_4.bpl [2020-02-10 20:11:53,175 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:11:53,175 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:11:53,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:11:53,184 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:11:53,286 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-02-10 20:11:53,309 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:11:53,309 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:11:53,309 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:11:53,310 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:11:53,310 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:11:53,310 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:11:53,311 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:11:53,311 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:11:53,327 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 35 transitions [2020-02-10 20:11:53,329 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions [2020-02-10 20:11:53,419 INFO L129 PetriNetUnfolder]: 17/47 cut-off events. [2020-02-10 20:11:53,419 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-02-10 20:11:53,425 INFO L76 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 47 events. 17/47 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 124 event pairs. 0/46 useless extension candidates. Maximal degree in co-relation 41. Up to 12 conditions per place. [2020-02-10 20:11:53,428 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions [2020-02-10 20:11:53,448 INFO L129 PetriNetUnfolder]: 17/47 cut-off events. [2020-02-10 20:11:53,448 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-02-10 20:11:53,450 INFO L76 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 47 events. 17/47 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 124 event pairs. 0/46 useless extension candidates. Maximal degree in co-relation 41. Up to 12 conditions per place. [2020-02-10 20:11:53,452 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 216 [2020-02-10 20:11:53,453 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 20:11:53,560 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66 [2020-02-10 20:11:53,560 INFO L214 etLargeBlockEncoding]: Total number of compositions: 5 [2020-02-10 20:11:53,565 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 30 transitions [2020-02-10 20:11:53,582 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 98 states. [2020-02-10 20:11:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-02-10 20:11:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:53,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:53,595 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:53,595 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1774799827, now seen corresponding path program 1 times [2020-02-10 20:11:53,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:53,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130541963] [2020-02-10 20:11:53,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:53,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130541963] [2020-02-10 20:11:53,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:53,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:11:53,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793866102] [2020-02-10 20:11:53,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:11:53,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:53,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:11:53,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:11:53,784 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-02-10 20:11:53,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:53,818 INFO L93 Difference]: Finished difference Result 72 states and 170 transitions. [2020-02-10 20:11:53,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:11:53,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-02-10 20:11:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:53,851 INFO L225 Difference]: With dead ends: 72 [2020-02-10 20:11:53,851 INFO L226 Difference]: Without dead ends: 71 [2020-02-10 20:11:53,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:11:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-02-10 20:11:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-02-10 20:11:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-02-10 20:11:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 169 transitions. [2020-02-10 20:11:53,933 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 169 transitions. Word has length 13 [2020-02-10 20:11:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:53,935 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 169 transitions. [2020-02-10 20:11:53,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:11:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 169 transitions. [2020-02-10 20:11:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:53,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:53,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:53,940 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:53,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash 828669875, now seen corresponding path program 1 times [2020-02-10 20:11:53,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:53,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761339877] [2020-02-10 20:11:53,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:54,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761339877] [2020-02-10 20:11:54,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:54,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:11:54,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542249865] [2020-02-10 20:11:54,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:11:54,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:54,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:11:54,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:11:54,008 INFO L87 Difference]: Start difference. First operand 71 states and 169 transitions. Second operand 3 states. [2020-02-10 20:11:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:54,022 INFO L93 Difference]: Finished difference Result 55 states and 121 transitions. [2020-02-10 20:11:54,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:11:54,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-02-10 20:11:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:54,024 INFO L225 Difference]: With dead ends: 55 [2020-02-10 20:11:54,025 INFO L226 Difference]: Without dead ends: 55 [2020-02-10 20:11:54,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:11:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-02-10 20:11:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-02-10 20:11:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-02-10 20:11:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 121 transitions. [2020-02-10 20:11:54,058 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 121 transitions. Word has length 13 [2020-02-10 20:11:54,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:54,058 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 121 transitions. [2020-02-10 20:11:54,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:11:54,058 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 121 transitions. [2020-02-10 20:11:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:54,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:54,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:54,060 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:54,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:54,060 INFO L82 PathProgramCache]: Analyzing trace with hash 857298065, now seen corresponding path program 1 times [2020-02-10 20:11:54,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:54,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937493020] [2020-02-10 20:11:54,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:54,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937493020] [2020-02-10 20:11:54,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:54,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:54,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365219241] [2020-02-10 20:11:54,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:54,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:54,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:54,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:54,321 INFO L87 Difference]: Start difference. First operand 55 states and 121 transitions. Second operand 6 states. [2020-02-10 20:11:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:54,406 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-02-10 20:11:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:54,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:54,408 INFO L225 Difference]: With dead ends: 85 [2020-02-10 20:11:54,408 INFO L226 Difference]: Without dead ends: 77 [2020-02-10 20:11:54,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-02-10 20:11:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2020-02-10 20:11:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-02-10 20:11:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 124 transitions. [2020-02-10 20:11:54,420 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 124 transitions. Word has length 13 [2020-02-10 20:11:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:54,420 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 124 transitions. [2020-02-10 20:11:54,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 124 transitions. [2020-02-10 20:11:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:54,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:54,424 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:54,425 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash 27913103, now seen corresponding path program 2 times [2020-02-10 20:11:54,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:54,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775279953] [2020-02-10 20:11:54,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:54,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775279953] [2020-02-10 20:11:54,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:54,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:54,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657730230] [2020-02-10 20:11:54,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:54,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:54,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:54,610 INFO L87 Difference]: Start difference. First operand 57 states and 124 transitions. Second operand 6 states. [2020-02-10 20:11:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:54,678 INFO L93 Difference]: Finished difference Result 87 states and 163 transitions. [2020-02-10 20:11:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:54,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:54,680 INFO L225 Difference]: With dead ends: 87 [2020-02-10 20:11:54,680 INFO L226 Difference]: Without dead ends: 75 [2020-02-10 20:11:54,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-02-10 20:11:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2020-02-10 20:11:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-02-10 20:11:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 119 transitions. [2020-02-10 20:11:54,689 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 119 transitions. Word has length 13 [2020-02-10 20:11:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:54,689 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 119 transitions. [2020-02-10 20:11:54,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 119 transitions. [2020-02-10 20:11:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:54,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:54,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:54,691 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:54,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1712604719, now seen corresponding path program 3 times [2020-02-10 20:11:54,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:54,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11626895] [2020-02-10 20:11:54,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:54,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11626895] [2020-02-10 20:11:54,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:54,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:54,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581365075] [2020-02-10 20:11:54,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:54,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:54,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:54,845 INFO L87 Difference]: Start difference. First operand 55 states and 119 transitions. Second operand 6 states. [2020-02-10 20:11:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:54,915 INFO L93 Difference]: Finished difference Result 88 states and 163 transitions. [2020-02-10 20:11:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:54,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:54,917 INFO L225 Difference]: With dead ends: 88 [2020-02-10 20:11:54,918 INFO L226 Difference]: Without dead ends: 80 [2020-02-10 20:11:54,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:54,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-02-10 20:11:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2020-02-10 20:11:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-02-10 20:11:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 124 transitions. [2020-02-10 20:11:54,925 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 124 transitions. Word has length 13 [2020-02-10 20:11:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:54,926 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 124 transitions. [2020-02-10 20:11:54,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 124 transitions. [2020-02-10 20:11:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:54,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:54,928 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:54,928 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:54,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1769799917, now seen corresponding path program 4 times [2020-02-10 20:11:54,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:54,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105070895] [2020-02-10 20:11:54,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:55,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105070895] [2020-02-10 20:11:55,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:55,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:55,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622174664] [2020-02-10 20:11:55,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:55,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:55,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:55,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:55,083 INFO L87 Difference]: Start difference. First operand 58 states and 124 transitions. Second operand 6 states. [2020-02-10 20:11:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:55,135 INFO L93 Difference]: Finished difference Result 92 states and 169 transitions. [2020-02-10 20:11:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:55,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:55,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:55,137 INFO L225 Difference]: With dead ends: 92 [2020-02-10 20:11:55,139 INFO L226 Difference]: Without dead ends: 77 [2020-02-10 20:11:55,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-02-10 20:11:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2020-02-10 20:11:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-02-10 20:11:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 116 transitions. [2020-02-10 20:11:55,152 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 116 transitions. Word has length 13 [2020-02-10 20:11:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:55,152 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 116 transitions. [2020-02-10 20:11:55,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 116 transitions. [2020-02-10 20:11:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:55,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:55,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:55,154 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:55,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:55,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1800964241, now seen corresponding path program 5 times [2020-02-10 20:11:55,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:55,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512612215] [2020-02-10 20:11:55,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:55,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512612215] [2020-02-10 20:11:55,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:55,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:55,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293373219] [2020-02-10 20:11:55,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:55,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:55,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:55,322 INFO L87 Difference]: Start difference. First operand 55 states and 116 transitions. Second operand 6 states. [2020-02-10 20:11:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:55,377 INFO L93 Difference]: Finished difference Result 95 states and 178 transitions. [2020-02-10 20:11:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:55,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:55,378 INFO L225 Difference]: With dead ends: 95 [2020-02-10 20:11:55,378 INFO L226 Difference]: Without dead ends: 85 [2020-02-10 20:11:55,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-02-10 20:11:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2020-02-10 20:11:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-02-10 20:11:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2020-02-10 20:11:55,384 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 127 transitions. Word has length 13 [2020-02-10 20:11:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:55,385 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 127 transitions. [2020-02-10 20:11:55,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 127 transitions. [2020-02-10 20:11:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:55,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:55,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:55,386 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:55,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1828669871, now seen corresponding path program 6 times [2020-02-10 20:11:55,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:55,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895344280] [2020-02-10 20:11:55,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:55,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895344280] [2020-02-10 20:11:55,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:55,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:55,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879691647] [2020-02-10 20:11:55,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:55,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:55,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:55,537 INFO L87 Difference]: Start difference. First operand 61 states and 127 transitions. Second operand 6 states. [2020-02-10 20:11:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:55,651 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2020-02-10 20:11:55,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:55,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:55,652 INFO L225 Difference]: With dead ends: 97 [2020-02-10 20:11:55,652 INFO L226 Difference]: Without dead ends: 74 [2020-02-10 20:11:55,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-02-10 20:11:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-02-10 20:11:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:11:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 104 transitions. [2020-02-10 20:11:55,657 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 104 transitions. Word has length 13 [2020-02-10 20:11:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:55,657 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 104 transitions. [2020-02-10 20:11:55,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 104 transitions. [2020-02-10 20:11:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:55,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:55,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:55,658 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:55,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1602000563, now seen corresponding path program 7 times [2020-02-10 20:11:55,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:55,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397403738] [2020-02-10 20:11:55,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:55,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397403738] [2020-02-10 20:11:55,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:55,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:55,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330634110] [2020-02-10 20:11:55,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:55,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:55,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:55,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:55,786 INFO L87 Difference]: Start difference. First operand 50 states and 104 transitions. Second operand 6 states. [2020-02-10 20:11:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:55,847 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2020-02-10 20:11:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:55,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:55,848 INFO L225 Difference]: With dead ends: 78 [2020-02-10 20:11:55,848 INFO L226 Difference]: Without dead ends: 70 [2020-02-10 20:11:55,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-02-10 20:11:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2020-02-10 20:11:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-02-10 20:11:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2020-02-10 20:11:55,858 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 13 [2020-02-10 20:11:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:55,859 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2020-02-10 20:11:55,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2020-02-10 20:11:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:55,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:55,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:55,865 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:55,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:55,865 INFO L82 PathProgramCache]: Analyzing trace with hash 772615601, now seen corresponding path program 8 times [2020-02-10 20:11:55,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:55,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122027010] [2020-02-10 20:11:55,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:56,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-02-10 20:11:56,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122027010] [2020-02-10 20:11:56,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:56,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:56,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384567406] [2020-02-10 20:11:56,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:56,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:56,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:56,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:56,018 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 6 states. [2020-02-10 20:11:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:56,077 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2020-02-10 20:11:56,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:56,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:56,083 INFO L225 Difference]: With dead ends: 80 [2020-02-10 20:11:56,084 INFO L226 Difference]: Without dead ends: 68 [2020-02-10 20:11:56,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-02-10 20:11:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2020-02-10 20:11:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-02-10 20:11:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2020-02-10 20:11:56,097 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 13 [2020-02-10 20:11:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:56,097 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2020-02-10 20:11:56,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2020-02-10 20:11:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:56,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:56,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:56,101 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:56,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:56,101 INFO L82 PathProgramCache]: Analyzing trace with hash -982353425, now seen corresponding path program 9 times [2020-02-10 20:11:56,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:56,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653642608] [2020-02-10 20:11:56,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:56,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653642608] [2020-02-10 20:11:56,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:56,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:56,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611005272] [2020-02-10 20:11:56,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:56,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:56,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:56,260 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 6 states. [2020-02-10 20:11:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:56,309 INFO L93 Difference]: Finished difference Result 73 states and 126 transitions. [2020-02-10 20:11:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:56,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:56,311 INFO L225 Difference]: With dead ends: 73 [2020-02-10 20:11:56,311 INFO L226 Difference]: Without dead ends: 65 [2020-02-10 20:11:56,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-02-10 20:11:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2020-02-10 20:11:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-02-10 20:11:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 99 transitions. [2020-02-10 20:11:56,314 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 99 transitions. Word has length 13 [2020-02-10 20:11:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:56,315 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 99 transitions. [2020-02-10 20:11:56,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 99 transitions. [2020-02-10 20:11:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:56,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:56,316 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:56,316 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:56,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:56,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1591588975, now seen corresponding path program 1 times [2020-02-10 20:11:56,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:56,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752084238] [2020-02-10 20:11:56,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11: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-02-10 20:11:56,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752084238] [2020-02-10 20:11:56,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:56,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:11:56,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98272797] [2020-02-10 20:11:56,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:11:56,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:56,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:11:56,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:11:56,330 INFO L87 Difference]: Start difference. First operand 49 states and 99 transitions. Second operand 3 states. [2020-02-10 20:11:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:56,332 INFO L93 Difference]: Finished difference Result 41 states and 75 transitions. [2020-02-10 20:11:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:11:56,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-02-10 20:11:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:56,333 INFO L225 Difference]: With dead ends: 41 [2020-02-10 20:11:56,333 INFO L226 Difference]: Without dead ends: 41 [2020-02-10 20:11:56,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:11:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-02-10 20:11:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-02-10 20:11:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-02-10 20:11:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 75 transitions. [2020-02-10 20:11:56,337 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 75 transitions. Word has length 13 [2020-02-10 20:11:56,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:56,337 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 75 transitions. [2020-02-10 20:11:56,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:11:56,337 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 75 transitions. [2020-02-10 20:11:56,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:56,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:56,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:56,338 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:56,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:56,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2065265875, now seen corresponding path program 10 times [2020-02-10 20:11:56,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:56,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567802917] [2020-02-10 20:11:56,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:56,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567802917] [2020-02-10 20:11:56,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:56,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:56,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585212668] [2020-02-10 20:11:56,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:56,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:56,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:56,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:56,446 INFO L87 Difference]: Start difference. First operand 41 states and 75 transitions. Second operand 6 states. [2020-02-10 20:11:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:56,480 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2020-02-10 20:11:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:56,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:56,481 INFO L225 Difference]: With dead ends: 54 [2020-02-10 20:11:56,481 INFO L226 Difference]: Without dead ends: 47 [2020-02-10 20:11:56,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-02-10 20:11:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2020-02-10 20:11:56,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-02-10 20:11:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2020-02-10 20:11:56,484 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 13 [2020-02-10 20:11:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:56,485 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 73 transitions. [2020-02-10 20:11:56,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 73 transitions. [2020-02-10 20:11:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:56,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:56,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:56,486 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:56,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1202823469, now seen corresponding path program 11 times [2020-02-10 20:11:56,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:56,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759388705] [2020-02-10 20:11:56,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:56,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759388705] [2020-02-10 20:11:56,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:56,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:56,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922355089] [2020-02-10 20:11:56,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:56,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:56,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:56,574 INFO L87 Difference]: Start difference. First operand 40 states and 73 transitions. Second operand 6 states. [2020-02-10 20:11:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:56,614 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2020-02-10 20:11:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:56,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:56,615 INFO L225 Difference]: With dead ends: 62 [2020-02-10 20:11:56,615 INFO L226 Difference]: Without dead ends: 54 [2020-02-10 20:11:56,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-02-10 20:11:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2020-02-10 20:11:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-02-10 20:11:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 74 transitions. [2020-02-10 20:11:56,619 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 74 transitions. Word has length 13 [2020-02-10 20:11:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:56,619 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 74 transitions. [2020-02-10 20:11:56,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 74 transitions. [2020-02-10 20:11:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:56,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:56,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:56,620 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1374394767, now seen corresponding path program 12 times [2020-02-10 20:11:56,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:56,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219066915] [2020-02-10 20:11:56,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:56,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219066915] [2020-02-10 20:11:56,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:56,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:56,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373302197] [2020-02-10 20:11:56,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:56,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:56,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:56,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:56,726 INFO L87 Difference]: Start difference. First operand 41 states and 74 transitions. Second operand 6 states. [2020-02-10 20:11:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:56,755 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2020-02-10 20:11:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:56,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:56,756 INFO L225 Difference]: With dead ends: 54 [2020-02-10 20:11:56,756 INFO L226 Difference]: Without dead ends: 46 [2020-02-10 20:11:56,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-02-10 20:11:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-02-10 20:11:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 20:11:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2020-02-10 20:11:56,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 13 [2020-02-10 20:11:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:56,759 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 71 transitions. [2020-02-10 20:11:56,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 71 transitions. [2020-02-10 20:11:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:56,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:56,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:56,760 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:56,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:56,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1092957581, now seen corresponding path program 13 times [2020-02-10 20:11:56,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:56,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939456019] [2020-02-10 20:11:56,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:56,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939456019] [2020-02-10 20:11:56,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:56,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:56,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857756601] [2020-02-10 20:11:56,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:56,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:56,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:56,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:56,857 INFO L87 Difference]: Start difference. First operand 39 states and 71 transitions. Second operand 6 states. [2020-02-10 20:11:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:56,910 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2020-02-10 20:11:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:56,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:56,911 INFO L225 Difference]: With dead ends: 63 [2020-02-10 20:11:56,911 INFO L226 Difference]: Without dead ends: 56 [2020-02-10 20:11:56,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-02-10 20:11:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2020-02-10 20:11:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-02-10 20:11:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 69 transitions. [2020-02-10 20:11:56,914 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 69 transitions. Word has length 13 [2020-02-10 20:11:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:56,914 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 69 transitions. [2020-02-10 20:11:56,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 69 transitions. [2020-02-10 20:11:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:56,915 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:56,915 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:56,915 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1035762383, now seen corresponding path program 14 times [2020-02-10 20:11:56,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:56,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469470924] [2020-02-10 20:11:56,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:57,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469470924] [2020-02-10 20:11:57,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:57,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:57,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918694545] [2020-02-10 20:11:57,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:57,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:57,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:57,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:57,023 INFO L87 Difference]: Start difference. First operand 39 states and 69 transitions. Second operand 6 states. [2020-02-10 20:11:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:57,068 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2020-02-10 20:11:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:57,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:57,069 INFO L225 Difference]: With dead ends: 66 [2020-02-10 20:11:57,069 INFO L226 Difference]: Without dead ends: 53 [2020-02-10 20:11:57,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-02-10 20:11:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-02-10 20:11:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-02-10 20:11:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2020-02-10 20:11:57,072 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 13 [2020-02-10 20:11:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:57,073 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2020-02-10 20:11:57,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2020-02-10 20:11:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:57,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:57,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:57,073 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash -237650927, now seen corresponding path program 15 times [2020-02-10 20:11:57,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:57,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067806353] [2020-02-10 20:11:57,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:57,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067806353] [2020-02-10 20:11:57,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:57,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:57,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270530884] [2020-02-10 20:11:57,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:57,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:57,216 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand 6 states. [2020-02-10 20:11:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:57,272 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2020-02-10 20:11:57,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:57,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:57,276 INFO L225 Difference]: With dead ends: 54 [2020-02-10 20:11:57,276 INFO L226 Difference]: Without dead ends: 47 [2020-02-10 20:11:57,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-02-10 20:11:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2020-02-10 20:11:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-02-10 20:11:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 58 transitions. [2020-02-10 20:11:57,279 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 58 transitions. Word has length 13 [2020-02-10 20:11:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:57,279 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 58 transitions. [2020-02-10 20:11:57,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 58 transitions. [2020-02-10 20:11:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:57,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:57,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:57,280 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1484998923, now seen corresponding path program 16 times [2020-02-10 20:11:57,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:57,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106257517] [2020-02-10 20:11:57,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11: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-02-10 20:11:57,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106257517] [2020-02-10 20:11:57,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:57,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:57,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709685694] [2020-02-10 20:11:57,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:57,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:57,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:57,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:57,474 INFO L87 Difference]: Start difference. First operand 34 states and 58 transitions. Second operand 6 states. [2020-02-10 20:11:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:57,529 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2020-02-10 20:11:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:57,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:57,530 INFO L225 Difference]: With dead ends: 47 [2020-02-10 20:11:57,530 INFO L226 Difference]: Without dead ends: 40 [2020-02-10 20:11:57,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-02-10 20:11:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2020-02-10 20:11:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-02-10 20:11:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 56 transitions. [2020-02-10 20:11:57,532 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 56 transitions. Word has length 13 [2020-02-10 20:11:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:57,532 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 56 transitions. [2020-02-10 20:11:57,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 56 transitions. [2020-02-10 20:11:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:57,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:57,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:57,533 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:57,533 INFO L82 PathProgramCache]: Analyzing trace with hash -633260145, now seen corresponding path program 17 times [2020-02-10 20:11:57,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:57,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260568934] [2020-02-10 20:11:57,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:57,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260568934] [2020-02-10 20:11:57,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:57,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:57,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815487625] [2020-02-10 20:11:57,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:57,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:57,660 INFO L87 Difference]: Start difference. First operand 33 states and 56 transitions. Second operand 6 states. [2020-02-10 20:11:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:57,689 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2020-02-10 20:11:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:57,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:57,690 INFO L225 Difference]: With dead ends: 52 [2020-02-10 20:11:57,690 INFO L226 Difference]: Without dead ends: 42 [2020-02-10 20:11:57,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-02-10 20:11:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-02-10 20:11:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-02-10 20:11:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2020-02-10 20:11:57,692 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 13 [2020-02-10 20:11:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:57,693 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2020-02-10 20:11:57,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2020-02-10 20:11:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:57,693 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:57,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:57,694 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash 225614385, now seen corresponding path program 18 times [2020-02-10 20:11:57,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:57,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028154443] [2020-02-10 20:11:57,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:57,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028154443] [2020-02-10 20:11:57,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:57,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:57,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758503723] [2020-02-10 20:11:57,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:57,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:57,817 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 6 states. [2020-02-10 20:11:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:57,850 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2020-02-10 20:11:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:57,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:57,852 INFO L225 Difference]: With dead ends: 41 [2020-02-10 20:11:57,852 INFO L226 Difference]: Without dead ends: 31 [2020-02-10 20:11:57,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-02-10 20:11:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-02-10 20:11:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-02-10 20:11:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-02-10 20:11:57,855 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 13 [2020-02-10 20:11:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:57,855 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-02-10 20:11:57,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-02-10 20:11:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:57,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:57,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:57,856 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:57,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1836921811, now seen corresponding path program 19 times [2020-02-10 20:11:57,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:57,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69073430] [2020-02-10 20:11:57,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:57,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-02-10 20:11:57,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69073430] [2020-02-10 20:11:57,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:57,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:57,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150748982] [2020-02-10 20:11:57,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:57,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:57,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:57,973 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 6 states. [2020-02-10 20:11:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:58,015 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2020-02-10 20:11:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:58,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:58,016 INFO L225 Difference]: With dead ends: 45 [2020-02-10 20:11:58,016 INFO L226 Difference]: Without dead ends: 37 [2020-02-10 20:11:58,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-02-10 20:11:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-02-10 20:11:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-02-10 20:11:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2020-02-10 20:11:58,019 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 [2020-02-10 20:11:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:58,019 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2020-02-10 20:11:58,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2020-02-10 20:11:58,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:58,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:58,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:58,020 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:58,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1599170955, now seen corresponding path program 20 times [2020-02-10 20:11:58,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:58,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664611694] [2020-02-10 20:11:58,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:58,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664611694] [2020-02-10 20:11:58,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:58,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:58,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600993958] [2020-02-10 20:11:58,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:58,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:58,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:58,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:58,229 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 6 states. [2020-02-10 20:11:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:58,257 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2020-02-10 20:11:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:58,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:58,258 INFO L225 Difference]: With dead ends: 47 [2020-02-10 20:11:58,258 INFO L226 Difference]: Without dead ends: 32 [2020-02-10 20:11:58,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-02-10 20:11:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2020-02-10 20:11:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-02-10 20:11:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2020-02-10 20:11:58,260 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 13 [2020-02-10 20:11:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:58,260 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-02-10 20:11:58,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2020-02-10 20:11:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:58,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:58,261 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:58,261 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1602738831, now seen corresponding path program 21 times [2020-02-10 20:11:58,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:58,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212258673] [2020-02-10 20:11:58,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:58,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212258673] [2020-02-10 20:11:58,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:58,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:58,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582943183] [2020-02-10 20:11:58,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:58,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:58,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:58,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:58,342 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 6 states. [2020-02-10 20:11:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:58,375 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-02-10 20:11:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:58,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:58,376 INFO L225 Difference]: With dead ends: 37 [2020-02-10 20:11:58,376 INFO L226 Difference]: Without dead ends: 29 [2020-02-10 20:11:58,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-02-10 20:11:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2020-02-10 20:11:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-02-10 20:11:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-02-10 20:11:58,378 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2020-02-10 20:11:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:58,378 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-02-10 20:11:58,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-02-10 20:11:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:58,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:58,379 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:58,379 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:58,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash 115010229, now seen corresponding path program 22 times [2020-02-10 20:11:58,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:58,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292677550] [2020-02-10 20:11:58,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:58,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-02-10 20:11:58,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292677550] [2020-02-10 20:11:58,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:58,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:58,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700617578] [2020-02-10 20:11:58,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:58,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:58,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:58,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:58,484 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 6 states. [2020-02-10 20:11:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:58,526 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-02-10 20:11:58,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:58,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:58,527 INFO L225 Difference]: With dead ends: 29 [2020-02-10 20:11:58,527 INFO L226 Difference]: Without dead ends: 22 [2020-02-10 20:11:58,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-02-10 20:11:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-02-10 20:11:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-02-10 20:11:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-02-10 20:11:58,529 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2020-02-10 20:11:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:58,530 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-02-10 20:11:58,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2020-02-10 20:11:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:58,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:58,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:58,531 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:58,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash 111442353, now seen corresponding path program 23 times [2020-02-10 20:11:58,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:58,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941384863] [2020-02-10 20:11:58,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11: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-02-10 20:11:58,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941384863] [2020-02-10 20:11:58,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:58,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:58,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059296198] [2020-02-10 20:11:58,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:58,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:58,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:58,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:58,645 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 6 states. [2020-02-10 20:11:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:58,675 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-02-10 20:11:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:58,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:58,675 INFO L225 Difference]: With dead ends: 27 [2020-02-10 20:11:58,675 INFO L226 Difference]: Without dead ends: 17 [2020-02-10 20:11:58,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-02-10 20:11:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-02-10 20:11:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-02-10 20:11:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-02-10 20:11:58,677 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2020-02-10 20:11:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:58,677 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-02-10 20:11:58,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-02-10 20:11:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-02-10 20:11:58,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:11:58,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:11:58,678 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-02-10 20:11:58,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:11:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash 970316883, now seen corresponding path program 24 times [2020-02-10 20:11:58,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:11:58,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321791507] [2020-02-10 20:11:58,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:11:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:11:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:11:58,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321791507] [2020-02-10 20:11:58,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:11:58,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-02-10 20:11:58,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145393316] [2020-02-10 20:11:58,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-02-10 20:11:58,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:11:58,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-02-10 20:11:58,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-02-10 20:11:58,779 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2020-02-10 20:11:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:11:58,798 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-02-10 20:11:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-02-10 20:11:58,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-02-10 20:11:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:11:58,798 INFO L225 Difference]: With dead ends: 16 [2020-02-10 20:11:58,798 INFO L226 Difference]: Without dead ends: 0 [2020-02-10 20:11:58,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-02-10 20:11:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-02-10 20:11:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-02-10 20:11:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-02-10 20:11:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-02-10 20:11:58,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-02-10 20:11:58,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:11:58,800 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-02-10 20:11:58,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-02-10 20:11:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-02-10 20:11:58,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-02-10 20:11:58,804 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:11:58 BasicIcfg [2020-02-10 20:11:58,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:11:58,806 INFO L168 Benchmark]: Toolchain (without parser) took 5993.79 ms. Allocated memory was 137.9 MB in the beginning and 283.6 MB in the end (delta: 145.8 MB). Free memory was 118.5 MB in the beginning and 152.2 MB in the end (delta: -33.7 MB). Peak memory consumption was 112.0 MB. Max. memory is 7.1 GB. [2020-02-10 20:11:58,807 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.39 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:11:58,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.67 ms. Allocated memory is still 137.9 MB. Free memory was 118.3 MB in the beginning and 116.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 20:11:58,808 INFO L168 Benchmark]: Boogie Preprocessor took 22.92 ms. Allocated memory is still 137.9 MB. Free memory was 116.6 MB in the beginning and 115.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2020-02-10 20:11:58,808 INFO L168 Benchmark]: RCFGBuilder took 280.92 ms. Allocated memory is still 137.9 MB. Free memory was 115.6 MB in the beginning and 105.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-02-10 20:11:58,809 INFO L168 Benchmark]: TraceAbstraction took 5646.28 ms. Allocated memory was 137.9 MB in the beginning and 283.6 MB in the end (delta: 145.8 MB). Free memory was 104.6 MB in the beginning and 152.2 MB in the end (delta: -47.7 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. [2020-02-10 20:11:58,811 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.39 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.67 ms. Allocated memory is still 137.9 MB. Free memory was 118.3 MB in the beginning and 116.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.92 ms. Allocated memory is still 137.9 MB. Free memory was 116.6 MB in the beginning and 115.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 280.92 ms. Allocated memory is still 137.9 MB. Free memory was 115.6 MB in the beginning and 105.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5646.28 ms. Allocated memory was 137.9 MB in the beginning and 283.6 MB in the end (delta: 145.8 MB). Free memory was 104.6 MB in the beginning and 152.2 MB in the end (delta: -47.7 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.2s, 36 ProgramPointsBefore, 31 ProgramPointsAfterwards, 35 TransitionsBefore, 30 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 60 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 66 CheckedPairsTotal, 5 TotalNumberOfCompositions - PositiveResult [Line: 21]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. Result: SAFE, OverallTime: 5.4s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 669 SDtfs, 920 SDslu, 945 SDs, 0 SdLazy, 329 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 294 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 42696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...