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.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:40:46,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:40:46,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:40:46,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:40:46,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:40:46,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:40:46,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:40:46,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:40:46,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:40:46,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:40:46,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:40:46,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:40:46,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:40:46,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:40:46,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:40:46,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:40:46,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:40:46,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:40:46,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:40:46,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:40:46,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:40:46,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:40:46,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:40:46,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:40:46,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:40:46,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:40:46,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:40:46,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:40:46,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:40:46,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:40:46,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:40:46,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:40:46,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:40:46,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:40:46,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:40:46,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:40:46,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:40:46,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:40:46,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:40:46,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:40:46,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:40:46,351 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-07 13:40:46,372 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:40:46,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:40:46,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:40:46,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:40:46,375 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:40:46,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:40:46,375 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:40:46,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:40:46,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:40:46,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:40:46,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:40:46,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:40:46,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:40:46,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:40:46,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:40:46,378 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:40:46,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:40:46,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:40:46,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:40:46,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:40:46,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:40:46,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:40:46,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:40:46,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:40:46,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:40:46,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:40:46,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:40:46,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:40:46,381 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-07 13:40:46,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:40:46,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:40:46,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:40:46,655 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:40:46,655 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:40:46,656 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.v+nlh-reducer.c [2019-10-07 13:40:46,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/761f58cf9/a9a5c924337f464fb48ef2e7c1ff5eb0/FLAG84b12a099 [2019-10-07 13:40:47,150 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:40:47,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-10-07 13:40:47,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/761f58cf9/a9a5c924337f464fb48ef2e7c1ff5eb0/FLAG84b12a099 [2019-10-07 13:40:47,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/761f58cf9/a9a5c924337f464fb48ef2e7c1ff5eb0 [2019-10-07 13:40:47,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:40:47,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:40:47,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:47,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:40:47,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:40:47,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:47" (1/1) ... [2019-10-07 13:40:47,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c19cb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47, skipping insertion in model container [2019-10-07 13:40:47,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:47" (1/1) ... [2019-10-07 13:40:47,528 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:40:47,581 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:40:47,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:47,849 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:40:47,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:47,995 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:40:47,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47 WrapperNode [2019-10-07 13:40:47,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:47,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:40:47,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:40:47,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:40:48,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47" (1/1) ... [2019-10-07 13:40:48,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47" (1/1) ... [2019-10-07 13:40:48,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47" (1/1) ... [2019-10-07 13:40:48,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47" (1/1) ... [2019-10-07 13:40:48,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47" (1/1) ... [2019-10-07 13:40:48,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47" (1/1) ... [2019-10-07 13:40:48,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47" (1/1) ... [2019-10-07 13:40:48,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:40:48,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:40:48,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:40:48,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:40:48,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47" (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-07 13:40:48,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:40:48,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:40:48,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:40:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:40:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:40:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:40:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:40:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:40:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:40:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:40:48,521 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:40:48,521 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-07 13:40:48,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:48 BoogieIcfgContainer [2019-10-07 13:40:48,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:40:48,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:40:48,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:40:48,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:40:48,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:40:47" (1/3) ... [2019-10-07 13:40:48,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724d51a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:48, skipping insertion in model container [2019-10-07 13:40:48,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:47" (2/3) ... [2019-10-07 13:40:48,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724d51a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:48, skipping insertion in model container [2019-10-07 13:40:48,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:48" (3/3) ... [2019-10-07 13:40:48,531 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-10-07 13:40:48,541 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:40:48,549 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-10-07 13:40:48,560 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-10-07 13:40:48,588 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:40:48,588 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:40:48,588 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:40:48,588 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:40:48,588 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:40:48,589 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:40:48,589 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:40:48,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:40:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-10-07 13:40:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:40:48,617 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:48,618 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:48,621 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:48,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash -578618040, now seen corresponding path program 1 times [2019-10-07 13:40:48,633 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:48,634 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:48,634 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:48,634 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:48,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:48,843 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:48,844 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:48,844 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:48,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:48,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:48,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:48,863 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2019-10-07 13:40:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:49,071 INFO L93 Difference]: Finished difference Result 132 states and 175 transitions. [2019-10-07 13:40:49,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:49,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:40:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:49,093 INFO L225 Difference]: With dead ends: 132 [2019-10-07 13:40:49,093 INFO L226 Difference]: Without dead ends: 112 [2019-10-07 13:40:49,104 INFO L606 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-07 13:40:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-07 13:40:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 68. [2019-10-07 13:40:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-07 13:40:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-07 13:40:49,176 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 11 [2019-10-07 13:40:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:49,177 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-07 13:40:49,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-07 13:40:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:40:49,179 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:49,179 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:49,181 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:49,182 INFO L82 PathProgramCache]: Analyzing trace with hash -581852346, now seen corresponding path program 1 times [2019-10-07 13:40:49,183 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:49,183 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,183 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:49,184 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:49,236 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-07 13:40:49,237 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,237 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:49,237 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:49,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:49,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:49,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:49,240 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2019-10-07 13:40:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:49,319 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-07 13:40:49,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:49,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:40:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:49,321 INFO L225 Difference]: With dead ends: 68 [2019-10-07 13:40:49,321 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 13:40:49,322 INFO L606 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-07 13:40:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 13:40:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-07 13:40:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-07 13:40:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-07 13:40:49,331 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 11 [2019-10-07 13:40:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:49,331 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-07 13:40:49,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-07 13:40:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:40:49,332 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:49,333 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:49,333 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash -857550477, now seen corresponding path program 1 times [2019-10-07 13:40:49,334 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:49,334 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,335 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:49,335 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:49,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:49,382 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-07 13:40:49,382 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,383 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:49,383 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:49,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:49,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:49,386 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 4 states. [2019-10-07 13:40:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:49,465 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-10-07 13:40:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:49,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:40:49,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:49,467 INFO L225 Difference]: With dead ends: 72 [2019-10-07 13:40:49,467 INFO L226 Difference]: Without dead ends: 70 [2019-10-07 13:40:49,468 INFO L606 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-07 13:40:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-07 13:40:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-07 13:40:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-07 13:40:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-07 13:40:49,477 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-10-07 13:40:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:49,477 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-07 13:40:49,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-07 13:40:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:40:49,478 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:49,479 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:49,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:49,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1903246913, now seen corresponding path program 1 times [2019-10-07 13:40:49,480 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:49,480 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,480 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:49,481 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:49,549 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-07 13:40:49,549 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,551 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:49,551 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:49,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:49,552 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-10-07 13:40:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:49,657 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-10-07 13:40:49,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:49,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-07 13:40:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:49,659 INFO L225 Difference]: With dead ends: 70 [2019-10-07 13:40:49,659 INFO L226 Difference]: Without dead ends: 68 [2019-10-07 13:40:49,660 INFO L606 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-07 13:40:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-07 13:40:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-10-07 13:40:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-07 13:40:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-07 13:40:49,667 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 14 [2019-10-07 13:40:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:49,668 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-07 13:40:49,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-07 13:40:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:40:49,669 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:49,669 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:49,670 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:49,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash 527808727, now seen corresponding path program 1 times [2019-10-07 13:40:49,671 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:49,671 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,671 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:49,671 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:49,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:49,753 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-07 13:40:49,753 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,753 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:49,754 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:49,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:49,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:49,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:49,756 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-10-07 13:40:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:49,838 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-07 13:40:49,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:49,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-07 13:40:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:49,839 INFO L225 Difference]: With dead ends: 68 [2019-10-07 13:40:49,839 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 13:40:49,840 INFO L606 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-07 13:40:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 13:40:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-10-07 13:40:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-07 13:40:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-07 13:40:49,847 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 14 [2019-10-07 13:40:49,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:49,847 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-07 13:40:49,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-07 13:40:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:40:49,848 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:49,848 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:49,849 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1129321007, now seen corresponding path program 1 times [2019-10-07 13:40:49,850 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:49,850 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,850 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:49,850 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:49,913 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-07 13:40:49,913 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,914 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:49,914 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:49,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:49,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:49,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:49,915 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-10-07 13:40:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:50,023 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2019-10-07 13:40:50,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:50,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-07 13:40:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:50,026 INFO L225 Difference]: With dead ends: 111 [2019-10-07 13:40:50,026 INFO L226 Difference]: Without dead ends: 109 [2019-10-07 13:40:50,027 INFO L606 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-07 13:40:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-07 13:40:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2019-10-07 13:40:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-07 13:40:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-07 13:40:50,035 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2019-10-07 13:40:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:50,035 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-07 13:40:50,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-07 13:40:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:40:50,036 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:50,036 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:50,037 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:50,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1128891024, now seen corresponding path program 1 times [2019-10-07 13:40:50,038 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:50,038 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,038 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,038 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:50,072 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-07 13:40:50,073 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,073 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:50,073 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:50,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:50,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:50,074 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-10-07 13:40:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:50,151 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-10-07 13:40:50,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:50,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:40:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:50,152 INFO L225 Difference]: With dead ends: 64 [2019-10-07 13:40:50,152 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 13:40:50,153 INFO L606 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-07 13:40:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 13:40:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-10-07 13:40:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-07 13:40:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-07 13:40:50,159 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 15 [2019-10-07 13:40:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:50,159 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-07 13:40:50,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-07 13:40:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:40:50,160 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:50,160 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:50,161 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash -817795566, now seen corresponding path program 1 times [2019-10-07 13:40:50,162 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:50,162 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,162 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,162 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:50,201 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-07 13:40:50,201 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,201 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:50,202 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:50,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:50,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:50,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:50,203 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-10-07 13:40:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:50,262 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-10-07 13:40:50,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:50,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:40:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:50,264 INFO L225 Difference]: With dead ends: 60 [2019-10-07 13:40:50,264 INFO L226 Difference]: Without dead ends: 56 [2019-10-07 13:40:50,265 INFO L606 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-07 13:40:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-07 13:40:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-07 13:40:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-07 13:40:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-07 13:40:50,270 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 15 [2019-10-07 13:40:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:50,271 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-07 13:40:50,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-07 13:40:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:40:50,272 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:50,272 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:50,273 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash 649216051, now seen corresponding path program 1 times [2019-10-07 13:40:50,273 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:50,274 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,274 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,274 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:50,343 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-07 13:40:50,344 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,344 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:50,344 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:50,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:50,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:50,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:50,345 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-10-07 13:40:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:50,459 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-10-07 13:40:50,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:50,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-07 13:40:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:50,460 INFO L225 Difference]: With dead ends: 94 [2019-10-07 13:40:50,461 INFO L226 Difference]: Without dead ends: 92 [2019-10-07 13:40:50,461 INFO L606 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-07 13:40:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-07 13:40:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-10-07 13:40:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-07 13:40:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-07 13:40:50,476 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2019-10-07 13:40:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:50,479 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-07 13:40:50,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-07 13:40:50,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:40:50,480 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:50,480 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:50,484 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:50,484 INFO L82 PathProgramCache]: Analyzing trace with hash 432363561, now seen corresponding path program 1 times [2019-10-07 13:40:50,484 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:50,485 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,485 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,485 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:50,556 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-07 13:40:50,556 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,557 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:50,557 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:50,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:50,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:50,559 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-10-07 13:40:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:50,663 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-10-07 13:40:50,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:50,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-07 13:40:50,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:50,665 INFO L225 Difference]: With dead ends: 71 [2019-10-07 13:40:50,665 INFO L226 Difference]: Without dead ends: 69 [2019-10-07 13:40:50,666 INFO L606 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-07 13:40:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-07 13:40:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-10-07 13:40:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-07 13:40:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-07 13:40:50,670 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2019-10-07 13:40:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:50,671 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-07 13:40:50,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-07 13:40:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:40:50,672 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:50,672 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:50,673 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:50,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:50,673 INFO L82 PathProgramCache]: Analyzing trace with hash 433902761, now seen corresponding path program 1 times [2019-10-07 13:40:50,673 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:50,673 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,673 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,674 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:50,735 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-07 13:40:50,736 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,736 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:50,736 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:50,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:50,737 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-10-07 13:40:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:50,800 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-10-07 13:40:50,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:50,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-07 13:40:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:50,801 INFO L225 Difference]: With dead ends: 52 [2019-10-07 13:40:50,801 INFO L226 Difference]: Without dead ends: 50 [2019-10-07 13:40:50,802 INFO L606 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-07 13:40:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-07 13:40:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-07 13:40:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-07 13:40:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-07 13:40:50,806 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 16 [2019-10-07 13:40:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:50,806 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-07 13:40:50,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-07 13:40:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:40:50,807 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:50,807 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:50,808 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:50,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:50,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1355384845, now seen corresponding path program 1 times [2019-10-07 13:40:50,808 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:50,809 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,809 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,809 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:50,865 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-07 13:40:50,866 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,866 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:50,866 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:50,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:50,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:50,867 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-10-07 13:40:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:50,934 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-10-07 13:40:50,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:50,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 13:40:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:50,936 INFO L225 Difference]: With dead ends: 49 [2019-10-07 13:40:50,936 INFO L226 Difference]: Without dead ends: 47 [2019-10-07 13:40:50,937 INFO L606 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-07 13:40:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-07 13:40:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-10-07 13:40:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-07 13:40:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-07 13:40:50,941 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2019-10-07 13:40:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:50,941 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-07 13:40:50,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-07 13:40:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:40:50,942 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:50,942 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:50,943 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:50,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash 519737025, now seen corresponding path program 1 times [2019-10-07 13:40:50,943 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:50,944 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,944 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,944 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:50,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:50,986 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-07 13:40:50,986 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:50,986 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:50,987 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:50,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:50,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:50,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:50,988 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-10-07 13:40:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:51,075 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-10-07 13:40:51,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:51,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 13:40:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:51,077 INFO L225 Difference]: With dead ends: 68 [2019-10-07 13:40:51,078 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 13:40:51,078 INFO L606 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-07 13:40:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 13:40:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2019-10-07 13:40:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-07 13:40:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-07 13:40:51,081 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 17 [2019-10-07 13:40:51,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:51,082 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-07 13:40:51,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-07 13:40:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:40:51,083 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:51,083 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:51,083 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash 518371605, now seen corresponding path program 1 times [2019-10-07 13:40:51,084 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:51,084 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,084 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,085 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:51,137 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-07 13:40:51,138 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,138 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:51,138 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:51,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:51,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:51,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:51,139 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-10-07 13:40:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:51,226 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-10-07 13:40:51,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:51,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 13:40:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:51,227 INFO L225 Difference]: With dead ends: 56 [2019-10-07 13:40:51,227 INFO L226 Difference]: Without dead ends: 54 [2019-10-07 13:40:51,228 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-07 13:40:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-07 13:40:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2019-10-07 13:40:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-07 13:40:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-07 13:40:51,231 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 17 [2019-10-07 13:40:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:51,232 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-07 13:40:51,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-07 13:40:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:40:51,232 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:51,232 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:51,233 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:51,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash 566086855, now seen corresponding path program 1 times [2019-10-07 13:40:51,234 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:51,234 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,234 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,234 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:51,279 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-07 13:40:51,279 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,279 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:51,279 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:51,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:51,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:51,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:51,280 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-10-07 13:40:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:51,343 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-10-07 13:40:51,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:51,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-07 13:40:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:51,344 INFO L225 Difference]: With dead ends: 40 [2019-10-07 13:40:51,344 INFO L226 Difference]: Without dead ends: 36 [2019-10-07 13:40:51,345 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-07 13:40:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-07 13:40:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-07 13:40:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-07 13:40:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-07 13:40:51,348 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 17 [2019-10-07 13:40:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:51,348 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-07 13:40:51,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-07 13:40:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:40:51,349 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:51,349 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:51,350 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1068018276, now seen corresponding path program 1 times [2019-10-07 13:40:51,351 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:51,351 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,351 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,351 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:51,387 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-07 13:40:51,388 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,388 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:51,388 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:51,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:51,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:51,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:51,389 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-10-07 13:40:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:51,461 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-10-07 13:40:51,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:51,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-07 13:40:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:51,462 INFO L225 Difference]: With dead ends: 51 [2019-10-07 13:40:51,462 INFO L226 Difference]: Without dead ends: 49 [2019-10-07 13:40:51,463 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-07 13:40:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-07 13:40:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2019-10-07 13:40:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 13:40:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-07 13:40:51,467 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 18 [2019-10-07 13:40:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:51,467 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-07 13:40:51,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-07 13:40:51,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:40:51,468 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:51,469 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:51,469 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:51,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:51,469 INFO L82 PathProgramCache]: Analyzing trace with hash -60997448, now seen corresponding path program 1 times [2019-10-07 13:40:51,470 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:51,470 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,470 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,470 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:51,542 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-07 13:40:51,542 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,543 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:51,543 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:51,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:51,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:51,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:51,545 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-10-07 13:40:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:51,643 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-10-07 13:40:51,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:51,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-07 13:40:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:51,646 INFO L225 Difference]: With dead ends: 55 [2019-10-07 13:40:51,646 INFO L226 Difference]: Without dead ends: 53 [2019-10-07 13:40:51,648 INFO L606 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-07 13:40:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-07 13:40:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2019-10-07 13:40:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 13:40:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-07 13:40:51,656 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-07 13:40:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:51,656 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-07 13:40:51,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-07 13:40:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:40:51,657 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:51,657 INFO L385 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-07 13:40:51,658 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1890917771, now seen corresponding path program 1 times [2019-10-07 13:40:51,659 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:51,659 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,659 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,659 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:51,689 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-07 13:40:51,690 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,690 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:51,690 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:51,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:51,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:51,691 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2019-10-07 13:40:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:51,732 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-07 13:40:51,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:51,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-07 13:40:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:51,732 INFO L225 Difference]: With dead ends: 36 [2019-10-07 13:40:51,732 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:40:51,733 INFO L606 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-07 13:40:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:40:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:40:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:40:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:40:51,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-10-07 13:40:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:51,734 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:40:51,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:40:51,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:40:51,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:40:52,136 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:40:52,136 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:40:52,136 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:40:52,136 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:40:52,136 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:40:52,136 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:40:52,136 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-07 13:40:52,137 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-10-07 13:40:52,137 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2019-10-07 13:40:52,137 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-07 13:40:52,137 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-10-07 13:40:52,137 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-10-07 13:40:52,137 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-07 13:40:52,137 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-10-07 13:40:52,137 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-10-07 13:40:52,138 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-10-07 13:40:52,138 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-10-07 13:40:52,138 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-10-07 13:40:52,138 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-10-07 13:40:52,138 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-10-07 13:40:52,138 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-10-07 13:40:52,138 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-10-07 13:40:52,138 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-10-07 13:40:52,139 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-10-07 13:40:52,139 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-10-07 13:40:52,139 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-10-07 13:40:52,139 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-10-07 13:40:52,139 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-10-07 13:40:52,139 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2019-10-07 13:40:52,139 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-10-07 13:40:52,139 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-10-07 13:40:52,139 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-10-07 13:40:52,140 INFO L439 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-10-07 13:40:52,141 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-10-07 13:40:52,141 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2019-10-07 13:40:52,141 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-10-07 13:40:52,141 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-10-07 13:40:52,141 INFO L439 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-10-07 13:40:52,141 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-10-07 13:40:52,142 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-07 13:40:52,142 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-10-07 13:40:52,142 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-07 13:40:52,143 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-07 13:40:52,143 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-10-07 13:40:52,143 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-10-07 13:40:52,143 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-10-07 13:40:52,143 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-10-07 13:40:52,143 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-10-07 13:40:52,143 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-10-07 13:40:52,143 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-07 13:40:52,144 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-10-07 13:40:52,144 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-10-07 13:40:52,144 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-10-07 13:40:52,144 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-10-07 13:40:52,144 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-10-07 13:40:52,144 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-10-07 13:40:52,144 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-10-07 13:40:52,144 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-10-07 13:40:52,144 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-10-07 13:40:52,145 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-10-07 13:40:52,145 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-10-07 13:40:52,145 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-10-07 13:40:52,145 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-10-07 13:40:52,145 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-10-07 13:40:52,145 INFO L439 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-10-07 13:40:52,145 INFO L439 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-10-07 13:40:52,146 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-07 13:40:52,146 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-07 13:40:52,146 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-10-07 13:40:52,146 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-07 13:40:52,146 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-10-07 13:40:52,146 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-10-07 13:40:52,146 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-10-07 13:40:52,146 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-07 13:40:52,147 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-10-07 13:40:52,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:40:52 BoogieIcfgContainer [2019-10-07 13:40:52,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:40:52,169 INFO L168 Benchmark]: Toolchain (without parser) took 4657.67 ms. Allocated memory was 139.5 MB in the beginning and 243.3 MB in the end (delta: 103.8 MB). Free memory was 104.3 MB in the beginning and 127.3 MB in the end (delta: -22.9 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:52,170 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-07 13:40:52,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.41 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 104.1 MB in the beginning and 181.7 MB in the end (delta: -77.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:52,172 INFO L168 Benchmark]: Boogie Preprocessor took 43.71 ms. Allocated memory is still 203.9 MB. Free memory was 181.7 MB in the beginning and 179.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:52,173 INFO L168 Benchmark]: RCFGBuilder took 481.10 ms. Allocated memory is still 203.9 MB. Free memory was 179.7 MB in the beginning and 155.1 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:52,174 INFO L168 Benchmark]: TraceAbstraction took 3643.16 ms. Allocated memory was 203.9 MB in the beginning and 243.3 MB in the end (delta: 39.3 MB). Free memory was 155.1 MB in the beginning and 127.3 MB in the end (delta: 27.8 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:52,178 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 484.41 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 104.1 MB in the beginning and 181.7 MB in the end (delta: -77.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.71 ms. Allocated memory is still 203.9 MB. Free memory was 181.7 MB in the beginning and 179.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 481.10 ms. Allocated memory is still 203.9 MB. Free memory was 179.7 MB in the beginning and 155.1 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3643.16 ms. Allocated memory was 203.9 MB in the beginning and 243.3 MB in the end (delta: 39.3 MB). Free memory was 155.1 MB in the beginning and 127.3 MB in the end (delta: 27.8 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 75 locations, 17 error locations. Result: SAFE, OverallTime: 3.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 783 SDtfs, 1345 SDslu, 775 SDs, 0 SdLazy, 998 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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, 18 MinimizatonAttempts, 230 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 62 HoareAnnotationTreeSize, 9 FomulaSimplifications, 127856 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1885 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 9532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...