/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:34:07,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:34:07,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:34:07,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:34:07,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:34:07,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:34:07,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:34:07,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:34:07,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:34:07,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:34:07,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:34:07,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:34:07,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:34:07,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:34:07,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:34:07,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:34:07,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:34:07,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:34:07,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:34:07,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:34:07,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:34:07,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:34:07,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:34:07,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:34:07,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:34:07,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:34:07,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:34:07,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:34:07,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:34:07,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:34:07,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:34:07,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:34:07,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:34:07,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:34:07,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:34:07,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:34:07,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:34:07,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:34:07,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:34:07,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:34:07,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:34:07,450 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 00:34:07,468 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:34:07,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:34:07,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:34:07,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:34:07,471 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:34:07,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:34:07,471 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:34:07,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:34:07,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:34:07,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:34:07,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:34:07,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:34:07,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:34:07,474 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:34:07,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:34:07,474 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:34:07,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:34:07,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:34:07,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:34:07,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:34:07,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:34:07,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:34:07,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:34:07,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:34:07,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:34:07,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:34:07,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:34:07,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:34:07,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:34:07,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:34:07,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:34:07,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:34:07,773 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:34:07,773 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:34:07,774 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-07 00:34:07,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e85ca5bd/4a3065c76b03445684f9baf92874fe7e/FLAGa0567302f [2019-11-07 00:34:08,279 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:34:08,283 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-07 00:34:08,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e85ca5bd/4a3065c76b03445684f9baf92874fe7e/FLAGa0567302f [2019-11-07 00:34:08,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e85ca5bd/4a3065c76b03445684f9baf92874fe7e [2019-11-07 00:34:08,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:34:08,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:34:08,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:08,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:34:08,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:34:08,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:08" (1/1) ... [2019-11-07 00:34:08,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd62c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:08, skipping insertion in model container [2019-11-07 00:34:08,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:08" (1/1) ... [2019-11-07 00:34:08,619 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:34:08,646 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:34:08,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:08,992 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:34:09,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:09,181 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:34:09,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09 WrapperNode [2019-11-07 00:34:09,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:09,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:34:09,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:34:09,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:34:09,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:34:09,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:34:09,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:34:09,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:34:09,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (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 00:34:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:34:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:34:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:34:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:34:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:34:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:34:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:34:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:34:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:34:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:34:09,750 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:34:09,750 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 00:34:09,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:09 BoogieIcfgContainer [2019-11-07 00:34:09,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:34:09,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:34:09,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:34:09,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:34:09,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:34:08" (1/3) ... [2019-11-07 00:34:09,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b0c86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:09, skipping insertion in model container [2019-11-07 00:34:09,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (2/3) ... [2019-11-07 00:34:09,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b0c86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:09, skipping insertion in model container [2019-11-07 00:34:09,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:09" (3/3) ... [2019-11-07 00:34:09,760 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-11-07 00:34:09,770 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:34:09,778 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-07 00:34:09,790 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-07 00:34:09,816 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:34:09,816 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:34:09,816 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:34:09,817 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:34:09,817 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:34:09,817 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:34:09,817 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:34:09,817 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:34:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-07 00:34:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 00:34:09,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:09,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:09,849 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:09,856 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-11-07 00:34:09,868 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:09,868 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628340093] [2019-11-07 00:34:09,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:10,050 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 00:34:10,050 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628340093] [2019-11-07 00:34:10,051 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:10,052 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:10,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034950997] [2019-11-07 00:34:10,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:10,059 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:10,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:10,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:10,078 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2019-11-07 00:34:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:10,249 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2019-11-07 00:34:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:10,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 00:34:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:10,263 INFO L225 Difference]: With dead ends: 131 [2019-11-07 00:34:10,263 INFO L226 Difference]: Without dead ends: 111 [2019-11-07 00:34:10,267 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 00:34:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-07 00:34:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-11-07 00:34:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-07 00:34:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-11-07 00:34:10,316 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-11-07 00:34:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:10,317 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-11-07 00:34:10,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-11-07 00:34:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 00:34:10,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:10,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:10,319 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:10,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,320 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-11-07 00:34:10,320 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:10,320 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981785640] [2019-11-07 00:34:10,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:10,392 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 00:34:10,392 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981785640] [2019-11-07 00:34:10,393 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:10,393 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:10,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660309584] [2019-11-07 00:34:10,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:10,395 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:10,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:10,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:10,396 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-11-07 00:34:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:10,505 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-07 00:34:10,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:10,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 00:34:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:10,508 INFO L225 Difference]: With dead ends: 111 [2019-11-07 00:34:10,509 INFO L226 Difference]: Without dead ends: 109 [2019-11-07 00:34:10,510 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 00:34:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-07 00:34:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-11-07 00:34:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-07 00:34:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-11-07 00:34:10,520 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-11-07 00:34:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:10,520 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-11-07 00:34:10,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-11-07 00:34:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:34:10,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:10,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:10,523 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,524 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-11-07 00:34:10,524 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:10,524 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104116252] [2019-11-07 00:34:10,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:10,598 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 00:34:10,598 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104116252] [2019-11-07 00:34:10,598 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:10,604 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:10,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065515742] [2019-11-07 00:34:10,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:10,605 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:10,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:10,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:10,606 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2019-11-07 00:34:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:10,737 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-07 00:34:10,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:10,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-07 00:34:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:10,738 INFO L225 Difference]: With dead ends: 73 [2019-11-07 00:34:10,739 INFO L226 Difference]: Without dead ends: 71 [2019-11-07 00:34:10,751 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 00:34:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-07 00:34:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-11-07 00:34:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-07 00:34:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-07 00:34:10,760 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-11-07 00:34:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:10,760 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-07 00:34:10,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-07 00:34:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:34:10,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:10,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:10,762 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-11-07 00:34:10,763 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:10,763 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003078802] [2019-11-07 00:34:10,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:10,862 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 00:34:10,863 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003078802] [2019-11-07 00:34:10,863 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:10,864 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:10,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876867076] [2019-11-07 00:34:10,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:10,864 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:10,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:10,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:10,865 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-11-07 00:34:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:10,958 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-07 00:34:10,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:10,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-07 00:34:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:10,960 INFO L225 Difference]: With dead ends: 71 [2019-11-07 00:34:10,960 INFO L226 Difference]: Without dead ends: 69 [2019-11-07 00:34:10,961 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 00:34:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-07 00:34:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-11-07 00:34:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-07 00:34:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-07 00:34:10,968 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-11-07 00:34:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:10,969 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-07 00:34:10,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-07 00:34:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:10,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:10,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:10,974 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-11-07 00:34:10,975 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:10,975 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576264921] [2019-11-07 00:34:10,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,045 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 00:34:11,046 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576264921] [2019-11-07 00:34:11,047 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,047 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:11,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704558579] [2019-11-07 00:34:11,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:11,048 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:11,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:11,049 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-11-07 00:34:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,192 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-11-07 00:34:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:11,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 00:34:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,194 INFO L225 Difference]: With dead ends: 116 [2019-11-07 00:34:11,194 INFO L226 Difference]: Without dead ends: 114 [2019-11-07 00:34:11,195 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 00:34:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-07 00:34:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-11-07 00:34:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-07 00:34:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-07 00:34:11,211 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-11-07 00:34:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,216 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-07 00:34:11,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-07 00:34:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:11,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:11,218 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-11-07 00:34:11,219 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,219 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974614328] [2019-11-07 00:34:11,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,272 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 00:34:11,272 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974614328] [2019-11-07 00:34:11,273 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,273 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:11,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517323522] [2019-11-07 00:34:11,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:11,275 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:11,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:11,276 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-11-07 00:34:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,408 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-11-07 00:34:11,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:11,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 00:34:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,411 INFO L225 Difference]: With dead ends: 101 [2019-11-07 00:34:11,411 INFO L226 Difference]: Without dead ends: 99 [2019-11-07 00:34:11,411 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 00:34:11,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-07 00:34:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-11-07 00:34:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-07 00:34:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-07 00:34:11,427 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-11-07 00:34:11,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,427 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-07 00:34:11,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-07 00:34:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:11,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:11,432 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-11-07 00:34:11,433 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,434 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802163504] [2019-11-07 00:34:11,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,485 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 00:34:11,485 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802163504] [2019-11-07 00:34:11,486 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,486 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:11,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096713520] [2019-11-07 00:34:11,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:11,489 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:11,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:11,490 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-11-07 00:34:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,550 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-07 00:34:11,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:11,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-07 00:34:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,551 INFO L225 Difference]: With dead ends: 65 [2019-11-07 00:34:11,551 INFO L226 Difference]: Without dead ends: 61 [2019-11-07 00:34:11,552 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 00:34:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-07 00:34:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-11-07 00:34:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-07 00:34:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-07 00:34:11,558 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-11-07 00:34:11,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,558 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-07 00:34:11,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-07 00:34:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:11,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:11,560 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-11-07 00:34:11,561 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,561 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565919045] [2019-11-07 00:34:11,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,600 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 00:34:11,600 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565919045] [2019-11-07 00:34:11,601 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,601 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:11,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66906194] [2019-11-07 00:34:11,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:11,602 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:11,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:11,603 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-11-07 00:34:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,656 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-07 00:34:11,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:11,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-07 00:34:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,658 INFO L225 Difference]: With dead ends: 61 [2019-11-07 00:34:11,658 INFO L226 Difference]: Without dead ends: 57 [2019-11-07 00:34:11,658 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 00:34:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-07 00:34:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-07 00:34:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-07 00:34:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-11-07 00:34:11,665 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-11-07 00:34:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,665 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-11-07 00:34:11,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-11-07 00:34:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:11,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,666 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 00:34:11,667 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-11-07 00:34:11,667 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,668 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235129576] [2019-11-07 00:34:11,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,742 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 00:34:11,743 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235129576] [2019-11-07 00:34:11,743 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,744 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:11,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491507757] [2019-11-07 00:34:11,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:11,746 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:11,747 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-11-07 00:34:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,877 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-11-07 00:34:11,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:11,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 00:34:11,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,879 INFO L225 Difference]: With dead ends: 94 [2019-11-07 00:34:11,879 INFO L226 Difference]: Without dead ends: 92 [2019-11-07 00:34:11,880 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 00:34:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-07 00:34:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-11-07 00:34:11,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-07 00:34:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-07 00:34:11,891 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2019-11-07 00:34:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,894 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-07 00:34:11,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-07 00:34:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:11,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,895 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 00:34:11,898 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2019-11-07 00:34:11,898 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,899 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2192325] [2019-11-07 00:34:11,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,008 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 00:34:12,009 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2192325] [2019-11-07 00:34:12,009 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,009 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529580376] [2019-11-07 00:34:12,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,010 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,011 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-11-07 00:34:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,131 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-11-07 00:34:12,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:12,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 00:34:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,133 INFO L225 Difference]: With dead ends: 84 [2019-11-07 00:34:12,133 INFO L226 Difference]: Without dead ends: 82 [2019-11-07 00:34:12,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 00:34:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-07 00:34:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-11-07 00:34:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-07 00:34:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-07 00:34:12,142 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2019-11-07 00:34:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,149 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-07 00:34:12,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-07 00:34:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:12,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,150 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 00:34:12,150 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,151 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2019-11-07 00:34:12,151 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,151 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069693852] [2019-11-07 00:34:12,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,215 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 00:34:12,215 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069693852] [2019-11-07 00:34:12,215 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,216 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079001484] [2019-11-07 00:34:12,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,216 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,218 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-11-07 00:34:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,285 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-07 00:34:12,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:12,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 00:34:12,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,286 INFO L225 Difference]: With dead ends: 70 [2019-11-07 00:34:12,286 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 00:34:12,287 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 00:34:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 00:34:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2019-11-07 00:34:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-07 00:34:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-07 00:34:12,299 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2019-11-07 00:34:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,299 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-07 00:34:12,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-07 00:34:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:12,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,300 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 00:34:12,301 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,301 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2019-11-07 00:34:12,302 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,302 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601531756] [2019-11-07 00:34:12,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,353 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 00:34:12,353 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601531756] [2019-11-07 00:34:12,354 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,354 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372650180] [2019-11-07 00:34:12,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,355 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,355 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-11-07 00:34:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,425 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-11-07 00:34:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:12,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 00:34:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,426 INFO L225 Difference]: With dead ends: 51 [2019-11-07 00:34:12,426 INFO L226 Difference]: Without dead ends: 49 [2019-11-07 00:34:12,427 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 00:34:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-07 00:34:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-11-07 00:34:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-07 00:34:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-07 00:34:12,431 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2019-11-07 00:34:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,432 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-07 00:34:12,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-07 00:34:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:34:12,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,433 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 00:34:12,433 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2019-11-07 00:34:12,434 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,434 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048780206] [2019-11-07 00:34:12,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,469 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 00:34:12,469 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048780206] [2019-11-07 00:34:12,469 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,469 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871170072] [2019-11-07 00:34:12,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,470 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,471 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-11-07 00:34:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,545 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-07 00:34:12,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:12,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 00:34:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,546 INFO L225 Difference]: With dead ends: 69 [2019-11-07 00:34:12,546 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 00:34:12,546 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 00:34:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 00:34:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-11-07 00:34:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-07 00:34:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-07 00:34:12,550 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-11-07 00:34:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,551 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-07 00:34:12,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-07 00:34:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:34:12,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,552 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 00:34:12,552 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2019-11-07 00:34:12,553 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,553 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245724906] [2019-11-07 00:34:12,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,628 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 00:34:12,628 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245724906] [2019-11-07 00:34:12,630 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,631 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021714602] [2019-11-07 00:34:12,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,631 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,632 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-11-07 00:34:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,715 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-11-07 00:34:12,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:12,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 00:34:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,716 INFO L225 Difference]: With dead ends: 59 [2019-11-07 00:34:12,717 INFO L226 Difference]: Without dead ends: 57 [2019-11-07 00:34:12,717 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 00:34:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-07 00:34:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-11-07 00:34:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-07 00:34:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-07 00:34:12,730 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-11-07 00:34:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,730 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-07 00:34:12,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-07 00:34:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:34:12,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,731 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 00:34:12,732 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2019-11-07 00:34:12,733 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,736 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660635024] [2019-11-07 00:34:12,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,808 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 00:34:12,808 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660635024] [2019-11-07 00:34:12,809 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,809 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438731458] [2019-11-07 00:34:12,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,810 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,810 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-11-07 00:34:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,869 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-11-07 00:34:12,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:12,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 00:34:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,870 INFO L225 Difference]: With dead ends: 43 [2019-11-07 00:34:12,870 INFO L226 Difference]: Without dead ends: 39 [2019-11-07 00:34:12,871 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 00:34:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-07 00:34:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-07 00:34:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 00:34:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-07 00:34:12,876 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-11-07 00:34:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,876 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-07 00:34:12,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-07 00:34:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:34:12,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,877 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 00:34:12,878 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2019-11-07 00:34:12,878 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,878 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839468239] [2019-11-07 00:34:12,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,924 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 00:34:12,924 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839468239] [2019-11-07 00:34:12,924 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,925 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443406702] [2019-11-07 00:34:12,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,925 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,926 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-11-07 00:34:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:13,015 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-07 00:34:13,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:13,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-07 00:34:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:13,016 INFO L225 Difference]: With dead ends: 54 [2019-11-07 00:34:13,017 INFO L226 Difference]: Without dead ends: 52 [2019-11-07 00:34:13,017 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 00:34:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-07 00:34:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-11-07 00:34:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-07 00:34:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-07 00:34:13,022 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-11-07 00:34:13,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:13,022 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-07 00:34:13,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-07 00:34:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:34:13,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:13,024 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 00:34:13,024 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:13,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:13,025 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2019-11-07 00:34:13,025 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:13,025 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634505397] [2019-11-07 00:34:13,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:13,068 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 00:34:13,069 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634505397] [2019-11-07 00:34:13,069 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:13,069 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:34:13,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425028690] [2019-11-07 00:34:13,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:34:13,070 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:13,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:34:13,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:13,071 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-11-07 00:34:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:13,162 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-11-07 00:34:13,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:13,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-07 00:34:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:13,166 INFO L225 Difference]: With dead ends: 56 [2019-11-07 00:34:13,167 INFO L226 Difference]: Without dead ends: 54 [2019-11-07 00:34:13,167 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 00:34:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-07 00:34:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2019-11-07 00:34:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 00:34:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-07 00:34:13,172 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-11-07 00:34:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:13,172 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-07 00:34:13,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:34:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-07 00:34:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:34:13,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:13,173 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] [2019-11-07 00:34:13,174 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2019-11-07 00:34:13,175 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:13,175 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108592247] [2019-11-07 00:34:13,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:13,204 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 00:34:13,205 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108592247] [2019-11-07 00:34:13,205 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:13,205 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:13,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122929531] [2019-11-07 00:34:13,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:13,206 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:13,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:13,206 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-11-07 00:34:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:13,244 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-07 00:34:13,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:13,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-07 00:34:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:13,245 INFO L225 Difference]: With dead ends: 37 [2019-11-07 00:34:13,245 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:34:13,245 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 00:34:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:34:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:34:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:34:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:34:13,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-07 00:34:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:13,247 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:34:13,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:34:13,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:34:13,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:34:13,509 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:13,509 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:13,509 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:13,510 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:13,510 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:34:13,510 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:13,510 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:13,510 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-11-07 00:34:13,510 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-11-07 00:34:13,510 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-11-07 00:34:13,511 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-11-07 00:34:13,511 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2019-11-07 00:34:13,511 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-11-07 00:34:13,511 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-11-07 00:34:13,511 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-11-07 00:34:13,511 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-11-07 00:34:13,511 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-11-07 00:34:13,511 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-11-07 00:34:13,512 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-11-07 00:34:13,512 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-11-07 00:34:13,512 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-11-07 00:34:13,512 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-11-07 00:34:13,512 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-11-07 00:34:13,512 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-11-07 00:34:13,512 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-11-07 00:34:13,512 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-11-07 00:34:13,513 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-11-07 00:34:13,513 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-11-07 00:34:13,513 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-11-07 00:34:13,513 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-11-07 00:34:13,513 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-11-07 00:34:13,513 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-11-07 00:34:13,514 INFO L439 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2019-11-07 00:34:13,514 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-07 00:34:13,514 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-11-07 00:34:13,514 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2019-11-07 00:34:13,514 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-07 00:34:13,514 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-11-07 00:34:13,514 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-11-07 00:34:13,514 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-11-07 00:34:13,515 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2019-11-07 00:34:13,515 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-07 00:34:13,515 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-11-07 00:34:13,515 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-07 00:34:13,515 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-07 00:34:13,515 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-11-07 00:34:13,515 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-11-07 00:34:13,515 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-11-07 00:34:13,516 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-11-07 00:34:13,516 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-11-07 00:34:13,516 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-11-07 00:34:13,516 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-11-07 00:34:13,516 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-11-07 00:34:13,516 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-11-07 00:34:13,516 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-11-07 00:34:13,516 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-11-07 00:34:13,517 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-11-07 00:34:13,517 INFO L439 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-11-07 00:34:13,517 INFO L439 ceAbstractionStarter]: At program point L346(lines 27 390) 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 00:34:13,517 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-11-07 00:34:13,517 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-11-07 00:34:13,517 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-07 00:34:13,517 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-11-07 00:34:13,518 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-11-07 00:34:13,518 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-11-07 00:34:13,518 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-11-07 00:34:13,518 INFO L439 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-11-07 00:34:13,518 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-07 00:34:13,518 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-11-07 00:34:13,518 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-11-07 00:34:13,519 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-11-07 00:34:13,519 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-07 00:34:13,519 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-11-07 00:34:13,519 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-11-07 00:34:13,519 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-11-07 00:34:13,519 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-07 00:34:13,519 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-11-07 00:34:13,519 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-11-07 00:34:13,519 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-11-07 00:34:13,520 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-07 00:34:13,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:34:13 BoogieIcfgContainer [2019-11-07 00:34:13,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:34:13,539 INFO L168 Benchmark]: Toolchain (without parser) took 4935.97 ms. Allocated memory was 145.8 MB in the beginning and 245.9 MB in the end (delta: 100.1 MB). Free memory was 103.3 MB in the beginning and 123.2 MB in the end (delta: -19.9 MB). Peak memory consumption was 80.3 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,540 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 579.61 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 103.1 MB in the beginning and 181.2 MB in the end (delta: -78.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,542 INFO L168 Benchmark]: Boogie Preprocessor took 53.50 ms. Allocated memory is still 203.4 MB. Free memory was 181.2 MB in the beginning and 179.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,543 INFO L168 Benchmark]: RCFGBuilder took 514.99 ms. Allocated memory is still 203.4 MB. Free memory was 179.8 MB in the beginning and 155.2 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,544 INFO L168 Benchmark]: TraceAbstraction took 3783.43 ms. Allocated memory was 203.4 MB in the beginning and 245.9 MB in the end (delta: 42.5 MB). Free memory was 154.5 MB in the beginning and 123.2 MB in the end (delta: 31.3 MB). Peak memory consumption was 73.8 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,547 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 579.61 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 103.1 MB in the beginning and 181.2 MB in the end (delta: -78.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.50 ms. Allocated memory is still 203.4 MB. Free memory was 181.2 MB in the beginning and 179.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 514.99 ms. Allocated memory is still 203.4 MB. Free memory was 179.8 MB in the beginning and 155.2 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3783.43 ms. Allocated memory was 203.4 MB in the beginning and 245.9 MB in the end (delta: 42.5 MB). Free memory was 154.5 MB in the beginning and 123.2 MB in the end (delta: 31.3 MB). Peak memory consumption was 73.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. Result: SAFE, OverallTime: 3.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 852 SDtfs, 1396 SDslu, 908 SDs, 0 SdLazy, 1094 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 330 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 50 HoareAnnotationTreeSize, 9 FomulaSimplifications, 849927 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2628 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 11162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...