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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -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 22:58:39,385 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 22:58:39,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 22:58:39,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 22:58:39,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 22:58:39,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 22:58:39,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 22:58:39,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 22:58:39,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 22:58:39,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 22:58:39,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 22:58:39,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 22:58:39,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 22:58:39,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 22:58:39,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 22:58:39,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 22:58:39,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 22:58:39,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 22:58:39,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 22:58:39,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 22:58:39,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 22:58:39,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 22:58:39,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 22:58:39,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 22:58:39,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 22:58:39,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 22:58:39,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 22:58:39,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 22:58:39,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 22:58:39,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 22:58:39,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 22:58:39,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 22:58:39,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 22:58:39,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 22:58:39,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 22:58:39,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 22:58:39,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 22:58:39,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 22:58:39,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 22:58:39,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 22:58:39,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 22:58:39,439 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 22:58:39,463 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 22:58:39,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 22:58:39,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 22:58:39,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 22:58:39,466 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 22:58:39,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 22:58:39,467 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 22:58:39,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 22:58:39,467 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 22:58:39,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 22:58:39,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 22:58:39,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 22:58:39,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 22:58:39,469 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 22:58:39,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 22:58:39,470 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 22:58:39,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 22:58:39,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 22:58:39,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 22:58:39,470 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 22:58:39,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 22:58:39,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 22:58:39,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 22:58:39,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 22:58:39,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 22:58:39,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 22:58:39,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 22:58:39,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 22:58:39,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK
[2019-10-13 22:58:39,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 22:58:39,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 22:58:39,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 22:58:39,757 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 22:58:39,757 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 22:58:39,758 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 22:58:39,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0e0aab0/2569e7bb32004605bc9fecf6dfd1d6b8/FLAG4a9dc84af
[2019-10-13 22:58:40,401 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 22:58:40,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c
[2019-10-13 22:58:40,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0e0aab0/2569e7bb32004605bc9fecf6dfd1d6b8/FLAG4a9dc84af
[2019-10-13 22:58:40,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0e0aab0/2569e7bb32004605bc9fecf6dfd1d6b8
[2019-10-13 22:58:40,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 22:58:40,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 22:58:40,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 22:58:40,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 22:58:40,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 22:58:40,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:40" (1/1) ...
[2019-10-13 22:58:40,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260aba50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:40, skipping insertion in model container
[2019-10-13 22:58:40,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:40" (1/1) ...
[2019-10-13 22:58:40,768 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 22:58:40,830 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 22:58:41,131 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 22:58:41,136 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 22:58:41,286 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 22:58:41,301 INFO L192 MainTranslator]: Completed translation
[2019-10-13 22:58:41,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:41 WrapperNode
[2019-10-13 22:58:41,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 22:58:41,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 22:58:41,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 22:58:41,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 22:58:41,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:41" (1/1) ...
[2019-10-13 22:58:41,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:41" (1/1) ...
[2019-10-13 22:58:41,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:41" (1/1) ...
[2019-10-13 22:58:41,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:41" (1/1) ...
[2019-10-13 22:58:41,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:41" (1/1) ...
[2019-10-13 22:58:41,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:41" (1/1) ...
[2019-10-13 22:58:41,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:41" (1/1) ...
[2019-10-13 22:58:41,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 22:58:41,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 22:58:41,359 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 22:58:41,360 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 22:58:41,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:41" (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 22:58:41,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 22:58:41,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 22:58:41,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 22:58:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 22:58:41,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-10-13 22:58:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2019-10-13 22:58:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 22:58:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 22:58:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 22:58:41,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 22:58:42,142 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 22:58:42,143 INFO L284 CfgBuilder]: Removed 0 assume(true) statements.
[2019-10-13 22:58:42,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:42 BoogieIcfgContainer
[2019-10-13 22:58:42,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 22:58:42,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 22:58:42,147 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 22:58:42,153 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 22:58:42,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:58:40" (1/3) ...
[2019-10-13 22:58:42,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4edee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:42, skipping insertion in model container
[2019-10-13 22:58:42,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:41" (2/3) ...
[2019-10-13 22:58:42,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4edee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:42, skipping insertion in model container
[2019-10-13 22:58:42,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:42" (3/3) ...
[2019-10-13 22:58:42,161 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c
[2019-10-13 22:58:42,172 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 22:58:42,187 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations.
[2019-10-13 22:58:42,200 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations.
[2019-10-13 22:58:42,227 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 22:58:42,227 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 22:58:42,227 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 22:58:42,228 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 22:58:42,228 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 22:58:42,228 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 22:58:42,228 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 22:58:42,228 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 22:58:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states.
[2019-10-13 22:58:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2019-10-13 22:58:42,255 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:42,256 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:58:42,258 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:42,263 INFO L82 PathProgramCache]: Analyzing trace with hash 814642412, now seen corresponding path program 1 times
[2019-10-13 22:58:42,270 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:42,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533415610]
[2019-10-13 22:58:42,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:42,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:42,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:42,439 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 22:58:42,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533415610]
[2019-10-13 22:58:42,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:42,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:58:42,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889658357]
[2019-10-13 22:58:42,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:58:42,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:42,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:58:42,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:58:42,465 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 4 states.
[2019-10-13 22:58:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:42,841 INFO L93 Difference]: Finished difference Result 134 states and 210 transitions.
[2019-10-13 22:58:42,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:58:42,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2019-10-13 22:58:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:42,858 INFO L225 Difference]: With dead ends: 134
[2019-10-13 22:58:42,858 INFO L226 Difference]: Without dead ends: 117
[2019-10-13 22:58:42,862 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 22:58:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2019-10-13 22:58:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2019-10-13 22:58:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states.
[2019-10-13 22:58:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions.
[2019-10-13 22:58:42,943 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 10
[2019-10-13 22:58:42,944 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:42,944 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions.
[2019-10-13 22:58:42,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:58:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions.
[2019-10-13 22:58:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2019-10-13 22:58:42,948 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:42,948 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:58:42,949 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash -515885943, now seen corresponding path program 1 times
[2019-10-13 22:58:42,951 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:42,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560333911]
[2019-10-13 22:58:42,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:42,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:42,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:43,034 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 22:58:43,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560333911]
[2019-10-13 22:58:43,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:43,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:58:43,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697756080]
[2019-10-13 22:58:43,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:58:43,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:58:43,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:58:43,039 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 4 states.
[2019-10-13 22:58:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:43,231 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions.
[2019-10-13 22:58:43,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:58:43,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2019-10-13 22:58:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:43,233 INFO L225 Difference]: With dead ends: 117
[2019-10-13 22:58:43,234 INFO L226 Difference]: Without dead ends: 112
[2019-10-13 22:58:43,235 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 22:58:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2019-10-13 22:58:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112.
[2019-10-13 22:58:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states.
[2019-10-13 22:58:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions.
[2019-10-13 22:58:43,246 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 11
[2019-10-13 22:58:43,246 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:43,248 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions.
[2019-10-13 22:58:43,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:58:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions.
[2019-10-13 22:58:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2019-10-13 22:58:43,249 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:43,250 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:58:43,250 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:43,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:43,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1762372468, now seen corresponding path program 1 times
[2019-10-13 22:58:43,251 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:43,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055668480]
[2019-10-13 22:58:43,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:43,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:43,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:58:43,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055668480]
[2019-10-13 22:58:43,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:43,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 22:58:43,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988171502]
[2019-10-13 22:58:43,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 22:58:43,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:43,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 22:58:43,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 22:58:43,359 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 5 states.
[2019-10-13 22:58:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:43,574 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions.
[2019-10-13 22:58:43,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 22:58:43,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2019-10-13 22:58:43,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:43,576 INFO L225 Difference]: With dead ends: 112
[2019-10-13 22:58:43,576 INFO L226 Difference]: Without dead ends: 110
[2019-10-13 22:58:43,577 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 22:58:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2019-10-13 22:58:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110.
[2019-10-13 22:58:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states.
[2019-10-13 22:58:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions.
[2019-10-13 22:58:43,585 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 14
[2019-10-13 22:58:43,585 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:43,585 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions.
[2019-10-13 22:58:43,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 22:58:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions.
[2019-10-13 22:58:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2019-10-13 22:58:43,586 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:43,587 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:58:43,587 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:43,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:43,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1201025248, now seen corresponding path program 1 times
[2019-10-13 22:58:43,588 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:43,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216879974]
[2019-10-13 22:58:43,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:43,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:43,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:43,635 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 22:58:43,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216879974]
[2019-10-13 22:58:43,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:43,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:58:43,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583297268]
[2019-10-13 22:58:43,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:58:43,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:43,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:58:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:58:43,638 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 4 states.
[2019-10-13 22:58:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:43,804 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions.
[2019-10-13 22:58:43,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:58:43,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2019-10-13 22:58:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:43,806 INFO L225 Difference]: With dead ends: 110
[2019-10-13 22:58:43,806 INFO L226 Difference]: Without dead ends: 106
[2019-10-13 22:58:43,807 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 22:58:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2019-10-13 22:58:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106.
[2019-10-13 22:58:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states.
[2019-10-13 22:58:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions.
[2019-10-13 22:58:43,815 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 15
[2019-10-13 22:58:43,815 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:43,816 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions.
[2019-10-13 22:58:43,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:58:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions.
[2019-10-13 22:58:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2019-10-13 22:58:43,817 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:43,817 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:58:43,817 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1436191013, now seen corresponding path program 1 times
[2019-10-13 22:58:43,818 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:43,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825109738]
[2019-10-13 22:58:43,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:43,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:43,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:43,879 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 22:58:43,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825109738]
[2019-10-13 22:58:43,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:43,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 22:58:43,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851368134]
[2019-10-13 22:58:43,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 22:58:43,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:43,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 22:58:43,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 22:58:43,884 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 5 states.
[2019-10-13 22:58:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:44,132 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions.
[2019-10-13 22:58:44,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 22:58:44,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2019-10-13 22:58:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:44,135 INFO L225 Difference]: With dead ends: 124
[2019-10-13 22:58:44,135 INFO L226 Difference]: Without dead ends: 122
[2019-10-13 22:58:44,136 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 22:58:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2019-10-13 22:58:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104.
[2019-10-13 22:58:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states.
[2019-10-13 22:58:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions.
[2019-10-13 22:58:44,157 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 16
[2019-10-13 22:58:44,158 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:44,158 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions.
[2019-10-13 22:58:44,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 22:58:44,158 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions.
[2019-10-13 22:58:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2019-10-13 22:58:44,161 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:44,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 22:58:44,164 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:44,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1437730213, now seen corresponding path program 1 times
[2019-10-13 22:58:44,165 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:44,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335765602]
[2019-10-13 22:58:44,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:44,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:44,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:44,250 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 22:58:44,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335765602]
[2019-10-13 22:58:44,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:44,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 22:58:44,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236180486]
[2019-10-13 22:58:44,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 22:58:44,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:44,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 22:58:44,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 22:58:44,253 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 5 states.
[2019-10-13 22:58:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:44,443 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions.
[2019-10-13 22:58:44,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 22:58:44,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2019-10-13 22:58:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:44,445 INFO L225 Difference]: With dead ends: 104
[2019-10-13 22:58:44,445 INFO L226 Difference]: Without dead ends: 102
[2019-10-13 22:58:44,446 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 22:58:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2019-10-13 22:58:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102.
[2019-10-13 22:58:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states.
[2019-10-13 22:58:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions.
[2019-10-13 22:58:44,452 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 16
[2019-10-13 22:58:44,452 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:44,453 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions.
[2019-10-13 22:58:44,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 22:58:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions.
[2019-10-13 22:58:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2019-10-13 22:58:44,454 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:44,454 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 22:58:44,454 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1572251555, now seen corresponding path program 1 times
[2019-10-13 22:58:44,455 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:44,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561565674]
[2019-10-13 22:58:44,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:44,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:44,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:44,538 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 22:58:44,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561565674]
[2019-10-13 22:58:44,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:44,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 22:58:44,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026521358]
[2019-10-13 22:58:44,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 22:58:44,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:44,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 22:58:44,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 22:58:44,540 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 5 states.
[2019-10-13 22:58:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:44,764 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions.
[2019-10-13 22:58:44,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 22:58:44,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2019-10-13 22:58:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:44,766 INFO L225 Difference]: With dead ends: 119
[2019-10-13 22:58:44,766 INFO L226 Difference]: Without dead ends: 117
[2019-10-13 22:58:44,766 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 22:58:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2019-10-13 22:58:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100.
[2019-10-13 22:58:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states.
[2019-10-13 22:58:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions.
[2019-10-13 22:58:44,772 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 17
[2019-10-13 22:58:44,773 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:44,773 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions.
[2019-10-13 22:58:44,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 22:58:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions.
[2019-10-13 22:58:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2019-10-13 22:58:44,774 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:44,774 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 22:58:44,775 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:44,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:44,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1573616975, now seen corresponding path program 1 times
[2019-10-13 22:58:44,775 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:44,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574764767]
[2019-10-13 22:58:44,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:44,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:44,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:44,819 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 22:58:44,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574764767]
[2019-10-13 22:58:44,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:44,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 22:58:44,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861567301]
[2019-10-13 22:58:44,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 22:58:44,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:44,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 22:58:44,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 22:58:44,821 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 5 states.
[2019-10-13 22:58:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:45,059 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions.
[2019-10-13 22:58:45,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 22:58:45,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2019-10-13 22:58:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:45,061 INFO L225 Difference]: With dead ends: 119
[2019-10-13 22:58:45,062 INFO L226 Difference]: Without dead ends: 117
[2019-10-13 22:58:45,062 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 22:58:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2019-10-13 22:58:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98.
[2019-10-13 22:58:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states.
[2019-10-13 22:58:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions.
[2019-10-13 22:58:45,068 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 17
[2019-10-13 22:58:45,069 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:45,069 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions.
[2019-10-13 22:58:45,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 22:58:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions.
[2019-10-13 22:58:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2019-10-13 22:58:45,070 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:45,070 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 22:58:45,070 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:45,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1619966805, now seen corresponding path program 1 times
[2019-10-13 22:58:45,071 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:45,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060776055]
[2019-10-13 22:58:45,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:45,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:45,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:45,183 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 22:58:45,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060776055]
[2019-10-13 22:58:45,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:45,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 22:58:45,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112447359]
[2019-10-13 22:58:45,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 22:58:45,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:45,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 22:58:45,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 22:58:45,185 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 5 states.
[2019-10-13 22:58:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:45,370 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions.
[2019-10-13 22:58:45,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 22:58:45,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2019-10-13 22:58:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:45,372 INFO L225 Difference]: With dead ends: 98
[2019-10-13 22:58:45,372 INFO L226 Difference]: Without dead ends: 94
[2019-10-13 22:58:45,372 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 22:58:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2019-10-13 22:58:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2019-10-13 22:58:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states.
[2019-10-13 22:58:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions.
[2019-10-13 22:58:45,378 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 17
[2019-10-13 22:58:45,379 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:45,379 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions.
[2019-10-13 22:58:45,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 22:58:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions.
[2019-10-13 22:58:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2019-10-13 22:58:45,380 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:45,380 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 22:58:45,381 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1537489112, now seen corresponding path program 1 times
[2019-10-13 22:58:45,381 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:45,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277169773]
[2019-10-13 22:58:45,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:45,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:45,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:45,462 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 22:58:45,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277169773]
[2019-10-13 22:58:45,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:45,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 22:58:45,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727153676]
[2019-10-13 22:58:45,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 22:58:45,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:45,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 22:58:45,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 22:58:45,465 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 5 states.
[2019-10-13 22:58:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:45,703 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions.
[2019-10-13 22:58:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 22:58:45,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2019-10-13 22:58:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:45,705 INFO L225 Difference]: With dead ends: 110
[2019-10-13 22:58:45,705 INFO L226 Difference]: Without dead ends: 108
[2019-10-13 22:58:45,706 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 22:58:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2019-10-13 22:58:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92.
[2019-10-13 22:58:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states.
[2019-10-13 22:58:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions.
[2019-10-13 22:58:45,710 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 18
[2019-10-13 22:58:45,711 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:45,711 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions.
[2019-10-13 22:58:45,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 22:58:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions.
[2019-10-13 22:58:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2019-10-13 22:58:45,712 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:45,712 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 22:58:45,713 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:45,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash -894647034, now seen corresponding path program 1 times
[2019-10-13 22:58:45,713 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:45,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429247274]
[2019-10-13 22:58:45,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:45,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:45,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:45,756 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 22:58:45,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429247274]
[2019-10-13 22:58:45,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:45,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-10-13 22:58:45,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544670449]
[2019-10-13 22:58:45,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-10-13 22:58:45,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:45,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-10-13 22:58:45,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2019-10-13 22:58:45,758 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 6 states.
[2019-10-13 22:58:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:45,946 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions.
[2019-10-13 22:58:45,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 22:58:45,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2019-10-13 22:58:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:45,948 INFO L225 Difference]: With dead ends: 102
[2019-10-13 22:58:45,948 INFO L226 Difference]: Without dead ends: 100
[2019-10-13 22:58:45,948 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 22:58:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2019-10-13 22:58:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90.
[2019-10-13 22:58:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states.
[2019-10-13 22:58:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions.
[2019-10-13 22:58:45,953 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 19
[2019-10-13 22:58:45,953 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:45,953 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions.
[2019-10-13 22:58:45,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-10-13 22:58:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions.
[2019-10-13 22:58:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2019-10-13 22:58:45,954 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:45,954 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 22:58:45,954 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:45,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1964251151, now seen corresponding path program 1 times
[2019-10-13 22:58:45,955 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:45,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717943996]
[2019-10-13 22:58:45,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:45,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:45,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 22:58:45,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717943996]
[2019-10-13 22:58:45,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:45,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 22:58:45,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571599864]
[2019-10-13 22:58:45,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 22:58:45,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:45,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 22:58:45,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 22:58:45,999 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 4 states.
[2019-10-13 22:58:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:46,109 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions.
[2019-10-13 22:58:46,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-10-13 22:58:46,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2019-10-13 22:58:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:46,111 INFO L225 Difference]: With dead ends: 90
[2019-10-13 22:58:46,111 INFO L226 Difference]: Without dead ends: 57
[2019-10-13 22:58:46,111 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 22:58:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2019-10-13 22:58:46,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2019-10-13 22:58:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2019-10-13 22:58:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions.
[2019-10-13 22:58:46,115 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 20
[2019-10-13 22:58:46,115 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:46,115 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions.
[2019-10-13 22:58:46,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 22:58:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions.
[2019-10-13 22:58:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2019-10-13 22:58:46,117 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:46,117 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]
[2019-10-13 22:58:46,117 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1215413267, now seen corresponding path program 1 times
[2019-10-13 22:58:46,118 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:46,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567621598]
[2019-10-13 22:58:46,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:46,118 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:46,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:46,271 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 22:58:46,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567621598]
[2019-10-13 22:58:46,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:46,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-10-13 22:58:46,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087059400]
[2019-10-13 22:58:46,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-10-13 22:58:46,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:46,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-10-13 22:58:46,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156
[2019-10-13 22:58:46,273 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 13 states.
[2019-10-13 22:58:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:46,399 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions.
[2019-10-13 22:58:46,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-10-13 22:58:46,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47
[2019-10-13 22:58:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:46,401 INFO L225 Difference]: With dead ends: 66
[2019-10-13 22:58:46,401 INFO L226 Difference]: Without dead ends: 64
[2019-10-13 22:58:46,401 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 22:58:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2019-10-13 22:58:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55.
[2019-10-13 22:58:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2019-10-13 22:58:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions.
[2019-10-13 22:58:46,404 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 47
[2019-10-13 22:58:46,405 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:46,405 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions.
[2019-10-13 22:58:46,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-10-13 22:58:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions.
[2019-10-13 22:58:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2019-10-13 22:58:46,406 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:46,406 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]
[2019-10-13 22:58:46,406 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:46,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1215399365, now seen corresponding path program 1 times
[2019-10-13 22:58:46,407 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:46,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181189541]
[2019-10-13 22:58:46,407 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:46,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:46,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:46,545 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 22:58:46,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181189541]
[2019-10-13 22:58:46,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:46,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-10-13 22:58:46,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270041282]
[2019-10-13 22:58:46,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-10-13 22:58:46,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:46,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-10-13 22:58:46,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156
[2019-10-13 22:58:46,548 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 13 states.
[2019-10-13 22:58:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:46,667 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions.
[2019-10-13 22:58:46,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2019-10-13 22:58:46,667 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47
[2019-10-13 22:58:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:46,668 INFO L225 Difference]: With dead ends: 55
[2019-10-13 22:58:46,668 INFO L226 Difference]: Without dead ends: 53
[2019-10-13 22:58:46,669 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 22:58:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2019-10-13 22:58:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53.
[2019-10-13 22:58:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2019-10-13 22:58:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions.
[2019-10-13 22:58:46,671 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47
[2019-10-13 22:58:46,672 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:46,672 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions.
[2019-10-13 22:58:46,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-10-13 22:58:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions.
[2019-10-13 22:58:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2019-10-13 22:58:46,673 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:46,673 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 22:58:46,673 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:46,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:46,674 INFO L82 PathProgramCache]: Analyzing trace with hash -976890969, now seen corresponding path program 1 times
[2019-10-13 22:58:46,674 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:46,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727821081]
[2019-10-13 22:58:46,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:46,675 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:46,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:46,850 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 22:58:46,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727821081]
[2019-10-13 22:58:46,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:46,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 22:58:46,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485209159]
[2019-10-13 22:58:46,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 22:58:46,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:46,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 22:58:46,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 22:58:46,853 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 5 states.
[2019-10-13 22:58:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:46,955 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions.
[2019-10-13 22:58:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-10-13 22:58:46,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48
[2019-10-13 22:58:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:46,956 INFO L225 Difference]: With dead ends: 61
[2019-10-13 22:58:46,956 INFO L226 Difference]: Without dead ends: 59
[2019-10-13 22:58:46,956 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 22:58:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2019-10-13 22:58:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51.
[2019-10-13 22:58:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2019-10-13 22:58:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions.
[2019-10-13 22:58:46,959 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48
[2019-10-13 22:58:46,959 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:46,960 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions.
[2019-10-13 22:58:46,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 22:58:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions.
[2019-10-13 22:58:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2019-10-13 22:58:46,961 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 22:58:46,961 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 22:58:46,962 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 22:58:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 22:58:46,962 INFO L82 PathProgramCache]: Analyzing trace with hash -977321945, now seen corresponding path program 1 times
[2019-10-13 22:58:46,962 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2019-10-13 22:58:46,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143404939]
[2019-10-13 22:58:46,963 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:46,963 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 22:58:46,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 22:58:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 22:58:47,179 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 22:58:47,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143404939]
[2019-10-13 22:58:47,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 22:58:47,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 22:58:47,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618826450]
[2019-10-13 22:58:47,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 22:58:47,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2019-10-13 22:58:47,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 22:58:47,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 22:58:47,181 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 5 states.
[2019-10-13 22:58:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 22:58:47,263 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions.
[2019-10-13 22:58:47,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 22:58:47,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48
[2019-10-13 22:58:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 22:58:47,264 INFO L225 Difference]: With dead ends: 51
[2019-10-13 22:58:47,264 INFO L226 Difference]: Without dead ends: 0
[2019-10-13 22:58:47,264 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 26 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2019-10-13 22:58:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 22:58:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 22:58:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 22:58:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 22:58:47,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48
[2019-10-13 22:58:47,265 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 22:58:47,265 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 22:58:47,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 22:58:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 22:58:47,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 22:58:47,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 22:58:47,372 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true
[2019-10-13 22:58:47,372 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 22:58:47,372 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 22:58:47,373 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true
[2019-10-13 22:58:47,373 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2019-10-13 22:58:47,373 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 22:58:47,373 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed.
[2019-10-13 22:58:47,374 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed.
[2019-10-13 22:58:47,374 INFO L443 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed.
[2019-10-13 22:58:47,374 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed.
[2019-10-13 22:58:47,374 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed.
[2019-10-13 22:58:47,374 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed.
[2019-10-13 22:58:47,375 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed.
[2019-10-13 22:58:47,375 INFO L443 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed.
[2019-10-13 22:58:47,375 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed.
[2019-10-13 22:58:47,375 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed.
[2019-10-13 22:58:47,375 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed.
[2019-10-13 22:58:47,375 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed.
[2019-10-13 22:58:47,376 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed.
[2019-10-13 22:58:47,376 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed.
[2019-10-13 22:58:47,376 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed.
[2019-10-13 22:58:47,376 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed.
[2019-10-13 22:58:47,376 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed.
[2019-10-13 22:58:47,377 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed.
[2019-10-13 22:58:47,377 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 22:58:47,377 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed.
[2019-10-13 22:58:47,377 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed.
[2019-10-13 22:58:47,377 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed.
[2019-10-13 22:58:47,378 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed.
[2019-10-13 22:58:47,378 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed.
[2019-10-13 22:58:47,378 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed.
[2019-10-13 22:58:47,378 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed.
[2019-10-13 22:58:47,378 INFO L443 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed.
[2019-10-13 22:58:47,378 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed.
[2019-10-13 22:58:47,378 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed.
[2019-10-13 22:58:47,378 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed.
[2019-10-13 22:58:47,379 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed.
[2019-10-13 22:58:47,379 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed.
[2019-10-13 22:58:47,379 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed.
[2019-10-13 22:58:47,379 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed.
[2019-10-13 22:58:47,379 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 22:58:47,380 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed.
[2019-10-13 22:58:47,380 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed.
[2019-10-13 22:58:47,380 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed.
[2019-10-13 22:58:47,380 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed.
[2019-10-13 22:58:47,380 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed.
[2019-10-13 22:58:47,381 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed.
[2019-10-13 22:58:47,381 INFO L446 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true
[2019-10-13 22:58:47,381 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed.
[2019-10-13 22:58:47,381 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed.
[2019-10-13 22:58:47,381 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed.
[2019-10-13 22:58:47,381 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed.
[2019-10-13 22:58:47,382 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed.
[2019-10-13 22:58:47,382 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed.
[2019-10-13 22:58:47,382 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed.
[2019-10-13 22:58:47,382 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed.
[2019-10-13 22:58:47,382 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed.
[2019-10-13 22:58:47,383 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed.
[2019-10-13 22:58:47,383 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed.
[2019-10-13 22:58:47,383 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 22:58:47,383 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed.
[2019-10-13 22:58:47,383 INFO L443 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed.
[2019-10-13 22:58:47,383 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed.
[2019-10-13 22:58:47,384 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed.
[2019-10-13 22:58:47,384 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed.
[2019-10-13 22:58:47,384 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed.
[2019-10-13 22:58:47,384 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed.
[2019-10-13 22:58:47,384 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed.
[2019-10-13 22:58:47,384 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed.
[2019-10-13 22:58:47,384 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed.
[2019-10-13 22:58:47,385 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed.
[2019-10-13 22:58:47,385 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed.
[2019-10-13 22:58:47,385 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed.
[2019-10-13 22:58:47,385 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed.
[2019-10-13 22:58:47,385 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed.
[2019-10-13 22:58:47,385 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed.
[2019-10-13 22:58:47,385 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed.
[2019-10-13 22:58:47,386 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed.
[2019-10-13 22:58:47,386 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed.
[2019-10-13 22:58:47,386 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed.
[2019-10-13 22:58:47,386 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 22:58:47,386 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed.
[2019-10-13 22:58:47,386 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed.
[2019-10-13 22:58:47,386 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed.
[2019-10-13 22:58:47,386 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed.
[2019-10-13 22:58:47,387 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: true
[2019-10-13 22:58:47,387 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed.
[2019-10-13 22:58:47,387 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed.
[2019-10-13 22:58:47,387 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed.
[2019-10-13 22:58:47,387 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed.
[2019-10-13 22:58:47,387 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed.
[2019-10-13 22:58:47,387 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed.
[2019-10-13 22:58:47,387 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed.
[2019-10-13 22:58:47,387 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed.
[2019-10-13 22:58:47,388 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed.
[2019-10-13 22:58:47,388 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed.
[2019-10-13 22:58:47,388 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed.
[2019-10-13 22:58:47,388 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed.
[2019-10-13 22:58:47,388 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed.
[2019-10-13 22:58:47,388 INFO L443 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed.
[2019-10-13 22:58:47,388 INFO L443 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed.
[2019-10-13 22:58:47,388 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed.
[2019-10-13 22:58:47,388 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed.
[2019-10-13 22:58:47,389 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed.
[2019-10-13 22:58:47,389 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed.
[2019-10-13 22:58:47,389 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed.
[2019-10-13 22:58:47,389 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed.
[2019-10-13 22:58:47,389 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed.
[2019-10-13 22:58:47,389 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed.
[2019-10-13 22:58:47,390 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed.
[2019-10-13 22:58:47,390 INFO L443 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed.
[2019-10-13 22:58:47,390 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed.
[2019-10-13 22:58:47,390 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed.
[2019-10-13 22:58:47,390 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed.
[2019-10-13 22:58:47,390 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed.
[2019-10-13 22:58:47,391 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed.
[2019-10-13 22:58:47,391 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed.
[2019-10-13 22:58:47,391 INFO L443 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed.
[2019-10-13 22:58:47,391 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed.
[2019-10-13 22:58:47,391 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed.
[2019-10-13 22:58:47,392 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed.
[2019-10-13 22:58:47,392 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed.
[2019-10-13 22:58:47,392 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed.
[2019-10-13 22:58:47,392 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed.
[2019-10-13 22:58:47,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:58:47 BoogieIcfgContainer
[2019-10-13 22:58:47,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 22:58:47,414 INFO L168 Benchmark]: Toolchain (without parser) took 6662.94 ms. Allocated memory was 137.9 MB in the beginning and 285.2 MB in the end (delta: 147.3 MB). Free memory was 102.5 MB in the beginning and 187.8 MB in the end (delta: -85.3 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB.
[2019-10-13 22:58:47,415 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 22:58:47,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.69 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 176.0 MB in the end (delta: -73.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB.
[2019-10-13 22:58:47,417 INFO L168 Benchmark]: Boogie Preprocessor took 55.97 ms. Allocated memory is still 201.9 MB. Free memory was 176.0 MB in the beginning and 173.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
[2019-10-13 22:58:47,418 INFO L168 Benchmark]: RCFGBuilder took 785.47 ms. Allocated memory is still 201.9 MB. Free memory was 173.2 MB in the beginning and 123.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB.
[2019-10-13 22:58:47,419 INFO L168 Benchmark]: TraceAbstraction took 5265.12 ms. Allocated memory was 201.9 MB in the beginning and 285.2 MB in the end (delta: 83.4 MB). Free memory was 123.1 MB in the beginning and 187.8 MB in the end (delta: -64.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB.
[2019-10-13 22:58:47,422 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 550.69 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 176.0 MB in the end (delta: -73.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 55.97 ms. Allocated memory is still 201.9 MB. Free memory was 176.0 MB in the beginning and 173.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 785.47 ms. Allocated memory is still 201.9 MB. Free memory was 173.2 MB in the beginning and 123.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 5265.12 ms. Allocated memory was 201.9 MB in the beginning and 285.2 MB in the end (delta: 83.4 MB). Free memory was 123.1 MB in the beginning and 187.8 MB in the end (delta: -64.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 31]: 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: 914]: 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: 890]: 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
- PositiveResult [Line: 112]: 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: 252]: 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: 100]: 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: 214]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 152]: 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: 168]: 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, 124 locations, 16 error locations. Result: SAFE, OverallTime: 5.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 750 SDtfs, 1904 SDslu, 849 SDs, 0 SdLazy, 2399 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s 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=124occurred 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.1s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 43375 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...