/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-abd8500 [2020-01-16 18:58:54,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-01-16 18:58:54,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-01-16 18:58:54,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-01-16 18:58:54,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-01-16 18:58:54,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-01-16 18:58:54,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-01-16 18:58:54,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-01-16 18:58:54,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-01-16 18:58:54,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-01-16 18:58:54,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-01-16 18:58:54,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-01-16 18:58:54,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-01-16 18:58:54,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-01-16 18:58:54,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-01-16 18:58:54,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-01-16 18:58:54,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-01-16 18:58:54,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-01-16 18:58:54,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-01-16 18:58:54,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-01-16 18:58:54,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-01-16 18:58:54,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-01-16 18:58:54,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-01-16 18:58:54,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-01-16 18:58:54,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-01-16 18:58:54,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-01-16 18:58:54,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-01-16 18:58:55,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-01-16 18:58:55,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-01-16 18:58:55,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-01-16 18:58:55,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-01-16 18:58:55,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-01-16 18:58:55,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-01-16 18:58:55,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-01-16 18:58:55,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-01-16 18:58:55,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-01-16 18:58:55,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-01-16 18:58:55,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-01-16 18:58:55,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-01-16 18:58:55,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-01-16 18:58:55,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-01-16 18:58:55,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2020-01-16 18:58:55,023 INFO L113 SettingsManager]: Loading preferences was successful [2020-01-16 18:58:55,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-01-16 18:58:55,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-01-16 18:58:55,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-01-16 18:58:55,025 INFO L138 SettingsManager]: * Use SBE=true [2020-01-16 18:58:55,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-01-16 18:58:55,026 INFO L138 SettingsManager]: * sizeof long=4 [2020-01-16 18:58:55,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-01-16 18:58:55,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-01-16 18:58:55,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-01-16 18:58:55,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-01-16 18:58:55,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-01-16 18:58:55,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-01-16 18:58:55,027 INFO L138 SettingsManager]: * sizeof long double=12 [2020-01-16 18:58:55,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-01-16 18:58:55,027 INFO L138 SettingsManager]: * Use constant arrays=true [2020-01-16 18:58:55,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-01-16 18:58:55,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-01-16 18:58:55,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-01-16 18:58:55,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-01-16 18:58:55,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-01-16 18:58:55,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-01-16 18:58:55,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-01-16 18:58:55,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-01-16 18:58:55,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-01-16 18:58:55,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-01-16 18:58:55,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-01-16 18:58:55,030 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-01-16 18:58:55,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-01-16 18:58:55,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-01-16 18:58:55,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-01-16 18:58:55,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-01-16 18:58:55,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-01-16 18:58:55,328 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-01-16 18:58:55,329 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-01-16 18:58:55,330 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl [2020-01-16 18:58:55,330 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_4.bpl' [2020-01-16 18:58:55,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-01-16 18:58:55,366 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-01-16 18:58:55,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-01-16 18:58:55,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-01-16 18:58:55,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-01-16 18:58:55,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/1) ... [2020-01-16 18:58:55,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/1) ... [2020-01-16 18:58:55,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-01-16 18:58:55,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-01-16 18:58:55,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-01-16 18:58:55,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-01-16 18:58:55,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/1) ... [2020-01-16 18:58:55,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/1) ... [2020-01-16 18:58:55,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/1) ... [2020-01-16 18:58:55,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/1) ... [2020-01-16 18:58:55,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/1) ... [2020-01-16 18:58:55,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/1) ... [2020-01-16 18:58:55,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/1) ... [2020-01-16 18:58:55,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-01-16 18:58:55,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-01-16 18:58:55,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-01-16 18:58:55,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-01-16 18:58:55,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-01-16 18:58:55,501 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-01-16 18:58:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-01-16 18:58:55,502 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-01-16 18:58:55,503 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-01-16 18:58:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-01-16 18:58:55,503 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-01-16 18:58:55,504 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-01-16 18:58:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-01-16 18:58:55,505 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-01-16 18:58:55,505 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-01-16 18:58:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-01-16 18:58:55,505 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-01-16 18:58:55,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-01-16 18:58:55,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-01-16 18:58:55,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-01-16 18:58:55,507 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-01-16 18:58:55,700 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-01-16 18:58:55,701 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2020-01-16 18:58:55,702 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:58:55 BoogieIcfgContainer [2020-01-16 18:58:55,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-01-16 18:58:55,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-01-16 18:58:55,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-01-16 18:58:55,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-01-16 18:58:55,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:58:55" (1/2) ... [2020-01-16 18:58:55,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18987ebc and model type example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.01 06:58:55, skipping insertion in model container [2020-01-16 18:58:55,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:58:55" (2/2) ... [2020-01-16 18:58:55,714 INFO L109 eAbstractionObserver]: Analyzing ICFG example_4.bpl [2020-01-16 18:58:55,724 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-01-16 18:58:55,724 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-01-16 18:58:55,733 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-01-16 18:58:55,734 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-01-16 18:58:55,958 INFO L250 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-01-16 18:58:55,990 INFO L374 AbstractCegarLoop]: Interprodecural is true [2020-01-16 18:58:55,990 INFO L375 AbstractCegarLoop]: Hoare is true [2020-01-16 18:58:55,990 INFO L376 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-01-16 18:58:55,990 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-01-16 18:58:55,990 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-01-16 18:58:55,991 INFO L379 AbstractCegarLoop]: Difference is false [2020-01-16 18:58:55,991 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-01-16 18:58:55,991 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-01-16 18:58:56,003 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 35 transitions [2020-01-16 18:58:56,005 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions [2020-01-16 18:58:56,055 INFO L129 PetriNetUnfolder]: 17/47 cut-off events. [2020-01-16 18:58:56,055 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-01-16 18:58:56,066 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-01-16 18:58:56,070 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions [2020-01-16 18:58:56,095 INFO L129 PetriNetUnfolder]: 17/47 cut-off events. [2020-01-16 18:58:56,096 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-01-16 18:58:56,097 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-01-16 18:58:56,098 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 216 [2020-01-16 18:58:56,099 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-01-16 18:58:56,192 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66 [2020-01-16 18:58:56,192 INFO L214 etLargeBlockEncoding]: Total number of compositions: 5 [2020-01-16 18:58:56,196 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 30 transitions [2020-01-16 18:58:56,210 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 98 states. [2020-01-16 18:58:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-01-16 18:58:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:56,221 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:56,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:56,222 INFO L426 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1774799827, now seen corresponding path program 1 times [2020-01-16 18:58:56,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:56,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510485948] [2020-01-16 18:58:56,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:56,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510485948] [2020-01-16 18:58:56,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:56,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:58:56,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944108664] [2020-01-16 18:58:56,402 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:58:56,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:56,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:58:56,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:58:56,422 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-01-16 18:58:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:56,455 INFO L93 Difference]: Finished difference Result 72 states and 170 transitions. [2020-01-16 18:58:56,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:58:56,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-01-16 18:58:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:56,469 INFO L225 Difference]: With dead ends: 72 [2020-01-16 18:58:56,470 INFO L226 Difference]: Without dead ends: 71 [2020-01-16 18:58:56,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:58:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-01-16 18:58:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-01-16 18:58:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-01-16 18:58:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 169 transitions. [2020-01-16 18:58:56,519 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 169 transitions. Word has length 13 [2020-01-16 18:58:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:56,520 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 169 transitions. [2020-01-16 18:58:56,521 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:58:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 169 transitions. [2020-01-16 18:58:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:56,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:56,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:56,523 INFO L426 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash 828669875, now seen corresponding path program 1 times [2020-01-16 18:58:56,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:56,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765519550] [2020-01-16 18:58:56,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:56,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765519550] [2020-01-16 18:58:56,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:56,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:58:56,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658089636] [2020-01-16 18:58:56,562 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:58:56,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:56,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:58:56,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:58:56,563 INFO L87 Difference]: Start difference. First operand 71 states and 169 transitions. Second operand 3 states. [2020-01-16 18:58:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:56,571 INFO L93 Difference]: Finished difference Result 55 states and 121 transitions. [2020-01-16 18:58:56,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:58:56,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-01-16 18:58:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:56,573 INFO L225 Difference]: With dead ends: 55 [2020-01-16 18:58:56,574 INFO L226 Difference]: Without dead ends: 55 [2020-01-16 18:58:56,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:58:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-01-16 18:58:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-01-16 18:58:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-01-16 18:58:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 121 transitions. [2020-01-16 18:58:56,584 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 121 transitions. Word has length 13 [2020-01-16 18:58:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:56,585 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 121 transitions. [2020-01-16 18:58:56,585 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:58:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 121 transitions. [2020-01-16 18:58:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:56,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:56,587 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:56,587 INFO L426 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:56,588 INFO L82 PathProgramCache]: Analyzing trace with hash 857298065, now seen corresponding path program 1 times [2020-01-16 18:58:56,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:56,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237589232] [2020-01-16 18:58:56,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:56,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237589232] [2020-01-16 18:58:56,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:56,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:56,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013068390] [2020-01-16 18:58:56,848 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:56,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:56,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:56,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:56,849 INFO L87 Difference]: Start difference. First operand 55 states and 121 transitions. Second operand 6 states. [2020-01-16 18:58:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:56,941 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-01-16 18:58:56,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:56,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:56,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:56,943 INFO L225 Difference]: With dead ends: 85 [2020-01-16 18:58:56,943 INFO L226 Difference]: Without dead ends: 77 [2020-01-16 18:58:56,944 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-01-16 18:58:56,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-01-16 18:58:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2020-01-16 18:58:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-01-16 18:58:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 124 transitions. [2020-01-16 18:58:56,953 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 124 transitions. Word has length 13 [2020-01-16 18:58:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:56,954 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 124 transitions. [2020-01-16 18:58:56,954 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 124 transitions. [2020-01-16 18:58:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:56,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:56,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:56,955 INFO L426 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:56,956 INFO L82 PathProgramCache]: Analyzing trace with hash 27913103, now seen corresponding path program 2 times [2020-01-16 18:58:56,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:56,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279371158] [2020-01-16 18:58:56,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:57,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279371158] [2020-01-16 18:58:57,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:57,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:57,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299778403] [2020-01-16 18:58:57,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:57,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:57,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:57,120 INFO L87 Difference]: Start difference. First operand 57 states and 124 transitions. Second operand 6 states. [2020-01-16 18:58:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:57,191 INFO L93 Difference]: Finished difference Result 87 states and 163 transitions. [2020-01-16 18:58:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:57,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:57,193 INFO L225 Difference]: With dead ends: 87 [2020-01-16 18:58:57,193 INFO L226 Difference]: Without dead ends: 75 [2020-01-16 18:58:57,194 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-01-16 18:58:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-01-16 18:58:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2020-01-16 18:58:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-01-16 18:58:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 119 transitions. [2020-01-16 18:58:57,201 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 119 transitions. Word has length 13 [2020-01-16 18:58:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:57,202 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 119 transitions. [2020-01-16 18:58:57,202 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 119 transitions. [2020-01-16 18:58:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:57,203 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:57,203 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:57,204 INFO L426 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:57,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:57,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1712604719, now seen corresponding path program 3 times [2020-01-16 18:58:57,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:57,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268879423] [2020-01-16 18:58:57,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:57,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268879423] [2020-01-16 18:58:57,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:57,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:57,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751156508] [2020-01-16 18:58:57,363 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:57,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:57,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:57,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:57,364 INFO L87 Difference]: Start difference. First operand 55 states and 119 transitions. Second operand 6 states. [2020-01-16 18:58:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:57,437 INFO L93 Difference]: Finished difference Result 88 states and 163 transitions. [2020-01-16 18:58:57,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:57,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:57,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:57,439 INFO L225 Difference]: With dead ends: 88 [2020-01-16 18:58:57,440 INFO L226 Difference]: Without dead ends: 80 [2020-01-16 18:58:57,440 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-01-16 18:58:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-01-16 18:58:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2020-01-16 18:58:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-01-16 18:58:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 124 transitions. [2020-01-16 18:58:57,448 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 124 transitions. Word has length 13 [2020-01-16 18:58:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:57,448 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 124 transitions. [2020-01-16 18:58:57,448 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 124 transitions. [2020-01-16 18:58:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:57,450 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:57,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:57,450 INFO L426 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:57,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1769799917, now seen corresponding path program 4 times [2020-01-16 18:58:57,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:57,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352406941] [2020-01-16 18:58:57,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:57,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352406941] [2020-01-16 18:58:57,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:57,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:57,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814172349] [2020-01-16 18:58:57,619 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:57,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:57,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:57,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:57,621 INFO L87 Difference]: Start difference. First operand 58 states and 124 transitions. Second operand 6 states. [2020-01-16 18:58:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:57,678 INFO L93 Difference]: Finished difference Result 92 states and 169 transitions. [2020-01-16 18:58:57,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:57,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:57,680 INFO L225 Difference]: With dead ends: 92 [2020-01-16 18:58:57,680 INFO L226 Difference]: Without dead ends: 77 [2020-01-16 18:58:57,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-01-16 18:58:57,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-01-16 18:58:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2020-01-16 18:58:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-01-16 18:58:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 116 transitions. [2020-01-16 18:58:57,686 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 116 transitions. Word has length 13 [2020-01-16 18:58:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:57,687 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 116 transitions. [2020-01-16 18:58:57,687 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 116 transitions. [2020-01-16 18:58:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:57,688 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:57,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:57,688 INFO L426 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:57,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:57,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1800964241, now seen corresponding path program 5 times [2020-01-16 18:58:57,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:57,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223696577] [2020-01-16 18:58:57,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:57,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223696577] [2020-01-16 18:58:57,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:57,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:57,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904927787] [2020-01-16 18:58:57,829 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:57,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:57,830 INFO L87 Difference]: Start difference. First operand 55 states and 116 transitions. Second operand 6 states. [2020-01-16 18:58:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:57,896 INFO L93 Difference]: Finished difference Result 95 states and 178 transitions. [2020-01-16 18:58:57,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:57,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:57,897 INFO L225 Difference]: With dead ends: 95 [2020-01-16 18:58:57,898 INFO L226 Difference]: Without dead ends: 85 [2020-01-16 18:58:57,898 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-01-16 18:58:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-01-16 18:58:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2020-01-16 18:58:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-01-16 18:58:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2020-01-16 18:58:57,910 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 127 transitions. Word has length 13 [2020-01-16 18:58:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:57,910 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 127 transitions. [2020-01-16 18:58:57,910 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 127 transitions. [2020-01-16 18:58:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:57,912 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:57,912 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:57,913 INFO L426 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:57,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:57,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1828669871, now seen corresponding path program 6 times [2020-01-16 18:58:57,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:57,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764814087] [2020-01-16 18:58:57,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:58,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764814087] [2020-01-16 18:58:58,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:58,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:58,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034202254] [2020-01-16 18:58:58,087 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:58,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:58,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:58,088 INFO L87 Difference]: Start difference. First operand 61 states and 127 transitions. Second operand 6 states. [2020-01-16 18:58:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:58,136 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2020-01-16 18:58:58,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:58,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:58,137 INFO L225 Difference]: With dead ends: 97 [2020-01-16 18:58:58,137 INFO L226 Difference]: Without dead ends: 74 [2020-01-16 18:58:58,138 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-01-16 18:58:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-01-16 18:58:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-01-16 18:58:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 18:58:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 104 transitions. [2020-01-16 18:58:58,143 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 104 transitions. Word has length 13 [2020-01-16 18:58:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:58,143 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 104 transitions. [2020-01-16 18:58:58,143 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 104 transitions. [2020-01-16 18:58:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:58,144 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:58,145 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:58,145 INFO L426 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:58,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:58,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1602000563, now seen corresponding path program 7 times [2020-01-16 18:58:58,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:58,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510656447] [2020-01-16 18:58:58,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:58,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510656447] [2020-01-16 18:58:58,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:58,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:58,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130977436] [2020-01-16 18:58:58,272 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:58,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:58,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:58,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:58,273 INFO L87 Difference]: Start difference. First operand 50 states and 104 transitions. Second operand 6 states. [2020-01-16 18:58:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:58,319 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2020-01-16 18:58:58,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:58,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:58,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:58,320 INFO L225 Difference]: With dead ends: 78 [2020-01-16 18:58:58,320 INFO L226 Difference]: Without dead ends: 70 [2020-01-16 18:58:58,321 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-01-16 18:58:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-01-16 18:58:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2020-01-16 18:58:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 18:58:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2020-01-16 18:58:58,325 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 13 [2020-01-16 18:58:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:58,325 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2020-01-16 18:58:58,326 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2020-01-16 18:58:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:58,326 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:58,327 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:58,327 INFO L426 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash 772615601, now seen corresponding path program 8 times [2020-01-16 18:58:58,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:58,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098869533] [2020-01-16 18:58:58,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:58,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098869533] [2020-01-16 18:58:58,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:58,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:58,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160551096] [2020-01-16 18:58:58,461 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:58,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:58,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:58,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:58,462 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 6 states. [2020-01-16 18:58:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:58,526 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2020-01-16 18:58:58,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:58,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:58,530 INFO L225 Difference]: With dead ends: 80 [2020-01-16 18:58:58,530 INFO L226 Difference]: Without dead ends: 68 [2020-01-16 18:58:58,531 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-01-16 18:58:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-01-16 18:58:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2020-01-16 18:58:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-01-16 18:58:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2020-01-16 18:58:58,542 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 13 [2020-01-16 18:58:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:58,543 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2020-01-16 18:58:58,543 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2020-01-16 18:58:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:58,544 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:58,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:58,544 INFO L426 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:58,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:58,548 INFO L82 PathProgramCache]: Analyzing trace with hash -982353425, now seen corresponding path program 9 times [2020-01-16 18:58:58,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:58,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335244948] [2020-01-16 18:58:58,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:58,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335244948] [2020-01-16 18:58:58,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:58,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:58,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71193779] [2020-01-16 18:58:58,707 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:58,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:58,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:58,708 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 6 states. [2020-01-16 18:58:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:58,800 INFO L93 Difference]: Finished difference Result 73 states and 126 transitions. [2020-01-16 18:58:58,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:58,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:58,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:58,802 INFO L225 Difference]: With dead ends: 73 [2020-01-16 18:58:58,802 INFO L226 Difference]: Without dead ends: 65 [2020-01-16 18:58:58,802 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-01-16 18:58:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-01-16 18:58:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2020-01-16 18:58:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-01-16 18:58:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 99 transitions. [2020-01-16 18:58:58,807 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 99 transitions. Word has length 13 [2020-01-16 18:58:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:58,808 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 99 transitions. [2020-01-16 18:58:58,808 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 99 transitions. [2020-01-16 18:58:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:58,809 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:58,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:58,809 INFO L426 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1591588975, now seen corresponding path program 1 times [2020-01-16 18:58:58,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:58,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792598104] [2020-01-16 18:58:58,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:58,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792598104] [2020-01-16 18:58:58,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:58,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:58:58,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525350279] [2020-01-16 18:58:58,835 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:58:58,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:58,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:58:58,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:58:58,836 INFO L87 Difference]: Start difference. First operand 49 states and 99 transitions. Second operand 3 states. [2020-01-16 18:58:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:58,839 INFO L93 Difference]: Finished difference Result 41 states and 75 transitions. [2020-01-16 18:58:58,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:58:58,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-01-16 18:58:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:58,840 INFO L225 Difference]: With dead ends: 41 [2020-01-16 18:58:58,840 INFO L226 Difference]: Without dead ends: 41 [2020-01-16 18:58:58,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:58:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-01-16 18:58:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-01-16 18:58:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-01-16 18:58:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 75 transitions. [2020-01-16 18:58:58,844 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 75 transitions. Word has length 13 [2020-01-16 18:58:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:58,845 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 75 transitions. [2020-01-16 18:58:58,845 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:58:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 75 transitions. [2020-01-16 18:58:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:58,845 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:58,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:58,850 INFO L426 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:58,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2065265875, now seen corresponding path program 10 times [2020-01-16 18:58:58,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:58,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371089727] [2020-01-16 18:58:58,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:58,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371089727] [2020-01-16 18:58:58,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:58,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:58,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758662764] [2020-01-16 18:58:58,967 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:58,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:58,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:58,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:58,970 INFO L87 Difference]: Start difference. First operand 41 states and 75 transitions. Second operand 6 states. [2020-01-16 18:58:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:59,010 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2020-01-16 18:58:59,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:59,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:59,011 INFO L225 Difference]: With dead ends: 54 [2020-01-16 18:58:59,012 INFO L226 Difference]: Without dead ends: 47 [2020-01-16 18:58:59,012 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-01-16 18:58:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-01-16 18:58:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2020-01-16 18:58:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-01-16 18:58:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2020-01-16 18:58:59,015 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 13 [2020-01-16 18:58:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:59,015 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 73 transitions. [2020-01-16 18:58:59,015 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 73 transitions. [2020-01-16 18:58:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:59,016 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:59,016 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:59,016 INFO L426 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:59,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1202823469, now seen corresponding path program 11 times [2020-01-16 18:58:59,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:59,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331283923] [2020-01-16 18:58:59,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:59,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331283923] [2020-01-16 18:58:59,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:59,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:59,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251760502] [2020-01-16 18:58:59,124 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:59,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:59,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:59,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:59,125 INFO L87 Difference]: Start difference. First operand 40 states and 73 transitions. Second operand 6 states. [2020-01-16 18:58:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:59,168 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2020-01-16 18:58:59,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:59,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:59,169 INFO L225 Difference]: With dead ends: 62 [2020-01-16 18:58:59,169 INFO L226 Difference]: Without dead ends: 54 [2020-01-16 18:58:59,169 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-01-16 18:58:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-01-16 18:58:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2020-01-16 18:58:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-01-16 18:58:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 74 transitions. [2020-01-16 18:58:59,172 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 74 transitions. Word has length 13 [2020-01-16 18:58:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:59,172 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 74 transitions. [2020-01-16 18:58:59,172 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 74 transitions. [2020-01-16 18:58:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:59,173 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:59,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:59,173 INFO L426 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:59,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1374394767, now seen corresponding path program 12 times [2020-01-16 18:58:59,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:59,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549108868] [2020-01-16 18:58:59,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:59,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549108868] [2020-01-16 18:58:59,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:59,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:59,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406748051] [2020-01-16 18:58:59,268 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:59,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:59,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:59,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:59,269 INFO L87 Difference]: Start difference. First operand 41 states and 74 transitions. Second operand 6 states. [2020-01-16 18:58:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:59,304 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2020-01-16 18:58:59,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:59,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:59,306 INFO L225 Difference]: With dead ends: 54 [2020-01-16 18:58:59,306 INFO L226 Difference]: Without dead ends: 46 [2020-01-16 18:58:59,306 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-01-16 18:58:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-01-16 18:58:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-01-16 18:58:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-01-16 18:58:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2020-01-16 18:58:59,309 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 13 [2020-01-16 18:58:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:59,309 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 71 transitions. [2020-01-16 18:58:59,309 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 71 transitions. [2020-01-16 18:58:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:59,310 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:59,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:59,310 INFO L426 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1092957581, now seen corresponding path program 13 times [2020-01-16 18:58:59,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:59,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101909278] [2020-01-16 18:58:59,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:59,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101909278] [2020-01-16 18:58:59,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:59,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:59,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631221260] [2020-01-16 18:58:59,415 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:59,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:59,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:59,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:59,416 INFO L87 Difference]: Start difference. First operand 39 states and 71 transitions. Second operand 6 states. [2020-01-16 18:58:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:59,463 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2020-01-16 18:58:59,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:59,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:59,464 INFO L225 Difference]: With dead ends: 63 [2020-01-16 18:58:59,464 INFO L226 Difference]: Without dead ends: 56 [2020-01-16 18:58:59,465 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-01-16 18:58:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-01-16 18:58:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2020-01-16 18:58:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-01-16 18:58:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 69 transitions. [2020-01-16 18:58:59,467 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 69 transitions. Word has length 13 [2020-01-16 18:58:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:59,468 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 69 transitions. [2020-01-16 18:58:59,468 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 69 transitions. [2020-01-16 18:58:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:59,468 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:59,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:59,468 INFO L426 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:59,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:59,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1035762383, now seen corresponding path program 14 times [2020-01-16 18:58:59,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:59,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454829971] [2020-01-16 18:58:59,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:59,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454829971] [2020-01-16 18:58:59,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:59,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:59,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472392826] [2020-01-16 18:58:59,579 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:59,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:59,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:59,580 INFO L87 Difference]: Start difference. First operand 39 states and 69 transitions. Second operand 6 states. [2020-01-16 18:58:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:59,637 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2020-01-16 18:58:59,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:59,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:59,638 INFO L225 Difference]: With dead ends: 66 [2020-01-16 18:58:59,639 INFO L226 Difference]: Without dead ends: 53 [2020-01-16 18:58:59,639 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-01-16 18:58:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-01-16 18:58:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-01-16 18:58:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-01-16 18:58:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2020-01-16 18:58:59,642 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 13 [2020-01-16 18:58:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:59,643 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2020-01-16 18:58:59,643 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2020-01-16 18:58:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:59,644 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:59,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:59,644 INFO L426 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:59,644 INFO L82 PathProgramCache]: Analyzing trace with hash -237650927, now seen corresponding path program 15 times [2020-01-16 18:58:59,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:59,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056024064] [2020-01-16 18:58:59,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:59,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056024064] [2020-01-16 18:58:59,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:59,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:59,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090672261] [2020-01-16 18:58:59,785 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:59,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:59,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:59,786 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand 6 states. [2020-01-16 18:58:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:59,840 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2020-01-16 18:58:59,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:59,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:59,841 INFO L225 Difference]: With dead ends: 54 [2020-01-16 18:58:59,841 INFO L226 Difference]: Without dead ends: 47 [2020-01-16 18:58:59,842 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-01-16 18:58:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-01-16 18:58:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2020-01-16 18:58:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-01-16 18:58:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 58 transitions. [2020-01-16 18:58:59,846 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 58 transitions. Word has length 13 [2020-01-16 18:58:59,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:59,846 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 58 transitions. [2020-01-16 18:58:59,846 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 58 transitions. [2020-01-16 18:58:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:59,847 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:59,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:59,847 INFO L426 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:59,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1484998923, now seen corresponding path program 16 times [2020-01-16 18:58:59,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:59,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5246147] [2020-01-16 18:58:59,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:58:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:58:59,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5246147] [2020-01-16 18:58:59,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:58:59,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:58:59,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676661249] [2020-01-16 18:58:59,952 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:58:59,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:58:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:58:59,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:58:59,953 INFO L87 Difference]: Start difference. First operand 34 states and 58 transitions. Second operand 6 states. [2020-01-16 18:58:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:58:59,981 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2020-01-16 18:58:59,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:58:59,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:58:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:58:59,982 INFO L225 Difference]: With dead ends: 47 [2020-01-16 18:58:59,983 INFO L226 Difference]: Without dead ends: 40 [2020-01-16 18:58:59,983 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-01-16 18:58:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-01-16 18:58:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2020-01-16 18:58:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-01-16 18:58:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 56 transitions. [2020-01-16 18:58:59,985 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 56 transitions. Word has length 13 [2020-01-16 18:58:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:58:59,985 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 56 transitions. [2020-01-16 18:58:59,985 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:58:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 56 transitions. [2020-01-16 18:58:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:58:59,986 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:58:59,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:58:59,986 INFO L426 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:58:59,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:58:59,986 INFO L82 PathProgramCache]: Analyzing trace with hash -633260145, now seen corresponding path program 17 times [2020-01-16 18:58:59,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:58:59,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501992685] [2020-01-16 18:58:59,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:58:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:00,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501992685] [2020-01-16 18:59:00,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:00,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:59:00,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657457449] [2020-01-16 18:59:00,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:59:00,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:00,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:59:00,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:59:00,105 INFO L87 Difference]: Start difference. First operand 33 states and 56 transitions. Second operand 6 states. [2020-01-16 18:59:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:00,148 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2020-01-16 18:59:00,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:59:00,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:59:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:00,149 INFO L225 Difference]: With dead ends: 52 [2020-01-16 18:59:00,149 INFO L226 Difference]: Without dead ends: 42 [2020-01-16 18:59:00,150 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-01-16 18:59:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-01-16 18:59:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-01-16 18:59:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-01-16 18:59:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2020-01-16 18:59:00,152 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 13 [2020-01-16 18:59:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:00,153 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2020-01-16 18:59:00,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:59:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2020-01-16 18:59:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:59:00,153 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:00,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:00,154 INFO L426 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:59:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash 225614385, now seen corresponding path program 18 times [2020-01-16 18:59:00,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:00,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837509995] [2020-01-16 18:59:00,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:00,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837509995] [2020-01-16 18:59:00,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:00,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:59:00,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753058738] [2020-01-16 18:59:00,257 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:59:00,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:00,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:59:00,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:59:00,258 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 6 states. [2020-01-16 18:59:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:00,285 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2020-01-16 18:59:00,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:59:00,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:59:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:00,286 INFO L225 Difference]: With dead ends: 41 [2020-01-16 18:59:00,286 INFO L226 Difference]: Without dead ends: 31 [2020-01-16 18:59:00,286 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-01-16 18:59:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-01-16 18:59:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-01-16 18:59:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-01-16 18:59:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-01-16 18:59:00,288 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 13 [2020-01-16 18:59:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:00,289 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-01-16 18:59:00,289 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:59:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-01-16 18:59:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:59:00,289 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:00,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:00,290 INFO L426 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:59:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:00,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1836921811, now seen corresponding path program 19 times [2020-01-16 18:59:00,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:00,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702921953] [2020-01-16 18:59:00,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:00,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702921953] [2020-01-16 18:59:00,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:00,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:59:00,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561957172] [2020-01-16 18:59:00,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:59:00,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:00,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:59:00,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:59:00,379 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 6 states. [2020-01-16 18:59:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:00,413 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2020-01-16 18:59:00,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:59:00,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:59:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:00,414 INFO L225 Difference]: With dead ends: 45 [2020-01-16 18:59:00,414 INFO L226 Difference]: Without dead ends: 37 [2020-01-16 18:59:00,415 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-01-16 18:59:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-01-16 18:59:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-01-16 18:59:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-01-16 18:59:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2020-01-16 18:59:00,417 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 [2020-01-16 18:59:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:00,417 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2020-01-16 18:59:00,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:59:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2020-01-16 18:59:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:59:00,418 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:00,418 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:00,418 INFO L426 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:59:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1599170955, now seen corresponding path program 20 times [2020-01-16 18:59:00,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:00,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783354287] [2020-01-16 18:59:00,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:00,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783354287] [2020-01-16 18:59:00,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:00,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:59:00,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747445617] [2020-01-16 18:59:00,517 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:59:00,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:00,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:59:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:59:00,518 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 6 states. [2020-01-16 18:59:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:00,558 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2020-01-16 18:59:00,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:59:00,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:59:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:00,559 INFO L225 Difference]: With dead ends: 47 [2020-01-16 18:59:00,559 INFO L226 Difference]: Without dead ends: 32 [2020-01-16 18:59:00,560 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-01-16 18:59:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-01-16 18:59:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2020-01-16 18:59:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-01-16 18:59:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2020-01-16 18:59:00,561 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 13 [2020-01-16 18:59:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:00,562 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-01-16 18:59:00,562 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:59:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2020-01-16 18:59:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:59:00,562 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:00,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:00,563 INFO L426 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:59:00,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1602738831, now seen corresponding path program 21 times [2020-01-16 18:59:00,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:00,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289538063] [2020-01-16 18:59:00,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:00,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289538063] [2020-01-16 18:59:00,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:00,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:59:00,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183130228] [2020-01-16 18:59:00,670 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:59:00,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:00,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:59:00,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:59:00,671 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 6 states. [2020-01-16 18:59:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:00,705 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-01-16 18:59:00,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:59:00,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:59:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:00,706 INFO L225 Difference]: With dead ends: 37 [2020-01-16 18:59:00,706 INFO L226 Difference]: Without dead ends: 29 [2020-01-16 18:59:00,706 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-01-16 18:59:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-01-16 18:59:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2020-01-16 18:59:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-01-16 18:59:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-01-16 18:59:00,708 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2020-01-16 18:59:00,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:00,708 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-01-16 18:59:00,708 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:59:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-01-16 18:59:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:59:00,709 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:00,709 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:00,709 INFO L426 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:59:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash 115010229, now seen corresponding path program 22 times [2020-01-16 18:59:00,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:00,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665490842] [2020-01-16 18:59:00,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:00,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665490842] [2020-01-16 18:59:00,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:00,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:59:00,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400222201] [2020-01-16 18:59:00,821 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:59:00,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:00,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:59:00,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:59:00,822 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 6 states. [2020-01-16 18:59:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:00,850 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-01-16 18:59:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:59:00,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:59:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:00,851 INFO L225 Difference]: With dead ends: 29 [2020-01-16 18:59:00,851 INFO L226 Difference]: Without dead ends: 22 [2020-01-16 18:59:00,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-01-16 18:59:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-01-16 18:59:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-01-16 18:59:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-01-16 18:59:00,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-01-16 18:59:00,854 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2020-01-16 18:59:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:00,854 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-01-16 18:59:00,854 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:59:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2020-01-16 18:59:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:59:00,855 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:00,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:00,855 INFO L426 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:59:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:00,856 INFO L82 PathProgramCache]: Analyzing trace with hash 111442353, now seen corresponding path program 23 times [2020-01-16 18:59:00,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:00,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246346993] [2020-01-16 18:59:00,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:00,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246346993] [2020-01-16 18:59:00,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:00,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:59:00,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733958165] [2020-01-16 18:59:00,960 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:59:00,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:00,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:59:00,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:59:00,961 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 6 states. [2020-01-16 18:59:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:01,003 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-01-16 18:59:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:59:01,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:59:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:01,004 INFO L225 Difference]: With dead ends: 27 [2020-01-16 18:59:01,004 INFO L226 Difference]: Without dead ends: 17 [2020-01-16 18:59:01,004 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-01-16 18:59:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-01-16 18:59:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-01-16 18:59:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-01-16 18:59:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-01-16 18:59:01,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2020-01-16 18:59:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:01,006 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-01-16 18:59:01,006 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:59:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-01-16 18:59:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-01-16 18:59:01,007 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:01,007 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:01,008 INFO L426 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2020-01-16 18:59:01,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:01,008 INFO L82 PathProgramCache]: Analyzing trace with hash 970316883, now seen corresponding path program 24 times [2020-01-16 18:59:01,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:01,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981558158] [2020-01-16 18:59:01,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:01,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981558158] [2020-01-16 18:59:01,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:01,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-01-16 18:59:01,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014367980] [2020-01-16 18:59:01,107 INFO L458 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-01-16 18:59:01,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:01,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-01-16 18:59:01,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-01-16 18:59:01,107 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2020-01-16 18:59:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:01,129 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-01-16 18:59:01,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-01-16 18:59:01,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-01-16 18:59:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:01,130 INFO L225 Difference]: With dead ends: 16 [2020-01-16 18:59:01,130 INFO L226 Difference]: Without dead ends: 0 [2020-01-16 18:59:01,130 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-01-16 18:59:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-01-16 18:59:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-01-16 18:59:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-01-16 18:59:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-01-16 18:59:01,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-01-16 18:59:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:01,132 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-01-16 18:59:01,132 INFO L479 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-01-16 18:59:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-01-16 18:59:01,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-01-16 18:59:01,137 INFO L202 PluginConnector]: Adding new model example_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.01 06:59:01 BasicIcfg [2020-01-16 18:59:01,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-01-16 18:59:01,140 INFO L168 Benchmark]: Toolchain (without parser) took 5773.35 ms. Allocated memory was 134.7 MB in the beginning and 286.3 MB in the end (delta: 151.5 MB). Free memory was 116.7 MB in the beginning and 173.8 MB in the end (delta: -57.1 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB. [2020-01-16 18:59:01,141 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.48 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-01-16 18:59:01,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.43 ms. Allocated memory is still 134.7 MB. Free memory was 116.5 MB in the beginning and 114.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-01-16 18:59:01,142 INFO L168 Benchmark]: Boogie Preprocessor took 20.83 ms. Allocated memory is still 134.7 MB. Free memory was 114.9 MB in the beginning and 113.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-01-16 18:59:01,143 INFO L168 Benchmark]: RCFGBuilder took 276.84 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 103.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-01-16 18:59:01,143 INFO L168 Benchmark]: TraceAbstraction took 5433.53 ms. Allocated memory was 134.7 MB in the beginning and 286.3 MB in the end (delta: 151.5 MB). Free memory was 102.6 MB in the beginning and 173.8 MB in the end (delta: -71.1 MB). Peak memory consumption was 80.4 MB. Max. memory is 7.1 GB. [2020-01-16 18:59:01,146 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.48 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 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.43 ms. Allocated memory is still 134.7 MB. Free memory was 116.5 MB in the beginning and 114.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.83 ms. Allocated memory is still 134.7 MB. Free memory was 114.9 MB in the beginning and 113.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 276.84 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 103.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5433.53 ms. Allocated memory was 134.7 MB in the beginning and 286.3 MB in the end (delta: 151.5 MB). Free memory was 102.6 MB in the beginning and 173.8 MB in the end (delta: -71.1 MB). Peak memory consumption was 80.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.1s, 36 ProgramPointsBefore, 30 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.1s, 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.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.0s 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.1s SatisfiabilityAnalysisTime, 2.9s 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...