java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 21:06:04,614 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 21:06:04,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 21:06:04,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 21:06:04,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 21:06:04,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 21:06:04,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 21:06:04,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 21:06:04,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 21:06:04,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 21:06:04,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 21:06:04,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 21:06:04,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 21:06:04,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 21:06:04,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 21:06:04,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 21:06:04,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 21:06:04,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 21:06:04,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 21:06:04,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 21:06:04,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 21:06:04,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 21:06:04,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 21:06:04,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 21:06:04,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 21:06:04,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 21:06:04,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 21:06:04,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 21:06:04,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 21:06:04,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 21:06:04,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 21:06:04,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 21:06:04,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 21:06:04,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 21:06:04,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 21:06:04,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 21:06:04,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 21:06:04,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 21:06:04,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 21:06:04,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 21:06:04,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 21:06:04,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-10-13 21:06:04,737 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 21:06:04,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 21:06:04,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 21:06:04,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 21:06:04,739 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 21:06:04,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 21:06:04,744 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 21:06:04,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 21:06:04,745 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 21:06:04,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 21:06:04,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 21:06:04,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 21:06:04,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 21:06:04,746 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 21:06:04,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 21:06:04,746 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 21:06:04,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 21:06:04,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 21:06:04,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 21:06:04,747 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 21:06:04,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 21:06:04,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:06:04,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 21:06:04,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 21:06:04,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 21:06:04,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 21:06:04,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 21:06:04,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 21:06:04,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES
[2019-10-13 21:06:05,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 21:06:05,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 21:06:05,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 21:06:05,059 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 21:06:05,060 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 21:06:05,061 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c
[2019-10-13 21:06:05,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54fc031b9/a916f27ed0564ba1bb6e95e1472480b3/FLAG8b45413b9
[2019-10-13 21:06:05,694 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 21:06:05,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c
[2019-10-13 21:06:05,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54fc031b9/a916f27ed0564ba1bb6e95e1472480b3/FLAG8b45413b9
[2019-10-13 21:06:06,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54fc031b9/a916f27ed0564ba1bb6e95e1472480b3
[2019-10-13 21:06:06,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 21:06:06,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 21:06:06,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 21:06:06,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 21:06:06,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 21:06:06,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:06" (1/1) ...
[2019-10-13 21:06:06,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38cae787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06, skipping insertion in model container
[2019-10-13 21:06:06,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:06" (1/1) ...
[2019-10-13 21:06:06,041 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 21:06:06,103 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 21:06:06,421 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:06:06,427 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 21:06:06,589 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:06:06,605 INFO L192 MainTranslator]: Completed translation
[2019-10-13 21:06:06,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06 WrapperNode
[2019-10-13 21:06:06,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 21:06:06,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 21:06:06,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 21:06:06,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 21:06:06,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06" (1/1) ...
[2019-10-13 21:06:06,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06" (1/1) ...
[2019-10-13 21:06:06,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06" (1/1) ...
[2019-10-13 21:06:06,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06" (1/1) ...
[2019-10-13 21:06:06,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06" (1/1) ...
[2019-10-13 21:06:06,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06" (1/1) ...
[2019-10-13 21:06:06,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06" (1/1) ...
[2019-10-13 21:06:06,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 21:06:06,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 21:06:06,665 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 21:06:06,665 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 21:06:06,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06" (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
[2019-10-13 21:06:06,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 21:06:06,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 21:06:06,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 21:06:06,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 21:06:06,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-10-13 21:06:06,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2019-10-13 21:06:06,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 21:06:06,725 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 21:06:06,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 21:06:06,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 21:06:07,461 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 21:06:07,461 INFO L284 CfgBuilder]: Removed 0 assume(true) statements.
[2019-10-13 21:06:07,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:07 BoogieIcfgContainer
[2019-10-13 21:06:07,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 21:06:07,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 21:06:07,466 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 21:06:07,472 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 21:06:07,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:06:06" (1/3) ...
[2019-10-13 21:06:07,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fb7157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:07, skipping insertion in model container
[2019-10-13 21:06:07,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:06" (2/3) ...
[2019-10-13 21:06:07,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fb7157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:07, skipping insertion in model container
[2019-10-13 21:06:07,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:07" (3/3) ...
[2019-10-13 21:06:07,478 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c
[2019-10-13 21:06:07,489 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 21:06:07,502 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations.
[2019-10-13 21:06:07,515 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations.
[2019-10-13 21:06:07,571 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 21:06:07,572 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 21:06:07,572 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 21:06:07,574 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 21:06:07,574 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 21:06:07,574 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 21:06:07,575 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 21:06:07,575 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 21:06:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states.
[2019-10-13 21:06:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-10-13 21:06:07,619 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:07,620 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:07,622 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:07,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:07,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times
[2019-10-13 21:06:07,638 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:07,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254875421]
[2019-10-13 21:06:07,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:07,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:07,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:07,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254875421]
[2019-10-13 21:06:07,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:07,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:06:07,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624217126]
[2019-10-13 21:06:07,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:06:07,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:07,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:06:07,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:06:07,848 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states.
[2019-10-13 21:06:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:08,227 INFO L93 Difference]: Finished difference Result 135 states and 211 transitions.
[2019-10-13 21:06:08,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 21:06:08,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2019-10-13 21:06:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:08,245 INFO L225 Difference]: With dead ends: 135
[2019-10-13 21:06:08,245 INFO L226 Difference]: Without dead ends: 118
[2019-10-13 21:06:08,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2019-10-13 21:06:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118.
[2019-10-13 21:06:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states.
[2019-10-13 21:06:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions.
[2019-10-13 21:06:08,305 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11
[2019-10-13 21:06:08,306 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:08,306 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions.
[2019-10-13 21:06:08,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:06:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions.
[2019-10-13 21:06:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2019-10-13 21:06:08,307 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:08,307 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:08,308 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:08,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:08,308 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times
[2019-10-13 21:06:08,309 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:08,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272179202]
[2019-10-13 21:06:08,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:08,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:08,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:08,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272179202]
[2019-10-13 21:06:08,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:08,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:06:08,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636567883]
[2019-10-13 21:06:08,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:06:08,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:08,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:06:08,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:06:08,403 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 4 states.
[2019-10-13 21:06:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:08,614 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions.
[2019-10-13 21:06:08,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 21:06:08,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2019-10-13 21:06:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:08,617 INFO L225 Difference]: With dead ends: 118
[2019-10-13 21:06:08,617 INFO L226 Difference]: Without dead ends: 113
[2019-10-13 21:06:08,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2019-10-13 21:06:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113.
[2019-10-13 21:06:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2019-10-13 21:06:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions.
[2019-10-13 21:06:08,640 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12
[2019-10-13 21:06:08,641 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:08,641 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions.
[2019-10-13 21:06:08,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:06:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions.
[2019-10-13 21:06:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-10-13 21:06:08,642 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:08,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:08,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times
[2019-10-13 21:06:08,645 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:08,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471477536]
[2019-10-13 21:06:08,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:08,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:08,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:08,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471477536]
[2019-10-13 21:06:08,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:08,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:06:08,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811393036]
[2019-10-13 21:06:08,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:06:08,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:08,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:06:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:08,732 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 5 states.
[2019-10-13 21:06:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:08,959 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions.
[2019-10-13 21:06:08,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 21:06:08,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2019-10-13 21:06:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:08,963 INFO L225 Difference]: With dead ends: 113
[2019-10-13 21:06:08,963 INFO L226 Difference]: Without dead ends: 111
[2019-10-13 21:06:08,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:06:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states.
[2019-10-13 21:06:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111.
[2019-10-13 21:06:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states.
[2019-10-13 21:06:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions.
[2019-10-13 21:06:08,985 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15
[2019-10-13 21:06:08,985 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:08,985 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions.
[2019-10-13 21:06:08,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:06:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions.
[2019-10-13 21:06:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2019-10-13 21:06:08,990 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:08,990 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:08,991 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:08,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:08,992 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times
[2019-10-13 21:06:08,993 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:08,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297797480]
[2019-10-13 21:06:08,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:08,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:08,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:09,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297797480]
[2019-10-13 21:06:09,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:09,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:06:09,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443392217]
[2019-10-13 21:06:09,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:06:09,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:09,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:06:09,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:06:09,096 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 4 states.
[2019-10-13 21:06:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:09,258 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions.
[2019-10-13 21:06:09,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 21:06:09,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2019-10-13 21:06:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:09,261 INFO L225 Difference]: With dead ends: 111
[2019-10-13 21:06:09,261 INFO L226 Difference]: Without dead ends: 107
[2019-10-13 21:06:09,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2019-10-13 21:06:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2019-10-13 21:06:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states.
[2019-10-13 21:06:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions.
[2019-10-13 21:06:09,270 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16
[2019-10-13 21:06:09,270 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:09,270 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions.
[2019-10-13 21:06:09,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:06:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions.
[2019-10-13 21:06:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2019-10-13 21:06:09,272 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:09,272 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:09,272 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:09,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times
[2019-10-13 21:06:09,273 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:09,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535688677]
[2019-10-13 21:06:09,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:09,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:09,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:09,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535688677]
[2019-10-13 21:06:09,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:09,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:06:09,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389942060]
[2019-10-13 21:06:09,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:06:09,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:09,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:06:09,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:09,333 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 5 states.
[2019-10-13 21:06:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:09,544 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions.
[2019-10-13 21:06:09,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 21:06:09,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2019-10-13 21:06:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:09,546 INFO L225 Difference]: With dead ends: 125
[2019-10-13 21:06:09,546 INFO L226 Difference]: Without dead ends: 123
[2019-10-13 21:06:09,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:06:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2019-10-13 21:06:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105.
[2019-10-13 21:06:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states.
[2019-10-13 21:06:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions.
[2019-10-13 21:06:09,558 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17
[2019-10-13 21:06:09,558 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:09,558 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions.
[2019-10-13 21:06:09,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:06:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions.
[2019-10-13 21:06:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2019-10-13 21:06:09,559 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:09,560 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:09,561 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:09,562 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times
[2019-10-13 21:06:09,562 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:09,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869702211]
[2019-10-13 21:06:09,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:09,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:09,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:09,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869702211]
[2019-10-13 21:06:09,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:09,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:06:09,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851340594]
[2019-10-13 21:06:09,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:06:09,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:09,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:06:09,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:09,649 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 5 states.
[2019-10-13 21:06:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:09,823 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions.
[2019-10-13 21:06:09,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 21:06:09,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2019-10-13 21:06:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:09,825 INFO L225 Difference]: With dead ends: 105
[2019-10-13 21:06:09,825 INFO L226 Difference]: Without dead ends: 103
[2019-10-13 21:06:09,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:06:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2019-10-13 21:06:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103.
[2019-10-13 21:06:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states.
[2019-10-13 21:06:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions.
[2019-10-13 21:06:09,832 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17
[2019-10-13 21:06:09,833 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:09,833 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions.
[2019-10-13 21:06:09,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:06:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions.
[2019-10-13 21:06:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2019-10-13 21:06:09,834 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:09,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:09,835 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times
[2019-10-13 21:06:09,836 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:09,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021542831]
[2019-10-13 21:06:09,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:09,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:09,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:09,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021542831]
[2019-10-13 21:06:09,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:09,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:06:09,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100217669]
[2019-10-13 21:06:09,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:06:09,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:09,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:06:09,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:09,899 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states.
[2019-10-13 21:06:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:10,118 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions.
[2019-10-13 21:06:10,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 21:06:10,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2019-10-13 21:06:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:10,120 INFO L225 Difference]: With dead ends: 120
[2019-10-13 21:06:10,120 INFO L226 Difference]: Without dead ends: 118
[2019-10-13 21:06:10,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2019-10-13 21:06:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2019-10-13 21:06:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101.
[2019-10-13 21:06:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states.
[2019-10-13 21:06:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions.
[2019-10-13 21:06:10,126 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18
[2019-10-13 21:06:10,127 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:10,127 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions.
[2019-10-13 21:06:10,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:06:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions.
[2019-10-13 21:06:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2019-10-13 21:06:10,128 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:10,128 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:10,129 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times
[2019-10-13 21:06:10,130 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:10,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283277744]
[2019-10-13 21:06:10,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:10,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:10,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:10,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283277744]
[2019-10-13 21:06:10,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:10,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:06:10,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80132679]
[2019-10-13 21:06:10,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:06:10,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:06:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:10,174 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 5 states.
[2019-10-13 21:06:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:10,383 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions.
[2019-10-13 21:06:10,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 21:06:10,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2019-10-13 21:06:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:10,384 INFO L225 Difference]: With dead ends: 120
[2019-10-13 21:06:10,384 INFO L226 Difference]: Without dead ends: 118
[2019-10-13 21:06:10,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:06:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2019-10-13 21:06:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99.
[2019-10-13 21:06:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states.
[2019-10-13 21:06:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions.
[2019-10-13 21:06:10,390 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18
[2019-10-13 21:06:10,390 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:10,391 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions.
[2019-10-13 21:06:10,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:06:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions.
[2019-10-13 21:06:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2019-10-13 21:06:10,392 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:10,392 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:10,392 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times
[2019-10-13 21:06:10,393 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:10,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160943235]
[2019-10-13 21:06:10,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:10,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:10,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:10,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160943235]
[2019-10-13 21:06:10,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:10,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:06:10,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686333020]
[2019-10-13 21:06:10,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:06:10,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:10,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:06:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:10,466 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states.
[2019-10-13 21:06:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:10,666 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions.
[2019-10-13 21:06:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 21:06:10,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2019-10-13 21:06:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:10,668 INFO L225 Difference]: With dead ends: 99
[2019-10-13 21:06:10,668 INFO L226 Difference]: Without dead ends: 95
[2019-10-13 21:06:10,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:06:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2019-10-13 21:06:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95.
[2019-10-13 21:06:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2019-10-13 21:06:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions.
[2019-10-13 21:06:10,674 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18
[2019-10-13 21:06:10,674 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:10,675 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions.
[2019-10-13 21:06:10,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:06:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions.
[2019-10-13 21:06:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-10-13 21:06:10,676 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:10,676 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:10,676 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times
[2019-10-13 21:06:10,677 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:10,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606408704]
[2019-10-13 21:06:10,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:10,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:10,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:10,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606408704]
[2019-10-13 21:06:10,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:10,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:06:10,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374906622]
[2019-10-13 21:06:10,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:06:10,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:10,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:06:10,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:10,739 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states.
[2019-10-13 21:06:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:10,970 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions.
[2019-10-13 21:06:10,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 21:06:10,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19
[2019-10-13 21:06:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:10,971 INFO L225 Difference]: With dead ends: 111
[2019-10-13 21:06:10,971 INFO L226 Difference]: Without dead ends: 109
[2019-10-13 21:06:10,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2019-10-13 21:06:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2019-10-13 21:06:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93.
[2019-10-13 21:06:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2019-10-13 21:06:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions.
[2019-10-13 21:06:10,978 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19
[2019-10-13 21:06:10,979 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:10,979 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions.
[2019-10-13 21:06:10,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:06:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions.
[2019-10-13 21:06:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2019-10-13 21:06:10,980 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:10,980 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:10,980 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times
[2019-10-13 21:06:10,981 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:10,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496039777]
[2019-10-13 21:06:10,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:10,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:10,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:11,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496039777]
[2019-10-13 21:06:11,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:11,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-10-13 21:06:11,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775000029]
[2019-10-13 21:06:11,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-10-13 21:06:11,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-10-13 21:06:11,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:06:11,038 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 6 states.
[2019-10-13 21:06:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:11,320 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions.
[2019-10-13 21:06:11,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 21:06:11,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20
[2019-10-13 21:06:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:11,322 INFO L225 Difference]: With dead ends: 103
[2019-10-13 21:06:11,322 INFO L226 Difference]: Without dead ends: 101
[2019-10-13 21:06:11,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2019-10-13 21:06:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2019-10-13 21:06:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91.
[2019-10-13 21:06:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2019-10-13 21:06:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions.
[2019-10-13 21:06:11,328 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20
[2019-10-13 21:06:11,329 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:11,329 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions.
[2019-10-13 21:06:11,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-10-13 21:06:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions.
[2019-10-13 21:06:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2019-10-13 21:06:11,330 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:11,330 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:11,331 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:11,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times
[2019-10-13 21:06:11,332 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:11,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120126693]
[2019-10-13 21:06:11,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:11,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:11,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:11,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120126693]
[2019-10-13 21:06:11,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:11,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:06:11,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063812969]
[2019-10-13 21:06:11,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:06:11,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:11,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:06:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:06:11,363 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 4 states.
[2019-10-13 21:06:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:11,490 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions.
[2019-10-13 21:06:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 21:06:11,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21
[2019-10-13 21:06:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:11,491 INFO L225 Difference]: With dead ends: 91
[2019-10-13 21:06:11,491 INFO L226 Difference]: Without dead ends: 58
[2019-10-13 21:06:11,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2019-10-13 21:06:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58.
[2019-10-13 21:06:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states.
[2019-10-13 21:06:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions.
[2019-10-13 21:06:11,495 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21
[2019-10-13 21:06:11,495 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:11,495 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions.
[2019-10-13 21:06:11,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:06:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions.
[2019-10-13 21:06:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2019-10-13 21:06:11,497 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:11,497 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:11,497 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times
[2019-10-13 21:06:11,498 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:11,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492079790]
[2019-10-13 21:06:11,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:11,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:11,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:11,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492079790]
[2019-10-13 21:06:11,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:11,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-10-13 21:06:11,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089865075]
[2019-10-13 21:06:11,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-10-13 21:06:11,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:11,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-10-13 21:06:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156
[2019-10-13 21:06:11,682 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states.
[2019-10-13 21:06:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:11,806 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions.
[2019-10-13 21:06:11,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-10-13 21:06:11,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48
[2019-10-13 21:06:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:11,808 INFO L225 Difference]: With dead ends: 67
[2019-10-13 21:06:11,808 INFO L226 Difference]: Without dead ends: 65
[2019-10-13 21:06:11,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182
[2019-10-13 21:06:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2019-10-13 21:06:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56.
[2019-10-13 21:06:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2019-10-13 21:06:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions.
[2019-10-13 21:06:11,811 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48
[2019-10-13 21:06:11,811 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:11,812 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions.
[2019-10-13 21:06:11,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-10-13 21:06:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions.
[2019-10-13 21:06:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2019-10-13 21:06:11,813 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:11,813 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:11,814 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times
[2019-10-13 21:06:11,814 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:11,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817047110]
[2019-10-13 21:06:11,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:11,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:11,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:11,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817047110]
[2019-10-13 21:06:11,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:11,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-10-13 21:06:11,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098189818]
[2019-10-13 21:06:11,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-10-13 21:06:11,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:11,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-10-13 21:06:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156
[2019-10-13 21:06:11,966 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 13 states.
[2019-10-13 21:06:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:12,099 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions.
[2019-10-13 21:06:12,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-10-13 21:06:12,100 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48
[2019-10-13 21:06:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:12,101 INFO L225 Difference]: With dead ends: 56
[2019-10-13 21:06:12,101 INFO L226 Difference]: Without dead ends: 54
[2019-10-13 21:06:12,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182
[2019-10-13 21:06:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2019-10-13 21:06:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2019-10-13 21:06:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2019-10-13 21:06:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions.
[2019-10-13 21:06:12,104 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48
[2019-10-13 21:06:12,105 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:12,105 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions.
[2019-10-13 21:06:12,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-10-13 21:06:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions.
[2019-10-13 21:06:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2019-10-13 21:06:12,106 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:12,106 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:12,107 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:12,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times
[2019-10-13 21:06:12,108 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:12,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551119364]
[2019-10-13 21:06:12,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:12,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:12,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:12,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551119364]
[2019-10-13 21:06:12,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:12,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:06:12,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544503653]
[2019-10-13 21:06:12,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:06:12,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:12,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:06:12,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:12,378 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 5 states.
[2019-10-13 21:06:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:12,487 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions.
[2019-10-13 21:06:12,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 21:06:12,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49
[2019-10-13 21:06:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:12,488 INFO L225 Difference]: With dead ends: 62
[2019-10-13 21:06:12,488 INFO L226 Difference]: Without dead ends: 60
[2019-10-13 21:06:12,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 26 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2019-10-13 21:06:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2019-10-13 21:06:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52.
[2019-10-13 21:06:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2019-10-13 21:06:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions.
[2019-10-13 21:06:12,491 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49
[2019-10-13 21:06:12,491 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:12,491 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions.
[2019-10-13 21:06:12,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:06:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions.
[2019-10-13 21:06:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2019-10-13 21:06:12,492 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 21:06:12,492 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:06:12,493 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:06:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:06:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times
[2019-10-13 21:06:12,493 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:06:12,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501252136]
[2019-10-13 21:06:12,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:12,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:06:12,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:06:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:06:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:06:12,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501252136]
[2019-10-13 21:06:12,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:06:12,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:06:12,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070766794]
[2019-10-13 21:06:12,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:06:12,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:06:12,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:06:12,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:06:12,651 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 5 states.
[2019-10-13 21:06:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:06:12,757 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions.
[2019-10-13 21:06:12,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 21:06:12,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49
[2019-10-13 21:06:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:06:12,758 INFO L225 Difference]: With dead ends: 52
[2019-10-13 21:06:12,758 INFO L226 Difference]: Without dead ends: 0
[2019-10-13 21:06:12,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 26 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2019-10-13 21:06:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 21:06:12,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 21:06:12,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 21:06:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 21:06:12,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49
[2019-10-13 21:06:12,760 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:06:12,760 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 21:06:12,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:06:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 21:06:12,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 21:06:12,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 21:06:12,877 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 21:06:12,877 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true
[2019-10-13 21:06:12,877 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 21:06:12,877 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 21:06:12,878 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true
[2019-10-13 21:06:12,878 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2019-10-13 21:06:12,878 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 21:06:12,878 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed.
[2019-10-13 21:06:12,878 INFO L443 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed.
[2019-10-13 21:06:12,878 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed.
[2019-10-13 21:06:12,878 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed.
[2019-10-13 21:06:12,878 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed.
[2019-10-13 21:06:12,878 INFO L443 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed.
[2019-10-13 21:06:12,879 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed.
[2019-10-13 21:06:12,879 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed.
[2019-10-13 21:06:12,879 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed.
[2019-10-13 21:06:12,879 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed.
[2019-10-13 21:06:12,879 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed.
[2019-10-13 21:06:12,879 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed.
[2019-10-13 21:06:12,879 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed.
[2019-10-13 21:06:12,879 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed.
[2019-10-13 21:06:12,879 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed.
[2019-10-13 21:06:12,879 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed.
[2019-10-13 21:06:12,880 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed.
[2019-10-13 21:06:12,880 INFO L439 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))
[2019-10-13 21:06:12,880 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed.
[2019-10-13 21:06:12,880 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed.
[2019-10-13 21:06:12,880 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed.
[2019-10-13 21:06:12,880 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed.
[2019-10-13 21:06:12,880 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed.
[2019-10-13 21:06:12,881 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed.
[2019-10-13 21:06:12,881 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed.
[2019-10-13 21:06:12,881 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed.
[2019-10-13 21:06:12,881 INFO L443 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed.
[2019-10-13 21:06:12,881 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed.
[2019-10-13 21:06:12,881 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed.
[2019-10-13 21:06:12,881 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed.
[2019-10-13 21:06:12,881 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed.
[2019-10-13 21:06:12,882 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed.
[2019-10-13 21:06:12,882 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed.
[2019-10-13 21:06:12,882 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed.
[2019-10-13 21:06:12,882 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed.
[2019-10-13 21:06:12,882 INFO L439 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0))
[2019-10-13 21:06:12,882 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed.
[2019-10-13 21:06:12,882 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed.
[2019-10-13 21:06:12,882 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed.
[2019-10-13 21:06:12,883 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed.
[2019-10-13 21:06:12,883 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed.
[2019-10-13 21:06:12,883 INFO L446 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true
[2019-10-13 21:06:12,883 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed.
[2019-10-13 21:06:12,883 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed.
[2019-10-13 21:06:12,883 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed.
[2019-10-13 21:06:12,883 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed.
[2019-10-13 21:06:12,883 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed.
[2019-10-13 21:06:12,884 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed.
[2019-10-13 21:06:12,884 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed.
[2019-10-13 21:06:12,884 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed.
[2019-10-13 21:06:12,884 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed.
[2019-10-13 21:06:12,884 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed.
[2019-10-13 21:06:12,884 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed.
[2019-10-13 21:06:12,884 INFO L439 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0))
[2019-10-13 21:06:12,885 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed.
[2019-10-13 21:06:12,885 INFO L443 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed.
[2019-10-13 21:06:12,885 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed.
[2019-10-13 21:06:12,885 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed.
[2019-10-13 21:06:12,885 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed.
[2019-10-13 21:06:12,885 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed.
[2019-10-13 21:06:12,885 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed.
[2019-10-13 21:06:12,885 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed.
[2019-10-13 21:06:12,886 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed.
[2019-10-13 21:06:12,886 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed.
[2019-10-13 21:06:12,886 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed.
[2019-10-13 21:06:12,886 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed.
[2019-10-13 21:06:12,886 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed.
[2019-10-13 21:06:12,886 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed.
[2019-10-13 21:06:12,887 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed.
[2019-10-13 21:06:12,887 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed.
[2019-10-13 21:06:12,887 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed.
[2019-10-13 21:06:12,887 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed.
[2019-10-13 21:06:12,887 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed.
[2019-10-13 21:06:12,887 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed.
[2019-10-13 21:06:12,887 INFO L439 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0))
[2019-10-13 21:06:12,888 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed.
[2019-10-13 21:06:12,888 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed.
[2019-10-13 21:06:12,888 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed.
[2019-10-13 21:06:12,888 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed.
[2019-10-13 21:06:12,888 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed.
[2019-10-13 21:06:12,888 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: true
[2019-10-13 21:06:12,888 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed.
[2019-10-13 21:06:12,888 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed.
[2019-10-13 21:06:12,889 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed.
[2019-10-13 21:06:12,889 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed.
[2019-10-13 21:06:12,889 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed.
[2019-10-13 21:06:12,889 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed.
[2019-10-13 21:06:12,889 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed.
[2019-10-13 21:06:12,889 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed.
[2019-10-13 21:06:12,889 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed.
[2019-10-13 21:06:12,889 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed.
[2019-10-13 21:06:12,889 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed.
[2019-10-13 21:06:12,889 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed.
[2019-10-13 21:06:12,890 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed.
[2019-10-13 21:06:12,890 INFO L443 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed.
[2019-10-13 21:06:12,890 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed.
[2019-10-13 21:06:12,890 INFO L443 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed.
[2019-10-13 21:06:12,890 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed.
[2019-10-13 21:06:12,890 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed.
[2019-10-13 21:06:12,890 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed.
[2019-10-13 21:06:12,890 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed.
[2019-10-13 21:06:12,890 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed.
[2019-10-13 21:06:12,890 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed.
[2019-10-13 21:06:12,891 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed.
[2019-10-13 21:06:12,891 INFO L443 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed.
[2019-10-13 21:06:12,891 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed.
[2019-10-13 21:06:12,891 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed.
[2019-10-13 21:06:12,891 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed.
[2019-10-13 21:06:12,891 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed.
[2019-10-13 21:06:12,891 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed.
[2019-10-13 21:06:12,891 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed.
[2019-10-13 21:06:12,892 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed.
[2019-10-13 21:06:12,892 INFO L443 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed.
[2019-10-13 21:06:12,892 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed.
[2019-10-13 21:06:12,892 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed.
[2019-10-13 21:06:12,892 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed.
[2019-10-13 21:06:12,892 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed.
[2019-10-13 21:06:12,892 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed.
[2019-10-13 21:06:12,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:06:12 BoogieIcfgContainer
[2019-10-13 21:06:12,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 21:06:12,910 INFO L168 Benchmark]: Toolchain (without parser) took 6887.12 ms. Allocated memory was 146.3 MB in the beginning and 277.3 MB in the end (delta: 131.1 MB). Free memory was 103.7 MB in the beginning and 143.7 MB in the end (delta: -40.1 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB.
[2019-10-13 21:06:12,911 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 21:06:12,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.35 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 103.5 MB in the beginning and 178.3 MB in the end (delta: -74.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB.
[2019-10-13 21:06:12,913 INFO L168 Benchmark]: Boogie Preprocessor took 57.59 ms. Allocated memory is still 203.9 MB. Free memory was 178.3 MB in the beginning and 175.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2019-10-13 21:06:12,914 INFO L168 Benchmark]: RCFGBuilder took 798.10 ms. Allocated memory is still 203.9 MB. Free memory was 175.7 MB in the beginning and 126.2 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB.
[2019-10-13 21:06:12,915 INFO L168 Benchmark]: TraceAbstraction took 5442.10 ms. Allocated memory was 203.9 MB in the beginning and 277.3 MB in the end (delta: 73.4 MB). Free memory was 125.5 MB in the beginning and 143.7 MB in the end (delta: -18.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB.
[2019-10-13 21:06:12,918 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 583.35 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 103.5 MB in the beginning and 178.3 MB in the end (delta: -74.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 57.59 ms. Allocated memory is still 203.9 MB. Free memory was 178.3 MB in the beginning and 175.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 798.10 ms. Allocated memory is still 203.9 MB. Free memory was 175.7 MB in the beginning and 126.2 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 5442.10 ms. Allocated memory was 203.9 MB in the beginning and 277.3 MB in the end (delta: 73.4 MB). Free memory was 125.5 MB in the beginning and 143.7 MB in the end (delta: -18.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- AllSpecificationsHoldResult: All specifications hold
16 specifications checked. All of them hold
- InvariantResult [Line: 21]: Loop Invariant
Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t
- InvariantResult [Line: 60]: Loop Invariant
Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t
- InvariantResult [Line: 17]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 853]: Loop Invariant
Derived loop invariant: main__t <= main__tagbuf_len && 9 <= main__t
- InvariantResult [Line: 127]: Loop Invariant
Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 125 locations, 16 error locations. Result: SAFE, OverallTime: 5.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 766 SDtfs, 1939 SDslu, 883 SDs, 0 SdLazy, 2375 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 39 SyntacticMatches, 57 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred 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, 16 MinimizatonAttempts, 97 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 37 HoareAnnotationTreeSize, 9 FomulaSimplifications, 1141 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 103 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 44972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...