/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:01:03,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:01:03,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:01:03,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:01:03,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:01:03,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:01:03,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:01:03,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:01:03,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:01:03,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:01:03,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:01:03,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:01:03,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:01:03,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:01:03,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:01:03,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:01:03,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:01:03,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:01:03,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:01:03,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:01:03,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:01:03,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:01:03,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:01:03,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:01:03,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:01:03,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:01:03,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:01:03,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:01:03,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:01:03,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:01:03,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:01:03,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:01:03,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:01:03,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:01:03,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:01:03,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:01:03,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:01:03,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:01:03,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:01:03,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:01:03,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:01:03,181 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-11-07 04:01:03,202 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:01:03,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:01:03,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:01:03,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:01:03,204 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:01:03,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:01:03,205 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:01:03,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:01:03,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:01:03,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:01:03,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:01:03,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:01:03,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:01:03,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:01:03,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:01:03,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:01:03,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:01:03,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:01:03,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:01:03,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:01:03,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:01:03,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:01:03,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:01:03,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:01:03,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:01:03,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:01:03,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:01:03,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:01:03,210 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-11-07 04:01:03,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:01:03,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:01:03,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:01:03,543 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:01:03,543 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:01:03,544 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-11-07 04:01:03,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caad8c29d/a0e67d34b21241b29e256941c3ae4b85/FLAGb88ebd4c2 [2019-11-07 04:01:04,226 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:01:04,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-11-07 04:01:04,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caad8c29d/a0e67d34b21241b29e256941c3ae4b85/FLAGb88ebd4c2 [2019-11-07 04:01:04,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caad8c29d/a0e67d34b21241b29e256941c3ae4b85 [2019-11-07 04:01:04,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:01:04,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:01:04,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:04,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:01:04,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:01:04,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:04" (1/1) ... [2019-11-07 04:01:04,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7774798e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:04, skipping insertion in model container [2019-11-07 04:01:04,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:04" (1/1) ... [2019-11-07 04:01:04,463 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:01:04,544 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:01:05,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:05,050 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:01:05,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:05,368 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:01:05,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05 WrapperNode [2019-11-07 04:01:05,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:05,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:01:05,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:01:05,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:01:05,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:05,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:05,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:05,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:05,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:05,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:05,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:05,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:01:05,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:01:05,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:01:05,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:01:05,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (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-11-07 04:01:05,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:01:05,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:01:05,537 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:01:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:01:05,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:01:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 04:01:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:01:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:01:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:01:05,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:01:07,203 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:01:07,204 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:01:07,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:07 BoogieIcfgContainer [2019-11-07 04:01:07,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:01:07,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:01:07,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:01:07,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:01:07,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:01:04" (1/3) ... [2019-11-07 04:01:07,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a96a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:07, skipping insertion in model container [2019-11-07 04:01:07,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (2/3) ... [2019-11-07 04:01:07,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a96a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:07, skipping insertion in model container [2019-11-07 04:01:07,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:07" (3/3) ... [2019-11-07 04:01:07,224 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2019-11-07 04:01:07,235 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:01:07,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-07 04:01:07,261 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-07 04:01:07,299 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:01:07,300 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:01:07,300 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:01:07,300 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:01:07,300 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:01:07,300 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:01:07,301 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:01:07,301 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:01:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states. [2019-11-07 04:01:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 04:01:07,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:07,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:07,342 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1962000724, now seen corresponding path program 1 times [2019-11-07 04:01:07,358 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:07,359 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779322243] [2019-11-07 04:01:07,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:07,528 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779322243] [2019-11-07 04:01:07,529 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:07,530 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:07,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077877233] [2019-11-07 04:01:07,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:07,537 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:07,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:07,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:07,554 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 4 states. [2019-11-07 04:01:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:08,364 INFO L93 Difference]: Finished difference Result 318 states and 578 transitions. [2019-11-07 04:01:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:08,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-07 04:01:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:08,382 INFO L225 Difference]: With dead ends: 318 [2019-11-07 04:01:08,382 INFO L226 Difference]: Without dead ends: 301 [2019-11-07 04:01:08,388 INFO L630 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-11-07 04:01:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-07 04:01:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-11-07 04:01:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-07 04:01:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 424 transitions. [2019-11-07 04:01:08,475 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 424 transitions. Word has length 10 [2019-11-07 04:01:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:08,476 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 424 transitions. [2019-11-07 04:01:08,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 424 transitions. [2019-11-07 04:01:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 04:01:08,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:08,477 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:08,478 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:08,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:08,478 INFO L82 PathProgramCache]: Analyzing trace with hash -692477239, now seen corresponding path program 1 times [2019-11-07 04:01:08,484 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:08,484 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964070944] [2019-11-07 04:01:08,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:08,548 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964070944] [2019-11-07 04:01:08,550 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:08,550 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:08,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047785506] [2019-11-07 04:01:08,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:08,552 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:08,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:08,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:08,553 INFO L87 Difference]: Start difference. First operand 301 states and 424 transitions. Second operand 4 states. [2019-11-07 04:01:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:08,945 INFO L93 Difference]: Finished difference Result 308 states and 431 transitions. [2019-11-07 04:01:08,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:08,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 04:01:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:08,948 INFO L225 Difference]: With dead ends: 308 [2019-11-07 04:01:08,948 INFO L226 Difference]: Without dead ends: 303 [2019-11-07 04:01:08,949 INFO L630 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-11-07 04:01:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-07 04:01:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2019-11-07 04:01:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-07 04:01:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2019-11-07 04:01:08,965 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 11 [2019-11-07 04:01:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:08,966 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2019-11-07 04:01:08,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2019-11-07 04:01:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 04:01:08,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:08,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:08,967 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:08,968 INFO L82 PathProgramCache]: Analyzing trace with hash -676227242, now seen corresponding path program 1 times [2019-11-07 04:01:08,968 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:08,968 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174436522] [2019-11-07 04:01:08,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:09,013 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174436522] [2019-11-07 04:01:09,013 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:09,013 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:09,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403887907] [2019-11-07 04:01:09,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:09,014 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:09,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:09,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:09,015 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand 4 states. [2019-11-07 04:01:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:09,515 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2019-11-07 04:01:09,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:09,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 04:01:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:09,519 INFO L225 Difference]: With dead ends: 296 [2019-11-07 04:01:09,520 INFO L226 Difference]: Without dead ends: 294 [2019-11-07 04:01:09,520 INFO L630 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-11-07 04:01:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-07 04:01:09,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-11-07 04:01:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-07 04:01:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 357 transitions. [2019-11-07 04:01:09,544 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 357 transitions. Word has length 11 [2019-11-07 04:01:09,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:09,544 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 357 transitions. [2019-11-07 04:01:09,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:09,544 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 357 transitions. [2019-11-07 04:01:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 04:01:09,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:09,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:09,546 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash 511795059, now seen corresponding path program 1 times [2019-11-07 04:01:09,547 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:09,547 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683437417] [2019-11-07 04:01:09,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:09,623 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683437417] [2019-11-07 04:01:09,623 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:09,623 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:09,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852636974] [2019-11-07 04:01:09,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:09,624 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:09,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:09,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:09,625 INFO L87 Difference]: Start difference. First operand 294 states and 357 transitions. Second operand 4 states. [2019-11-07 04:01:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:10,019 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2019-11-07 04:01:10,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:10,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 04:01:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:10,022 INFO L225 Difference]: With dead ends: 299 [2019-11-07 04:01:10,022 INFO L226 Difference]: Without dead ends: 297 [2019-11-07 04:01:10,023 INFO L630 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-11-07 04:01:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-07 04:01:10,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-11-07 04:01:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-07 04:01:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2019-11-07 04:01:10,033 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2019-11-07 04:01:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:10,033 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2019-11-07 04:01:10,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2019-11-07 04:01:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 04:01:10,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:10,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:10,035 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:10,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:10,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2086090537, now seen corresponding path program 1 times [2019-11-07 04:01:10,035 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:10,036 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373617451] [2019-11-07 04:01:10,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:10,096 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373617451] [2019-11-07 04:01:10,096 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:10,096 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:10,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220873118] [2019-11-07 04:01:10,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:10,097 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:10,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:10,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:10,100 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 5 states. [2019-11-07 04:01:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:10,655 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2019-11-07 04:01:10,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:10,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-07 04:01:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:10,657 INFO L225 Difference]: With dead ends: 297 [2019-11-07 04:01:10,658 INFO L226 Difference]: Without dead ends: 295 [2019-11-07 04:01:10,658 INFO L630 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-11-07 04:01:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-07 04:01:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-11-07 04:01:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-07 04:01:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2019-11-07 04:01:10,672 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 14 [2019-11-07 04:01:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:10,673 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2019-11-07 04:01:10,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2019-11-07 04:01:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 04:01:10,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:10,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:10,677 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:10,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash -244294110, now seen corresponding path program 1 times [2019-11-07 04:01:10,678 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:10,678 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697807299] [2019-11-07 04:01:10,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:10,774 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697807299] [2019-11-07 04:01:10,774 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:10,774 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:10,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981807799] [2019-11-07 04:01:10,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:10,776 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:10,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:10,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:10,777 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand 4 states. [2019-11-07 04:01:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:11,127 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2019-11-07 04:01:11,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:11,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 04:01:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:11,129 INFO L225 Difference]: With dead ends: 295 [2019-11-07 04:01:11,129 INFO L226 Difference]: Without dead ends: 291 [2019-11-07 04:01:11,130 INFO L630 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-11-07 04:01:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-07 04:01:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-11-07 04:01:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-07 04:01:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2019-11-07 04:01:11,139 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 15 [2019-11-07 04:01:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:11,139 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2019-11-07 04:01:11,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2019-11-07 04:01:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:01:11,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:11,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:11,141 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:11,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1367121598, now seen corresponding path program 1 times [2019-11-07 04:01:11,141 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:11,142 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940126797] [2019-11-07 04:01:11,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:11,222 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940126797] [2019-11-07 04:01:11,222 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:11,222 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:11,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543408786] [2019-11-07 04:01:11,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:11,223 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:11,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:11,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:11,223 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand 5 states. [2019-11-07 04:01:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:11,848 INFO L93 Difference]: Finished difference Result 291 states and 354 transitions. [2019-11-07 04:01:11,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:11,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:01:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:11,851 INFO L225 Difference]: With dead ends: 291 [2019-11-07 04:01:11,851 INFO L226 Difference]: Without dead ends: 289 [2019-11-07 04:01:11,852 INFO L630 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-11-07 04:01:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-07 04:01:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-11-07 04:01:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-07 04:01:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2019-11-07 04:01:11,860 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 16 [2019-11-07 04:01:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:11,860 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2019-11-07 04:01:11,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:11,860 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2019-11-07 04:01:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:01:11,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:11,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:11,862 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1030085224, now seen corresponding path program 1 times [2019-11-07 04:01:11,862 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:11,863 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672133770] [2019-11-07 04:01:11,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:11,900 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672133770] [2019-11-07 04:01:11,900 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:11,900 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:11,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239579647] [2019-11-07 04:01:11,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:11,901 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:11,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:11,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:11,902 INFO L87 Difference]: Start difference. First operand 286 states and 349 transitions. Second operand 5 states. [2019-11-07 04:01:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:12,462 INFO L93 Difference]: Finished difference Result 306 states and 371 transitions. [2019-11-07 04:01:12,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:12,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:01:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:12,465 INFO L225 Difference]: With dead ends: 306 [2019-11-07 04:01:12,465 INFO L226 Difference]: Without dead ends: 304 [2019-11-07 04:01:12,467 INFO L630 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-11-07 04:01:12,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-07 04:01:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 284. [2019-11-07 04:01:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-07 04:01:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 347 transitions. [2019-11-07 04:01:12,476 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 347 transitions. Word has length 16 [2019-11-07 04:01:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:12,477 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 347 transitions. [2019-11-07 04:01:12,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 347 transitions. [2019-11-07 04:01:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:01:12,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:12,483 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:12,483 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1031624424, now seen corresponding path program 1 times [2019-11-07 04:01:12,484 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:12,485 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828506377] [2019-11-07 04:01:12,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:12,564 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828506377] [2019-11-07 04:01:12,564 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:12,564 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:12,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177411538] [2019-11-07 04:01:12,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:12,565 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:12,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:12,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:12,566 INFO L87 Difference]: Start difference. First operand 284 states and 347 transitions. Second operand 5 states. [2019-11-07 04:01:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:13,110 INFO L93 Difference]: Finished difference Result 287 states and 350 transitions. [2019-11-07 04:01:13,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:13,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:01:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:13,113 INFO L225 Difference]: With dead ends: 287 [2019-11-07 04:01:13,113 INFO L226 Difference]: Without dead ends: 285 [2019-11-07 04:01:13,114 INFO L630 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-11-07 04:01:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-07 04:01:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-11-07 04:01:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-07 04:01:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 345 transitions. [2019-11-07 04:01:13,122 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 345 transitions. Word has length 16 [2019-11-07 04:01:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:13,122 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 345 transitions. [2019-11-07 04:01:13,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 345 transitions. [2019-11-07 04:01:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:01:13,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:13,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:13,124 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1869239409, now seen corresponding path program 1 times [2019-11-07 04:01:13,124 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:13,124 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143581387] [2019-11-07 04:01:13,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:13,159 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143581387] [2019-11-07 04:01:13,159 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:13,159 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:13,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851482824] [2019-11-07 04:01:13,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:13,160 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:13,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:13,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:13,161 INFO L87 Difference]: Start difference. First operand 282 states and 345 transitions. Second operand 5 states. [2019-11-07 04:01:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:13,757 INFO L93 Difference]: Finished difference Result 305 states and 370 transitions. [2019-11-07 04:01:13,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:13,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 04:01:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:13,760 INFO L225 Difference]: With dead ends: 305 [2019-11-07 04:01:13,761 INFO L226 Difference]: Without dead ends: 303 [2019-11-07 04:01:13,761 INFO L630 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-11-07 04:01:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-07 04:01:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2019-11-07 04:01:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-07 04:01:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 343 transitions. [2019-11-07 04:01:13,771 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 343 transitions. Word has length 17 [2019-11-07 04:01:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:13,772 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 343 transitions. [2019-11-07 04:01:13,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 343 transitions. [2019-11-07 04:01:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:01:13,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:13,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:13,773 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:13,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1867873989, now seen corresponding path program 1 times [2019-11-07 04:01:13,774 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:13,774 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767055723] [2019-11-07 04:01:13,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:13,852 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767055723] [2019-11-07 04:01:13,853 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:13,853 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:13,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529649443] [2019-11-07 04:01:13,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:13,854 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:13,855 INFO L87 Difference]: Start difference. First operand 280 states and 343 transitions. Second operand 5 states. [2019-11-07 04:01:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:14,789 INFO L93 Difference]: Finished difference Result 294 states and 359 transitions. [2019-11-07 04:01:14,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:14,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 04:01:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:14,792 INFO L225 Difference]: With dead ends: 294 [2019-11-07 04:01:14,792 INFO L226 Difference]: Without dead ends: 292 [2019-11-07 04:01:14,793 INFO L630 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-11-07 04:01:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-07 04:01:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 278. [2019-11-07 04:01:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-07 04:01:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 341 transitions. [2019-11-07 04:01:14,804 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 341 transitions. Word has length 17 [2019-11-07 04:01:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:14,804 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 341 transitions. [2019-11-07 04:01:14,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 341 transitions. [2019-11-07 04:01:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:01:14,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:14,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:14,806 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:14,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:14,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1915589239, now seen corresponding path program 1 times [2019-11-07 04:01:14,807 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:14,808 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607825681] [2019-11-07 04:01:14,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:14,862 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607825681] [2019-11-07 04:01:14,862 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:14,862 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:14,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212044744] [2019-11-07 04:01:14,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:14,864 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:14,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:14,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:14,865 INFO L87 Difference]: Start difference. First operand 278 states and 341 transitions. Second operand 5 states. [2019-11-07 04:01:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:15,476 INFO L93 Difference]: Finished difference Result 278 states and 341 transitions. [2019-11-07 04:01:15,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:15,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 04:01:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:15,479 INFO L225 Difference]: With dead ends: 278 [2019-11-07 04:01:15,480 INFO L226 Difference]: Without dead ends: 274 [2019-11-07 04:01:15,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-07 04:01:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2019-11-07 04:01:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-07 04:01:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 337 transitions. [2019-11-07 04:01:15,489 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 337 transitions. Word has length 17 [2019-11-07 04:01:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:15,489 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 337 transitions. [2019-11-07 04:01:15,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 337 transitions. [2019-11-07 04:01:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 04:01:15,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:15,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:15,491 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:15,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2111849979, now seen corresponding path program 1 times [2019-11-07 04:01:15,491 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:15,491 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362756313] [2019-11-07 04:01:15,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:15,541 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362756313] [2019-11-07 04:01:15,541 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:15,541 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:15,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062910523] [2019-11-07 04:01:15,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:15,542 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:15,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:15,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:15,543 INFO L87 Difference]: Start difference. First operand 274 states and 337 transitions. Second operand 5 states. [2019-11-07 04:01:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:16,130 INFO L93 Difference]: Finished difference Result 289 states and 354 transitions. [2019-11-07 04:01:16,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:16,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 04:01:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:16,133 INFO L225 Difference]: With dead ends: 289 [2019-11-07 04:01:16,133 INFO L226 Difference]: Without dead ends: 287 [2019-11-07 04:01:16,134 INFO L630 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-11-07 04:01:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-07 04:01:16,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 272. [2019-11-07 04:01:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-07 04:01:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 335 transitions. [2019-11-07 04:01:16,145 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 335 transitions. Word has length 18 [2019-11-07 04:01:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:16,146 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 335 transitions. [2019-11-07 04:01:16,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 335 transitions. [2019-11-07 04:01:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 04:01:16,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:16,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:16,147 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:16,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:16,147 INFO L82 PathProgramCache]: Analyzing trace with hash -269329336, now seen corresponding path program 1 times [2019-11-07 04:01:16,148 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:16,148 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447409568] [2019-11-07 04:01:16,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:16,194 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447409568] [2019-11-07 04:01:16,194 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:16,194 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:01:16,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649129962] [2019-11-07 04:01:16,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:01:16,195 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:16,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:01:16,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:16,195 INFO L87 Difference]: Start difference. First operand 272 states and 335 transitions. Second operand 6 states. [2019-11-07 04:01:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:16,880 INFO L93 Difference]: Finished difference Result 287 states and 352 transitions. [2019-11-07 04:01:16,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:16,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-07 04:01:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:16,883 INFO L225 Difference]: With dead ends: 287 [2019-11-07 04:01:16,883 INFO L226 Difference]: Without dead ends: 285 [2019-11-07 04:01:16,884 INFO L630 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-11-07 04:01:16,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-07 04:01:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 270. [2019-11-07 04:01:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-07 04:01:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 333 transitions. [2019-11-07 04:01:16,892 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 333 transitions. Word has length 19 [2019-11-07 04:01:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:16,893 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 333 transitions. [2019-11-07 04:01:16,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:01:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 333 transitions. [2019-11-07 04:01:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 04:01:16,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:16,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:16,894 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:16,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:16,895 INFO L82 PathProgramCache]: Analyzing trace with hash 240728308, now seen corresponding path program 1 times [2019-11-07 04:01:16,895 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:16,895 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171509189] [2019-11-07 04:01:16,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:16,920 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171509189] [2019-11-07 04:01:16,920 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:16,920 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:16,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593989998] [2019-11-07 04:01:16,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:16,921 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:16,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:16,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:16,921 INFO L87 Difference]: Start difference. First operand 270 states and 333 transitions. Second operand 4 states. [2019-11-07 04:01:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:17,200 INFO L93 Difference]: Finished difference Result 273 states and 336 transitions. [2019-11-07 04:01:17,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:17,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-07 04:01:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:17,203 INFO L225 Difference]: With dead ends: 273 [2019-11-07 04:01:17,203 INFO L226 Difference]: Without dead ends: 253 [2019-11-07 04:01:17,203 INFO L630 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-11-07 04:01:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-07 04:01:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-11-07 04:01:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-07 04:01:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-11-07 04:01:17,210 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 20 [2019-11-07 04:01:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:17,210 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-11-07 04:01:17,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-11-07 04:01:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-07 04:01:17,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:17,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:17,225 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash 25963049, now seen corresponding path program 1 times [2019-11-07 04:01:17,225 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:17,226 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224944444] [2019-11-07 04:01:17,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:19,605 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224944444] [2019-11-07 04:01:19,605 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:19,605 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-11-07 04:01:19,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573659104] [2019-11-07 04:01:19,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-11-07 04:01:19,609 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:19,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-11-07 04:01:19,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-11-07 04:01:19,615 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 63 states. [2019-11-07 04:01:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:21,054 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-11-07 04:01:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-11-07 04:01:21,054 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 247 [2019-11-07 04:01:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:21,056 INFO L225 Difference]: With dead ends: 254 [2019-11-07 04:01:21,057 INFO L226 Difference]: Without dead ends: 252 [2019-11-07 04:01:21,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2019-11-07 04:01:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-07 04:01:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-11-07 04:01:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-07 04:01:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-11-07 04:01:21,064 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2019-11-07 04:01:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:21,065 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-11-07 04:01:21,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-11-07 04:01:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-11-07 04:01:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-07 04:01:21,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:21,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:21,069 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash 804858766, now seen corresponding path program 1 times [2019-11-07 04:01:21,070 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:21,070 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243790690] [2019-11-07 04:01:21,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:22,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-11-07 04:01:22,387 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243790690] [2019-11-07 04:01:22,388 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:22,388 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:22,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184705297] [2019-11-07 04:01:22,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:22,389 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:22,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:22,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:22,390 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 5 states. [2019-11-07 04:01:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:22,859 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2019-11-07 04:01:22,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:22,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2019-11-07 04:01:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:22,861 INFO L225 Difference]: With dead ends: 253 [2019-11-07 04:01:22,861 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 04:01:22,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 3 SyntacticMatches, 176 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 04:01:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 04:01:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 04:01:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 04:01:22,865 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2019-11-07 04:01:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:22,865 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 04:01:22,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:22,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 04:01:22,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 04:01:22,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 04:01:23,034 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:01:23,034 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:23,035 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:23,035 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 04:01:23,035 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:01:23,035 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 04:01:23,035 INFO L443 ceAbstractionStarter]: For program point L1753(lines 1753 2769) no Hoare annotation was computed. [2019-11-07 04:01:23,035 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 3003) no Hoare annotation was computed. [2019-11-07 04:01:23,035 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 2942) no Hoare annotation was computed. [2019-11-07 04:01:23,035 INFO L443 ceAbstractionStarter]: For program point L564(lines 564 2952) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L2018(lines 2018 2728) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 2901) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 2860) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L2151(lines 2151 2708) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L2085(lines 2085 2718) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L2416(lines 2416 2667) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 2992) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L1293(lines 1293 2840) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2611) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 2850) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L1558(lines 1558 2799) no Hoare annotation was computed. [2019-11-07 04:01:23,036 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 2972) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 2982) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point L1823(lines 1823 2758) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 2931) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 50) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point L965(lines 965 2890) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point L1956(lines 1956 2738) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point L1890(lines 1890 2748) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point L2221(lines 2221 2697) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 2870) no Hoare annotation was computed. [2019-11-07 04:01:23,037 INFO L443 ceAbstractionStarter]: For program point L1032(lines 1032 2880) no Hoare annotation was computed. [2019-11-07 04:01:23,038 INFO L443 ceAbstractionStarter]: For program point L2618(lines 2618 2637) no Hoare annotation was computed. [2019-11-07 04:01:23,038 INFO L443 ceAbstractionStarter]: For program point L2486(lines 2486 2656) no Hoare annotation was computed. [2019-11-07 04:01:23,038 INFO L443 ceAbstractionStarter]: For program point L1363(lines 1363 2829) no Hoare annotation was computed. [2019-11-07 04:01:23,038 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-07 04:01:23,038 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 2788) no Hoare annotation was computed. [2019-11-07 04:01:23,038 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 2961) no Hoare annotation was computed. [2019-11-07 04:01:23,038 INFO L443 ceAbstractionStarter]: For program point L2553(lines 2553 2646) no Hoare annotation was computed. [2019-11-07 04:01:23,038 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 276) no Hoare annotation was computed. [2019-11-07 04:01:23,039 INFO L443 ceAbstractionStarter]: For program point L770(lines 770 2920) no Hoare annotation was computed. [2019-11-07 04:01:23,039 INFO L443 ceAbstractionStarter]: For program point L1761(lines 1761 2768) no Hoare annotation was computed. [2019-11-07 04:01:23,039 INFO L443 ceAbstractionStarter]: For program point L1695(lines 1695 2778) no Hoare annotation was computed. [2019-11-07 04:01:23,039 INFO L439 ceAbstractionStarter]: At program point L2620(lines 20 2997) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-11-07 04:01:23,039 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-11-07 04:01:23,039 INFO L443 ceAbstractionStarter]: For program point L2026(lines 2026 2727) no Hoare annotation was computed. [2019-11-07 04:01:23,039 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 2900) no Hoare annotation was computed. [2019-11-07 04:01:23,039 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 2910) no Hoare annotation was computed. [2019-11-07 04:01:23,040 INFO L443 ceAbstractionStarter]: For program point L2291(lines 2291 2686) no Hoare annotation was computed. [2019-11-07 04:01:23,040 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 2859) no Hoare annotation was computed. [2019-11-07 04:01:23,040 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-11-07 04:01:23,040 INFO L443 ceAbstractionStarter]: For program point L1433(lines 1433 2818) no Hoare annotation was computed. [2019-11-07 04:01:23,040 INFO L443 ceAbstractionStarter]: For program point L2424(lines 2424 2666) no Hoare annotation was computed. [2019-11-07 04:01:23,040 INFO L443 ceAbstractionStarter]: For program point L2358(lines 2358 2676) no Hoare annotation was computed. [2019-11-07 04:01:23,040 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 2991) no Hoare annotation was computed. [2019-11-07 04:01:23,040 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-11-07 04:01:23,040 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-07 04:01:23,041 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 2950) no Hoare annotation was computed. [2019-11-07 04:01:23,041 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 2798) no Hoare annotation was computed. [2019-11-07 04:01:23,041 INFO L443 ceAbstractionStarter]: For program point L1500(lines 1500 2808) no Hoare annotation was computed. [2019-11-07 04:01:23,041 INFO L443 ceAbstractionStarter]: For program point L1831(lines 1831 2757) no Hoare annotation was computed. [2019-11-07 04:01:23,041 INFO L443 ceAbstractionStarter]: For program point L708(lines 708 2930) no Hoare annotation was computed. [2019-11-07 04:01:23,041 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 2940) no Hoare annotation was computed. [2019-11-07 04:01:23,041 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-07 04:01:23,041 INFO L443 ceAbstractionStarter]: For program point L2096(lines 2096 2716) no Hoare annotation was computed. [2019-11-07 04:01:23,041 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 2889) no Hoare annotation was computed. [2019-11-07 04:01:23,042 INFO L443 ceAbstractionStarter]: For program point L1238(lines 1238 2848) no Hoare annotation was computed. [2019-11-07 04:01:23,042 INFO L443 ceAbstractionStarter]: For program point L2229(lines 2229 2696) no Hoare annotation was computed. [2019-11-07 04:01:23,042 INFO L443 ceAbstractionStarter]: For program point L2163(lines 2163 2706) no Hoare annotation was computed. [2019-11-07 04:01:23,042 INFO L443 ceAbstractionStarter]: For program point L2626(lines 2626 2636) no Hoare annotation was computed. [2019-11-07 04:01:23,042 INFO L443 ceAbstractionStarter]: For program point L2494(lines 2494 2655) no Hoare annotation was computed. [2019-11-07 04:01:23,042 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 2980) no Hoare annotation was computed. [2019-11-07 04:01:23,042 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 2828) no Hoare annotation was computed. [2019-11-07 04:01:23,042 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 2838) no Hoare annotation was computed. [2019-11-07 04:01:23,042 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 270) no Hoare annotation was computed. [2019-11-07 04:01:23,043 INFO L443 ceAbstractionStarter]: For program point L1636(lines 1636 2787) no Hoare annotation was computed. [2019-11-07 04:01:23,043 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 2960) no Hoare annotation was computed. [2019-11-07 04:01:23,043 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 2970) no Hoare annotation was computed. [2019-11-07 04:01:23,043 INFO L443 ceAbstractionStarter]: For program point L1901(lines 1901 2746) no Hoare annotation was computed. [2019-11-07 04:01:23,043 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 2919) no Hoare annotation was computed. [2019-11-07 04:01:23,043 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-07 04:01:23,043 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-11-07 04:01:23,043 INFO L443 ceAbstractionStarter]: For program point L1043(lines 1043 2878) no Hoare annotation was computed. [2019-11-07 04:01:23,043 INFO L443 ceAbstractionStarter]: For program point L2034(lines 2034 2726) no Hoare annotation was computed. [2019-11-07 04:01:23,043 INFO L443 ceAbstractionStarter]: For program point L1968(lines 1968 2736) no Hoare annotation was computed. [2019-11-07 04:01:23,044 INFO L439 ceAbstractionStarter]: At program point L2629(lines 59 2996) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0)) [2019-11-07 04:01:23,044 INFO L443 ceAbstractionStarter]: For program point L2299(lines 2299 2685) no Hoare annotation was computed. [2019-11-07 04:01:23,044 INFO L443 ceAbstractionStarter]: For program point L1176(lines 1176 2858) no Hoare annotation was computed. [2019-11-07 04:01:23,044 INFO L443 ceAbstractionStarter]: For program point L1110(lines 1110 2868) no Hoare annotation was computed. [2019-11-07 04:01:23,044 INFO L443 ceAbstractionStarter]: For program point L2564(lines 2564 2644) no Hoare annotation was computed. [2019-11-07 04:01:23,044 INFO L443 ceAbstractionStarter]: For program point L1441(lines 1441 2817) no Hoare annotation was computed. [2019-11-07 04:01:23,044 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 2990) no Hoare annotation was computed. [2019-11-07 04:01:23,044 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 2776) no Hoare annotation was computed. [2019-11-07 04:01:23,045 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 2949) no Hoare annotation was computed. [2019-11-07 04:01:23,045 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 2908) no Hoare annotation was computed. [2019-11-07 04:01:23,045 INFO L443 ceAbstractionStarter]: For program point L1839(lines 1839 2756) no Hoare annotation was computed. [2019-11-07 04:01:23,045 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-11-07 04:01:23,045 INFO L443 ceAbstractionStarter]: For program point L1773(lines 1773 2766) no Hoare annotation was computed. [2019-11-07 04:01:23,045 INFO L443 ceAbstractionStarter]: For program point L2104(lines 2104 2715) no Hoare annotation was computed. [2019-11-07 04:01:23,045 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 2888) no Hoare annotation was computed. [2019-11-07 04:01:23,045 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 2898) no Hoare annotation was computed. [2019-11-07 04:01:23,045 INFO L443 ceAbstractionStarter]: For program point L2369(lines 2369 2674) no Hoare annotation was computed. [2019-11-07 04:01:23,045 INFO L443 ceAbstractionStarter]: For program point L1246(lines 1246 2847) no Hoare annotation was computed. [2019-11-07 04:01:23,046 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 2806) no Hoare annotation was computed. [2019-11-07 04:01:23,046 INFO L443 ceAbstractionStarter]: For program point L2502(lines 2502 2654) no Hoare annotation was computed. [2019-11-07 04:01:23,046 INFO L443 ceAbstractionStarter]: For program point L2436(lines 2436 2664) no Hoare annotation was computed. [2019-11-07 04:01:23,046 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 2979) no Hoare annotation was computed. [2019-11-07 04:01:23,046 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 2938) no Hoare annotation was computed. [2019-11-07 04:01:23,046 INFO L443 ceAbstractionStarter]: For program point L1644(lines 1644 2786) no Hoare annotation was computed. [2019-11-07 04:01:23,046 INFO L443 ceAbstractionStarter]: For program point L1578(lines 1578 2796) no Hoare annotation was computed. [2019-11-07 04:01:23,046 INFO L439 ceAbstractionStarter]: At program point L2635(lines 2586 2642) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 59 main_~main__t~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0))) [2019-11-07 04:01:23,047 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 2996) no Hoare annotation was computed. [2019-11-07 04:01:23,047 INFO L443 ceAbstractionStarter]: For program point L1909(lines 1909 2745) no Hoare annotation was computed. [2019-11-07 04:01:23,047 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 2918) no Hoare annotation was computed. [2019-11-07 04:01:23,047 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 2928) no Hoare annotation was computed. [2019-11-07 04:01:23,047 INFO L443 ceAbstractionStarter]: For program point L2174(lines 2174 2704) no Hoare annotation was computed. [2019-11-07 04:01:23,047 INFO L443 ceAbstractionStarter]: For program point L1051(lines 1051 2877) no Hoare annotation was computed. [2019-11-07 04:01:23,047 INFO L443 ceAbstractionStarter]: For program point L1316(lines 1316 2836) no Hoare annotation was computed. [2019-11-07 04:01:23,047 INFO L443 ceAbstractionStarter]: For program point L2307(lines 2307 2684) no Hoare annotation was computed. [2019-11-07 04:01:23,047 INFO L443 ceAbstractionStarter]: For program point L2241(lines 2241 2694) no Hoare annotation was computed. [2019-11-07 04:01:23,048 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 277) no Hoare annotation was computed. [2019-11-07 04:01:23,048 INFO L443 ceAbstractionStarter]: For program point L2572(lines 2572 2643) no Hoare annotation was computed. [2019-11-07 04:01:23,048 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 2968) no Hoare annotation was computed. [2019-11-07 04:01:23,048 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 2816) no Hoare annotation was computed. [2019-11-07 04:01:23,048 INFO L443 ceAbstractionStarter]: For program point L1383(lines 1383 2826) no Hoare annotation was computed. [2019-11-07 04:01:23,048 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 268) no Hoare annotation was computed. [2019-11-07 04:01:23,048 INFO L443 ceAbstractionStarter]: For program point L1714(lines 1714 2775) no Hoare annotation was computed. [2019-11-07 04:01:23,048 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 2948) no Hoare annotation was computed. [2019-11-07 04:01:23,048 INFO L443 ceAbstractionStarter]: For program point L525(lines 525 2958) no Hoare annotation was computed. [2019-11-07 04:01:23,049 INFO L443 ceAbstractionStarter]: For program point L1979(lines 1979 2734) no Hoare annotation was computed. [2019-11-07 04:01:23,049 INFO L443 ceAbstractionStarter]: For program point L856(lines 856 2907) no Hoare annotation was computed. [2019-11-07 04:01:23,049 INFO L443 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-11-07 04:01:23,049 INFO L443 ceAbstractionStarter]: For program point L1121(lines 1121 2866) no Hoare annotation was computed. [2019-11-07 04:01:23,049 INFO L443 ceAbstractionStarter]: For program point L2112(lines 2112 2714) no Hoare annotation was computed. [2019-11-07 04:01:23,049 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-11-07 04:01:23,049 INFO L443 ceAbstractionStarter]: For program point L2046(lines 2046 2724) no Hoare annotation was computed. [2019-11-07 04:01:23,049 INFO L443 ceAbstractionStarter]: For program point L2377(lines 2377 2673) no Hoare annotation was computed. [2019-11-07 04:01:23,050 INFO L443 ceAbstractionStarter]: For program point L1254(lines 1254 2846) no Hoare annotation was computed. [2019-11-07 04:01:23,050 INFO L443 ceAbstractionStarter]: For program point L1188(lines 1188 2856) no Hoare annotation was computed. [2019-11-07 04:01:23,050 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 235) no Hoare annotation was computed. [2019-11-07 04:01:23,050 INFO L443 ceAbstractionStarter]: For program point L1519(lines 1519 2805) no Hoare annotation was computed. [2019-11-07 04:01:23,050 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 2978) no Hoare annotation was computed. [2019-11-07 04:01:23,050 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-11-07 04:01:23,050 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 2988) no Hoare annotation was computed. [2019-11-07 04:01:23,050 INFO L443 ceAbstractionStarter]: For program point L1784(lines 1784 2764) no Hoare annotation was computed. [2019-11-07 04:01:23,050 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 2937) no Hoare annotation was computed. [2019-11-07 04:01:23,051 INFO L443 ceAbstractionStarter]: For program point L926(lines 926 2896) no Hoare annotation was computed. [2019-11-07 04:01:23,051 INFO L443 ceAbstractionStarter]: For program point L1917(lines 1917 2744) no Hoare annotation was computed. [2019-11-07 04:01:23,051 INFO L443 ceAbstractionStarter]: For program point L1851(lines 1851 2754) no Hoare annotation was computed. [2019-11-07 04:01:23,051 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 224) no Hoare annotation was computed. [2019-11-07 04:01:23,051 INFO L443 ceAbstractionStarter]: For program point L2182(lines 2182 2703) no Hoare annotation was computed. [2019-11-07 04:01:23,051 INFO L443 ceAbstractionStarter]: For program point L1059(lines 1059 2876) no Hoare annotation was computed. [2019-11-07 04:01:23,051 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 2886) no Hoare annotation was computed. [2019-11-07 04:01:23,051 INFO L443 ceAbstractionStarter]: For program point L2447(lines 2447 2662) no Hoare annotation was computed. [2019-11-07 04:01:23,051 INFO L443 ceAbstractionStarter]: For program point L1324(lines 1324 2835) no Hoare annotation was computed. [2019-11-07 04:01:23,052 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-11-07 04:01:23,052 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 281) no Hoare annotation was computed. [2019-11-07 04:01:23,052 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 2794) no Hoare annotation was computed. [2019-11-07 04:01:23,052 INFO L443 ceAbstractionStarter]: For program point L2580(lines 2580 2642) no Hoare annotation was computed. [2019-11-07 04:01:23,052 INFO L443 ceAbstractionStarter]: For program point L2514(lines 2514 2652) no Hoare annotation was computed. [2019-11-07 04:01:23,052 INFO L443 ceAbstractionStarter]: For program point L466(lines 466 2967) no Hoare annotation was computed. [2019-11-07 04:01:23,052 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-07 04:01:23,052 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 2926) no Hoare annotation was computed. [2019-11-07 04:01:23,052 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 2774) no Hoare annotation was computed. [2019-11-07 04:01:23,053 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 2784) no Hoare annotation was computed. [2019-11-07 04:01:23,053 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 3003) no Hoare annotation was computed. [2019-11-07 04:01:23,053 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-07 04:01:23,053 INFO L443 ceAbstractionStarter]: For program point L1987(lines 1987 2733) no Hoare annotation was computed. [2019-11-07 04:01:23,053 INFO L443 ceAbstractionStarter]: For program point L864(lines 864 2906) no Hoare annotation was computed. [2019-11-07 04:01:23,053 INFO L443 ceAbstractionStarter]: For program point L798(lines 798 2916) no Hoare annotation was computed. [2019-11-07 04:01:23,053 INFO L443 ceAbstractionStarter]: For program point L2252(lines 2252 2692) no Hoare annotation was computed. [2019-11-07 04:01:23,053 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 229) no Hoare annotation was computed. [2019-11-07 04:01:23,053 INFO L443 ceAbstractionStarter]: For program point L1129(lines 1129 2865) no Hoare annotation was computed. [2019-11-07 04:01:23,054 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 2824) no Hoare annotation was computed. [2019-11-07 04:01:23,054 INFO L443 ceAbstractionStarter]: For program point L2385(lines 2385 2672) no Hoare annotation was computed. [2019-11-07 04:01:23,054 INFO L443 ceAbstractionStarter]: For program point L2319(lines 2319 2682) no Hoare annotation was computed. [2019-11-07 04:01:23,054 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 2956) no Hoare annotation was computed. [2019-11-07 04:01:23,054 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 2804) no Hoare annotation was computed. [2019-11-07 04:01:23,054 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 2814) no Hoare annotation was computed. [2019-11-07 04:01:23,054 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-07 04:01:23,054 INFO L443 ceAbstractionStarter]: For program point L1792(lines 1792 2763) no Hoare annotation was computed. [2019-11-07 04:01:23,055 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-11-07 04:01:23,055 INFO L443 ceAbstractionStarter]: For program point L669(lines 669 2936) no Hoare annotation was computed. [2019-11-07 04:01:23,055 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 2946) no Hoare annotation was computed. [2019-11-07 04:01:23,055 INFO L443 ceAbstractionStarter]: For program point L2057(lines 2057 2722) no Hoare annotation was computed. [2019-11-07 04:01:23,055 INFO L443 ceAbstractionStarter]: For program point L934(lines 934 2895) no Hoare annotation was computed. [2019-11-07 04:01:23,055 INFO L443 ceAbstractionStarter]: For program point L1199(lines 1199 2854) no Hoare annotation was computed. [2019-11-07 04:01:23,055 INFO L443 ceAbstractionStarter]: For program point L2190(lines 2190 2702) no Hoare annotation was computed. [2019-11-07 04:01:23,055 INFO L443 ceAbstractionStarter]: For program point L2124(lines 2124 2712) no Hoare annotation was computed. [2019-11-07 04:01:23,055 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2599) no Hoare annotation was computed. [2019-11-07 04:01:23,056 INFO L443 ceAbstractionStarter]: For program point L2455(lines 2455 2661) no Hoare annotation was computed. [2019-11-07 04:01:23,056 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 2986) no Hoare annotation was computed. [2019-11-07 04:01:23,056 INFO L443 ceAbstractionStarter]: For program point L1332(lines 1332 2834) no Hoare annotation was computed. [2019-11-07 04:01:23,056 INFO L439 ceAbstractionStarter]: At program point L275(lines 127 277) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~3 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2019-11-07 04:01:23,056 INFO L443 ceAbstractionStarter]: For program point L1266(lines 1266 2844) no Hoare annotation was computed. [2019-11-07 04:01:23,056 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 2793) no Hoare annotation was computed. [2019-11-07 04:01:23,056 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 2966) no Hoare annotation was computed. [2019-11-07 04:01:23,056 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 2976) no Hoare annotation was computed. [2019-11-07 04:01:23,057 INFO L443 ceAbstractionStarter]: For program point L1862(lines 1862 2752) no Hoare annotation was computed. [2019-11-07 04:01:23,057 INFO L443 ceAbstractionStarter]: For program point L739(lines 739 2925) no Hoare annotation was computed. [2019-11-07 04:01:23,057 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 2884) no Hoare annotation was computed. [2019-11-07 04:01:23,057 INFO L443 ceAbstractionStarter]: For program point L1995(lines 1995 2732) no Hoare annotation was computed. [2019-11-07 04:01:23,057 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-07 04:01:23,057 INFO L443 ceAbstractionStarter]: For program point L1929(lines 1929 2742) no Hoare annotation was computed. [2019-11-07 04:01:23,057 INFO L443 ceAbstractionStarter]: For program point L2260(lines 2260 2691) no Hoare annotation was computed. [2019-11-07 04:01:23,057 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 222) no Hoare annotation was computed. [2019-11-07 04:01:23,057 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 2864) no Hoare annotation was computed. [2019-11-07 04:01:23,058 INFO L443 ceAbstractionStarter]: For program point L1071(lines 1071 2874) no Hoare annotation was computed. [2019-11-07 04:01:23,058 INFO L443 ceAbstractionStarter]: For program point L2525(lines 2525 2650) no Hoare annotation was computed. [2019-11-07 04:01:23,058 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 2823) no Hoare annotation was computed. [2019-11-07 04:01:23,058 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 279) no Hoare annotation was computed. [2019-11-07 04:01:23,058 INFO L443 ceAbstractionStarter]: For program point L1667(lines 1667 2782) no Hoare annotation was computed. [2019-11-07 04:01:23,058 INFO L443 ceAbstractionStarter]: For program point L544(lines 544 2955) no Hoare annotation was computed. [2019-11-07 04:01:23,058 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-11-07 04:01:23,058 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 3002) no Hoare annotation was computed. [2019-11-07 04:01:23,058 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 2914) no Hoare annotation was computed. [2019-11-07 04:01:23,058 INFO L443 ceAbstractionStarter]: For program point L1800(lines 1800 2762) no Hoare annotation was computed. [2019-11-07 04:01:23,059 INFO L443 ceAbstractionStarter]: For program point L1734(lines 1734 2772) no Hoare annotation was computed. [2019-11-07 04:01:23,059 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-07 04:01:23,059 INFO L443 ceAbstractionStarter]: For program point L2065(lines 2065 2721) no Hoare annotation was computed. [2019-11-07 04:01:23,059 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 2894) no Hoare annotation was computed. [2019-11-07 04:01:23,059 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 2904) no Hoare annotation was computed. [2019-11-07 04:01:23,059 INFO L443 ceAbstractionStarter]: For program point L2330(lines 2330 2680) no Hoare annotation was computed. [2019-11-07 04:01:23,059 INFO L443 ceAbstractionStarter]: For program point L1207(lines 1207 2853) no Hoare annotation was computed. [2019-11-07 04:01:23,059 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 227) no Hoare annotation was computed. [2019-11-07 04:01:23,059 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 2812) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L2463(lines 2463 2660) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 2985) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L2397(lines 2397 2670) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 2944) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L1605(lines 1605 2792) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L1539(lines 1539 2802) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 2997) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L1870(lines 1870 2751) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 2924) no Hoare annotation was computed. [2019-11-07 04:01:23,060 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 2934) no Hoare annotation was computed. [2019-11-07 04:01:23,061 INFO L443 ceAbstractionStarter]: For program point L2597(lines 2597 2640) no Hoare annotation was computed. [2019-11-07 04:01:23,061 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2019-11-07 04:01:23,061 INFO L443 ceAbstractionStarter]: For program point L2135(lines 2135 2710) no Hoare annotation was computed. [2019-11-07 04:01:23,061 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 2883) no Hoare annotation was computed. [2019-11-07 04:01:23,061 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 2842) no Hoare annotation was computed. [2019-11-07 04:01:23,061 INFO L443 ceAbstractionStarter]: For program point L2268(lines 2268 2690) no Hoare annotation was computed. [2019-11-07 04:01:23,061 INFO L443 ceAbstractionStarter]: For program point L2202(lines 2202 2700) no Hoare annotation was computed. [2019-11-07 04:01:23,061 INFO L443 ceAbstractionStarter]: For program point L2599(line 2599) no Hoare annotation was computed. [2019-11-07 04:01:23,061 INFO L443 ceAbstractionStarter]: For program point L2533(lines 2533 2649) no Hoare annotation was computed. [2019-11-07 04:01:23,061 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 2974) no Hoare annotation was computed. [2019-11-07 04:01:23,062 INFO L443 ceAbstractionStarter]: For program point L1410(lines 1410 2822) no Hoare annotation was computed. [2019-11-07 04:01:23,062 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 2832) no Hoare annotation was computed. [2019-11-07 04:01:23,062 INFO L439 ceAbstractionStarter]: At program point L221(lines 87 279) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~3 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= 1 main_~main__t~0)) [2019-11-07 04:01:23,062 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-11-07 04:01:23,062 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 2781) no Hoare annotation was computed. [2019-11-07 04:01:23,062 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 2954) no Hoare annotation was computed. [2019-11-07 04:01:23,062 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 2964) no Hoare annotation was computed. [2019-11-07 04:01:23,063 INFO L443 ceAbstractionStarter]: For program point L1940(lines 1940 2740) no Hoare annotation was computed. [2019-11-07 04:01:23,063 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 2913) no Hoare annotation was computed. [2019-11-07 04:01:23,063 INFO L443 ceAbstractionStarter]: For program point L1082(lines 1082 2872) no Hoare annotation was computed. [2019-11-07 04:01:23,063 INFO L443 ceAbstractionStarter]: For program point L2073(lines 2073 2720) no Hoare annotation was computed. [2019-11-07 04:01:23,063 INFO L443 ceAbstractionStarter]: For program point L2007(lines 2007 2730) no Hoare annotation was computed. [2019-11-07 04:01:23,063 INFO L443 ceAbstractionStarter]: For program point L2338(lines 2338 2679) no Hoare annotation was computed. [2019-11-07 04:01:23,063 INFO L443 ceAbstractionStarter]: For program point L1215(lines 1215 2852) no Hoare annotation was computed. [2019-11-07 04:01:23,063 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 2862) no Hoare annotation was computed. [2019-11-07 04:01:23,063 INFO L443 ceAbstractionStarter]: For program point L1480(lines 1480 2811) no Hoare annotation was computed. [2019-11-07 04:01:23,063 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 2984) no Hoare annotation was computed. [2019-11-07 04:01:23,064 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 2994) no Hoare annotation was computed. [2019-11-07 04:01:23,064 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 226) no Hoare annotation was computed. [2019-11-07 04:01:23,064 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 262) no Hoare annotation was computed. [2019-11-07 04:01:23,064 INFO L443 ceAbstractionStarter]: For program point L1745(lines 1745 2770) no Hoare annotation was computed. [2019-11-07 04:01:23,064 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 2943) no Hoare annotation was computed. [2019-11-07 04:01:23,064 INFO L443 ceAbstractionStarter]: For program point L28(lines 28 52) no Hoare annotation was computed. [2019-11-07 04:01:23,064 INFO L446 ceAbstractionStarter]: At program point L3001(lines 16 3002) the Hoare annotation is: true [2019-11-07 04:01:23,064 INFO L443 ceAbstractionStarter]: For program point L887(lines 887 2902) no Hoare annotation was computed. [2019-11-07 04:01:23,065 INFO L443 ceAbstractionStarter]: For program point L1878(lines 1878 2750) no Hoare annotation was computed. [2019-11-07 04:01:23,065 INFO L443 ceAbstractionStarter]: For program point L1812(lines 1812 2760) no Hoare annotation was computed. [2019-11-07 04:01:23,065 INFO L443 ceAbstractionStarter]: For program point L2143(lines 2143 2709) no Hoare annotation was computed. [2019-11-07 04:01:23,065 INFO L443 ceAbstractionStarter]: For program point L1020(lines 1020 2882) no Hoare annotation was computed. [2019-11-07 04:01:23,065 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 2892) no Hoare annotation was computed. [2019-11-07 04:01:23,065 INFO L443 ceAbstractionStarter]: For program point L2408(lines 2408 2668) no Hoare annotation was computed. [2019-11-07 04:01:23,065 INFO L443 ceAbstractionStarter]: For program point L1285(lines 1285 2841) no Hoare annotation was computed. [2019-11-07 04:01:23,065 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-11-07 04:01:23,066 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-07 04:01:23,066 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 3003) the Hoare annotation is: true [2019-11-07 04:01:23,066 INFO L443 ceAbstractionStarter]: For program point L1550(lines 1550 2800) no Hoare annotation was computed. [2019-11-07 04:01:23,066 INFO L443 ceAbstractionStarter]: For program point L2541(lines 2541 2648) no Hoare annotation was computed. [2019-11-07 04:01:23,066 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 2973) no Hoare annotation was computed. [2019-11-07 04:01:23,066 INFO L443 ceAbstractionStarter]: For program point L2475(lines 2475 2658) no Hoare annotation was computed. [2019-11-07 04:01:23,066 INFO L443 ceAbstractionStarter]: For program point L692(lines 692 2932) no Hoare annotation was computed. [2019-11-07 04:01:23,066 INFO L443 ceAbstractionStarter]: For program point L1683(lines 1683 2780) no Hoare annotation was computed. [2019-11-07 04:01:23,066 INFO L443 ceAbstractionStarter]: For program point L1617(lines 1617 2790) no Hoare annotation was computed. [2019-11-07 04:01:23,066 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-11-07 04:01:23,066 INFO L443 ceAbstractionStarter]: For program point L1948(lines 1948 2739) no Hoare annotation was computed. [2019-11-07 04:01:23,067 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 2912) no Hoare annotation was computed. [2019-11-07 04:01:23,067 INFO L443 ceAbstractionStarter]: For program point L759(lines 759 2922) no Hoare annotation was computed. [2019-11-07 04:01:23,067 INFO L443 ceAbstractionStarter]: For program point L2609(lines 2609 2638) no Hoare annotation was computed. [2019-11-07 04:01:23,067 INFO L443 ceAbstractionStarter]: For program point L2213(lines 2213 2698) no Hoare annotation was computed. [2019-11-07 04:01:23,067 INFO L443 ceAbstractionStarter]: For program point L1090(lines 1090 2871) no Hoare annotation was computed. [2019-11-07 04:01:23,067 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-11-07 04:01:23,067 INFO L443 ceAbstractionStarter]: For program point L1355(lines 1355 2830) no Hoare annotation was computed. [2019-11-07 04:01:23,067 INFO L443 ceAbstractionStarter]: For program point L2346(lines 2346 2678) no Hoare annotation was computed. [2019-11-07 04:01:23,067 INFO L443 ceAbstractionStarter]: For program point L2280(lines 2280 2688) no Hoare annotation was computed. [2019-11-07 04:01:23,067 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-11-07 04:01:23,068 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-07 04:01:23,068 INFO L443 ceAbstractionStarter]: For program point L2611(line 2611) no Hoare annotation was computed. [2019-11-07 04:01:23,068 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 2962) no Hoare annotation was computed. [2019-11-07 04:01:23,068 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 2810) no Hoare annotation was computed. [2019-11-07 04:01:23,068 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 2820) no Hoare annotation was computed. [2019-11-07 04:01:23,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:01:23 BoogieIcfgContainer [2019-11-07 04:01:23,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 04:01:23,089 INFO L168 Benchmark]: Toolchain (without parser) took 18643.95 ms. Allocated memory was 145.8 MB in the beginning and 440.4 MB in the end (delta: 294.6 MB). Free memory was 102.7 MB in the beginning and 171.0 MB in the end (delta: -68.3 MB). Peak memory consumption was 226.3 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:23,089 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-07 04:01:23,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 924.07 ms. Allocated memory was 145.8 MB in the beginning and 206.6 MB in the end (delta: 60.8 MB). Free memory was 102.3 MB in the beginning and 170.8 MB in the end (delta: -68.5 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:23,091 INFO L168 Benchmark]: Boogie Preprocessor took 104.44 ms. Allocated memory is still 206.6 MB. Free memory was 170.8 MB in the beginning and 165.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:23,092 INFO L168 Benchmark]: RCFGBuilder took 1733.19 ms. Allocated memory was 206.6 MB in the beginning and 240.1 MB in the end (delta: 33.6 MB). Free memory was 165.8 MB in the beginning and 114.9 MB in the end (delta: 50.9 MB). Peak memory consumption was 84.4 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:23,092 INFO L168 Benchmark]: TraceAbstraction took 15877.92 ms. Allocated memory was 240.1 MB in the beginning and 440.4 MB in the end (delta: 200.3 MB). Free memory was 114.9 MB in the beginning and 171.0 MB in the end (delta: -56.2 MB). Peak memory consumption was 144.1 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:23,098 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.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 924.07 ms. Allocated memory was 145.8 MB in the beginning and 206.6 MB in the end (delta: 60.8 MB). Free memory was 102.3 MB in the beginning and 170.8 MB in the end (delta: -68.5 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 104.44 ms. Allocated memory is still 206.6 MB. Free memory was 170.8 MB in the beginning and 165.8 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1733.19 ms. Allocated memory was 206.6 MB in the beginning and 240.1 MB in the end (delta: 33.6 MB). Free memory was 165.8 MB in the beginning and 114.9 MB in the end (delta: 50.9 MB). Peak memory consumption was 84.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15877.92 ms. Allocated memory was 240.1 MB in the beginning and 440.4 MB in the end (delta: 200.3 MB). Free memory was 114.9 MB in the beginning and 171.0 MB in the end (delta: -56.2 MB). Peak memory consumption was 144.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 262]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2611]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == main__t)) && 1 <= main__t - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && 59 <= main__t) && !(main__tagbuf_len == main__t) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 308 locations, 16 error locations. Result: SAFE, OverallTime: 15.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 2606 SDtfs, 11666 SDslu, 2886 SDs, 0 SdLazy, 8447 SolverSat, 3227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 40 SyntacticMatches, 181 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 101 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 68 HoareAnnotationTreeSize, 10 FomulaSimplifications, 4123 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 308 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 724 NumberOfCodeBlocks, 724 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 585940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...