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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:04:21,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:04:21,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:04:21,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:04:21,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:04:21,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:04:21,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:04:21,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:04:21,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:04:21,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:04:21,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:04:21,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:04:21,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:04:21,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:04:21,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:04:21,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:04:21,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:04:21,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:04:21,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:04:21,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:04:21,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:04:21,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:04:21,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:04:21,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:04:21,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:04:21,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:04:21,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:04:21,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:04:21,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:04:21,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:04:21,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:04:21,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:04:21,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:04:21,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:04:21,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:04:21,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:04:21,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:04:21,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:04:21,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:04:21,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:04:21,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:04:21,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:04:21,648 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:04:21,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:04:21,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:04:21,649 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:04:21,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:04:21,650 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:04:21,650 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:04:21,650 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:04:21,650 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:04:21,650 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:04:21,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:04:21,651 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:04:21,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:04:21,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:04:21,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:04:21,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:04:21,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:04:21,652 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:04:21,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:04:21,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:04:21,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:04:21,653 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:04:21,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:04:21,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:04:21,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:04:21,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:04:21,654 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:04:21,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:04:21,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:04:21,655 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:04:21,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:04:21,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:04:21,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:04:21,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:04:21,721 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:04:21,722 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-09-10 02:04:21,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a542da04a/564e0b5f744e4f8184f97edf78999cce/FLAG54267fd9f [2019-09-10 02:04:22,306 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:04:22,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-09-10 02:04:22,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a542da04a/564e0b5f744e4f8184f97edf78999cce/FLAG54267fd9f [2019-09-10 02:04:22,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a542da04a/564e0b5f744e4f8184f97edf78999cce [2019-09-10 02:04:22,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:04:22,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:04:22,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:22,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:04:22,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:04:22,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:22" (1/1) ... [2019-09-10 02:04:22,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b099e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:22, skipping insertion in model container [2019-09-10 02:04:22,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:22" (1/1) ... [2019-09-10 02:04:22,675 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:04:22,767 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:04:23,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:23,453 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:04:23,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:23,689 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:04:23,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:23 WrapperNode [2019-09-10 02:04:23,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:23,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:04:23,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:04:23,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:04:23,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:23" (1/1) ... [2019-09-10 02:04:23,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:23" (1/1) ... [2019-09-10 02:04:23,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:23" (1/1) ... [2019-09-10 02:04:23,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:23" (1/1) ... [2019-09-10 02:04:23,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:23" (1/1) ... [2019-09-10 02:04:23,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:23" (1/1) ... [2019-09-10 02:04:23,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:23" (1/1) ... [2019-09-10 02:04:23,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:04:23,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:04:23,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:04:23,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:04:23,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:23" (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-09-10 02:04:23,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:04:23,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:04:23,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:04:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:04:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:04:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:04:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:04:23,889 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:04:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:04:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:04:25,208 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:04:25,208 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:04:25,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:25 BoogieIcfgContainer [2019-09-10 02:04:25,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:04:25,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:04:25,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:04:25,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:04:25,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:04:22" (1/3) ... [2019-09-10 02:04:25,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bbfb15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:25, skipping insertion in model container [2019-09-10 02:04:25,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:23" (2/3) ... [2019-09-10 02:04:25,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bbfb15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:25, skipping insertion in model container [2019-09-10 02:04:25,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:25" (3/3) ... [2019-09-10 02:04:25,218 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2019-09-10 02:04:25,230 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:04:25,239 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 02:04:25,256 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 02:04:25,282 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:04:25,283 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:04:25,283 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:04:25,283 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:04:25,283 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:04:25,283 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:04:25,284 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:04:25,284 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:04:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2019-09-10 02:04:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 02:04:25,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:25,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:25,321 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:25,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:25,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1490721617, now seen corresponding path program 1 times [2019-09-10 02:04:25,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:25,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:25,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:25,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:25,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:25,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:25,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:25,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:25,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:25,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:25,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:25,563 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 4 states. [2019-09-10 02:04:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:26,311 INFO L93 Difference]: Finished difference Result 313 states and 558 transitions. [2019-09-10 02:04:26,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:26,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-10 02:04:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:26,337 INFO L225 Difference]: With dead ends: 313 [2019-09-10 02:04:26,337 INFO L226 Difference]: Without dead ends: 302 [2019-09-10 02:04:26,341 INFO L628 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-09-10 02:04:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-10 02:04:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-09-10 02:04:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-10 02:04:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2019-09-10 02:04:26,412 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2019-09-10 02:04:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:26,412 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2019-09-10 02:04:26,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2019-09-10 02:04:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:04:26,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:26,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:26,414 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267068, now seen corresponding path program 1 times [2019-09-10 02:04:26,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:26,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:26,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:26,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:26,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:26,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:26,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:26,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:26,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:26,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:26,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:26,493 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand 4 states. [2019-09-10 02:04:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:26,924 INFO L93 Difference]: Finished difference Result 307 states and 430 transitions. [2019-09-10 02:04:26,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:26,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-10 02:04:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:26,929 INFO L225 Difference]: With dead ends: 307 [2019-09-10 02:04:26,929 INFO L226 Difference]: Without dead ends: 304 [2019-09-10 02:04:26,930 INFO L628 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-09-10 02:04:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-10 02:04:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2019-09-10 02:04:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-10 02:04:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2019-09-10 02:04:26,944 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2019-09-10 02:04:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:26,944 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2019-09-10 02:04:26,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2019-09-10 02:04:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:04:26,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:26,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:26,946 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:26,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:26,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1016017071, now seen corresponding path program 1 times [2019-09-10 02:04:26,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:26,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:26,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:26,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:26,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:26,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:26,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:27,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:27,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:27,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:27,004 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 4 states. [2019-09-10 02:04:27,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:27,535 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2019-09-10 02:04:27,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:27,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-10 02:04:27,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:27,538 INFO L225 Difference]: With dead ends: 295 [2019-09-10 02:04:27,539 INFO L226 Difference]: Without dead ends: 295 [2019-09-10 02:04:27,539 INFO L628 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-09-10 02:04:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-10 02:04:27,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-09-10 02:04:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-10 02:04:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2019-09-10 02:04:27,551 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2019-09-10 02:04:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:27,552 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2019-09-10 02:04:27,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2019-09-10 02:04:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:04:27,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:27,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:27,553 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1431755048, now seen corresponding path program 1 times [2019-09-10 02:04:27,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:27,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:27,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:27,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:27,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:27,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:27,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:27,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:27,590 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand 4 states. [2019-09-10 02:04:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:27,934 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2019-09-10 02:04:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:27,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-10 02:04:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:27,937 INFO L225 Difference]: With dead ends: 298 [2019-09-10 02:04:27,937 INFO L226 Difference]: Without dead ends: 298 [2019-09-10 02:04:27,938 INFO L628 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-09-10 02:04:27,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-10 02:04:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-09-10 02:04:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-10 02:04:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2019-09-10 02:04:27,947 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2019-09-10 02:04:27,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:27,947 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2019-09-10 02:04:27,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2019-09-10 02:04:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:04:27,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:27,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:27,949 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:27,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:27,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1526969604, now seen corresponding path program 1 times [2019-09-10 02:04:27,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:27,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:27,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:27,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:28,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:28,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:28,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:28,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:28,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:28,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:28,006 INFO L87 Difference]: Start difference. First operand 298 states and 361 transitions. Second operand 5 states. [2019-09-10 02:04:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:28,674 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2019-09-10 02:04:28,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:28,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-10 02:04:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:28,677 INFO L225 Difference]: With dead ends: 296 [2019-09-10 02:04:28,678 INFO L226 Difference]: Without dead ends: 296 [2019-09-10 02:04:28,678 INFO L628 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-09-10 02:04:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-10 02:04:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-10 02:04:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-10 02:04:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2019-09-10 02:04:28,687 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2019-09-10 02:04:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:28,687 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2019-09-10 02:04:28,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2019-09-10 02:04:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:04:28,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:28,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:28,689 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:28,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash -91414371, now seen corresponding path program 1 times [2019-09-10 02:04:28,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:28,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:28,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:28,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:28,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:28,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:28,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:28,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:28,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:28,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:28,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:28,754 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand 4 states. [2019-09-10 02:04:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:29,088 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2019-09-10 02:04:29,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:29,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-10 02:04:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:29,090 INFO L225 Difference]: With dead ends: 294 [2019-09-10 02:04:29,090 INFO L226 Difference]: Without dead ends: 292 [2019-09-10 02:04:29,092 INFO L628 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-09-10 02:04:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-10 02:04:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-09-10 02:04:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-10 02:04:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2019-09-10 02:04:29,101 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2019-09-10 02:04:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:29,103 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2019-09-10 02:04:29,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2019-09-10 02:04:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:29,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:29,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:29,105 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:29,105 INFO L82 PathProgramCache]: Analyzing trace with hash -922816985, now seen corresponding path program 1 times [2019-09-10 02:04:29,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:29,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:29,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:29,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:29,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:29,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:29,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:29,204 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand 5 states. [2019-09-10 02:04:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:29,801 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2019-09-10 02:04:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:29,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:29,804 INFO L225 Difference]: With dead ends: 290 [2019-09-10 02:04:29,804 INFO L226 Difference]: Without dead ends: 290 [2019-09-10 02:04:29,805 INFO L628 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-09-10 02:04:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-10 02:04:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-09-10 02:04:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-10 02:04:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2019-09-10 02:04:29,811 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 17 [2019-09-10 02:04:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:29,812 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2019-09-10 02:04:29,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2019-09-10 02:04:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:29,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:29,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:29,813 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:29,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:29,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1474389837, now seen corresponding path program 1 times [2019-09-10 02:04:29,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:29,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:29,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:29,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:29,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:29,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:29,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:29,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:29,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:29,867 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand 5 states. [2019-09-10 02:04:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,399 INFO L93 Difference]: Finished difference Result 305 states and 370 transitions. [2019-09-10 02:04:30,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:30,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,402 INFO L225 Difference]: With dead ends: 305 [2019-09-10 02:04:30,402 INFO L226 Difference]: Without dead ends: 305 [2019-09-10 02:04:30,403 INFO L628 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-09-10 02:04:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-10 02:04:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2019-09-10 02:04:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-10 02:04:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2019-09-10 02:04:30,409 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 17 [2019-09-10 02:04:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,409 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2019-09-10 02:04:30,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2019-09-10 02:04:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:30,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,411 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,411 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1475929037, now seen corresponding path program 1 times [2019-09-10 02:04:30,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:30,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:30,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:30,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:30,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:30,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:30,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:30,448 INFO L87 Difference]: Start difference. First operand 285 states and 348 transitions. Second operand 5 states. [2019-09-10 02:04:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,014 INFO L93 Difference]: Finished difference Result 286 states and 349 transitions. [2019-09-10 02:04:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:31,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,017 INFO L225 Difference]: With dead ends: 286 [2019-09-10 02:04:31,017 INFO L226 Difference]: Without dead ends: 286 [2019-09-10 02:04:31,018 INFO L628 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-09-10 02:04:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-10 02:04:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2019-09-10 02:04:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-10 02:04:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2019-09-10 02:04:31,025 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 17 [2019-09-10 02:04:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,025 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2019-09-10 02:04:31,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2019-09-10 02:04:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:31,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,026 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,027 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1537186772, now seen corresponding path program 1 times [2019-09-10 02:04:31,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:31,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,093 INFO L87 Difference]: Start difference. First operand 283 states and 346 transitions. Second operand 5 states. [2019-09-10 02:04:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,653 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2019-09-10 02:04:31,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:31,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,656 INFO L225 Difference]: With dead ends: 304 [2019-09-10 02:04:31,656 INFO L226 Difference]: Without dead ends: 304 [2019-09-10 02:04:31,656 INFO L628 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-09-10 02:04:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-10 02:04:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 281. [2019-09-10 02:04:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-10 02:04:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2019-09-10 02:04:31,663 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 18 [2019-09-10 02:04:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,663 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2019-09-10 02:04:31,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2019-09-10 02:04:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:31,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,665 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1538552192, now seen corresponding path program 1 times [2019-09-10 02:04:31,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:31,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,751 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 5 states. [2019-09-10 02:04:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:32,435 INFO L93 Difference]: Finished difference Result 293 states and 358 transitions. [2019-09-10 02:04:32,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:32,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:32,439 INFO L225 Difference]: With dead ends: 293 [2019-09-10 02:04:32,439 INFO L226 Difference]: Without dead ends: 293 [2019-09-10 02:04:32,439 INFO L628 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-09-10 02:04:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-10 02:04:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2019-09-10 02:04:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-10 02:04:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 342 transitions. [2019-09-10 02:04:32,449 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 342 transitions. Word has length 18 [2019-09-10 02:04:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:32,449 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 342 transitions. [2019-09-10 02:04:32,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 342 transitions. [2019-09-10 02:04:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:32,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:32,450 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:32,451 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1490836942, now seen corresponding path program 1 times [2019-09-10 02:04:32,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:32,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:32,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:32,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:32,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:32,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:32,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:32,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:32,542 INFO L87 Difference]: Start difference. First operand 279 states and 342 transitions. Second operand 5 states. [2019-09-10 02:04:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:33,384 INFO L93 Difference]: Finished difference Result 277 states and 340 transitions. [2019-09-10 02:04:33,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:33,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:33,387 INFO L225 Difference]: With dead ends: 277 [2019-09-10 02:04:33,388 INFO L226 Difference]: Without dead ends: 275 [2019-09-10 02:04:33,388 INFO L628 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-09-10 02:04:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-10 02:04:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-09-10 02:04:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-10 02:04:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2019-09-10 02:04:33,397 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 18 [2019-09-10 02:04:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:33,398 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2019-09-10 02:04:33,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2019-09-10 02:04:33,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:04:33,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:33,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:33,399 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:33,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:33,400 INFO L82 PathProgramCache]: Analyzing trace with hash -408146528, now seen corresponding path program 1 times [2019-09-10 02:04:33,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:33,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:33,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:33,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:33,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:33,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:33,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:33,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:33,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:33,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:33,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:33,467 INFO L87 Difference]: Start difference. First operand 275 states and 338 transitions. Second operand 5 states. [2019-09-10 02:04:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:34,145 INFO L93 Difference]: Finished difference Result 288 states and 353 transitions. [2019-09-10 02:04:34,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:34,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-10 02:04:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:34,148 INFO L225 Difference]: With dead ends: 288 [2019-09-10 02:04:34,148 INFO L226 Difference]: Without dead ends: 288 [2019-09-10 02:04:34,149 INFO L628 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-09-10 02:04:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-10 02:04:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2019-09-10 02:04:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-10 02:04:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 336 transitions. [2019-09-10 02:04:34,159 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 336 transitions. Word has length 19 [2019-09-10 02:04:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:34,159 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 336 transitions. [2019-09-10 02:04:34,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 336 transitions. [2019-09-10 02:04:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:04:34,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:34,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:34,161 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:34,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1079809725, now seen corresponding path program 1 times [2019-09-10 02:04:34,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:34,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:34,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:34,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:34,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:34,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:34,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:34,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:34,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:34,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:34,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:34,238 INFO L87 Difference]: Start difference. First operand 273 states and 336 transitions. Second operand 4 states. [2019-09-10 02:04:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:34,555 INFO L93 Difference]: Finished difference Result 271 states and 334 transitions. [2019-09-10 02:04:34,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:34,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-10 02:04:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:34,558 INFO L225 Difference]: With dead ends: 271 [2019-09-10 02:04:34,558 INFO L226 Difference]: Without dead ends: 271 [2019-09-10 02:04:34,559 INFO L628 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-09-10 02:04:34,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-10 02:04:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-09-10 02:04:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-10 02:04:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2019-09-10 02:04:34,567 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 20 [2019-09-10 02:04:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:34,569 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2019-09-10 02:04:34,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2019-09-10 02:04:34,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 02:04:34,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:34,570 INFO L399 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-09-10 02:04:34,570 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:34,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:34,571 INFO L82 PathProgramCache]: Analyzing trace with hash 885640025, now seen corresponding path program 1 times [2019-09-10 02:04:34,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:34,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:34,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:34,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:34,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:34,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:34,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:34,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:34,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:34,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:34,617 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 4 states. [2019-09-10 02:04:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:34,890 INFO L93 Difference]: Finished difference Result 272 states and 335 transitions. [2019-09-10 02:04:34,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:34,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-10 02:04:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:34,892 INFO L225 Difference]: With dead ends: 272 [2019-09-10 02:04:34,892 INFO L226 Difference]: Without dead ends: 254 [2019-09-10 02:04:34,893 INFO L628 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-09-10 02:04:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-10 02:04:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-09-10 02:04:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-10 02:04:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-09-10 02:04:34,898 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 21 [2019-09-10 02:04:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:34,898 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-09-10 02:04:34,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-09-10 02:04:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 02:04:34,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:34,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:34,905 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:34,905 INFO L82 PathProgramCache]: Analyzing trace with hash 317164964, now seen corresponding path program 1 times [2019-09-10 02:04:34,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:34,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:34,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:34,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:34,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:37,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:37,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-09-10 02:04:37,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:37,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 02:04:37,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 02:04:37,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:04:37,156 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 63 states. [2019-09-10 02:04:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:38,362 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2019-09-10 02:04:38,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 02:04:38,363 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-09-10 02:04:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:38,365 INFO L225 Difference]: With dead ends: 253 [2019-09-10 02:04:38,366 INFO L226 Difference]: Without dead ends: 253 [2019-09-10 02:04:38,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:04:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-10 02:04:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-09-10 02:04:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-10 02:04:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-09-10 02:04:38,373 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2019-09-10 02:04:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:38,373 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-09-10 02:04:38,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 02:04:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-09-10 02:04:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 02:04:38,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:38,377 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:38,377 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:38,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1242183539, now seen corresponding path program 1 times [2019-09-10 02:04:38,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:38,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:38,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:39,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:39,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:39,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:39,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:39,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:39,501 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 5 states. [2019-09-10 02:04:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:40,033 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-09-10 02:04:40,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:40,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-09-10 02:04:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:40,035 INFO L225 Difference]: With dead ends: 252 [2019-09-10 02:04:40,035 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:04:40,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 5 SyntacticMatches, 174 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:04:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:04:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:04:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:04:40,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2019-09-10 02:04:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:40,037 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:04:40,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:04:40,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:04:40,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:04:40 BoogieIcfgContainer [2019-09-10 02:04:40,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:04:40,044 INFO L168 Benchmark]: Toolchain (without parser) took 17384.76 ms. Allocated memory was 140.0 MB in the beginning and 410.0 MB in the end (delta: 270.0 MB). Free memory was 94.4 MB in the beginning and 175.7 MB in the end (delta: -81.3 MB). Peak memory consumption was 188.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:40,045 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 114.5 MB in the beginning and 114.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:04:40,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1030.45 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 93.9 MB in the beginning and 159.0 MB in the end (delta: -65.0 MB). Peak memory consumption was 36.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:40,047 INFO L168 Benchmark]: Boogie Preprocessor took 129.68 ms. Allocated memory is still 204.5 MB. Free memory was 159.0 MB in the beginning and 153.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:40,048 INFO L168 Benchmark]: RCFGBuilder took 1389.45 ms. Allocated memory was 204.5 MB in the beginning and 236.5 MB in the end (delta: 32.0 MB). Free memory was 153.6 MB in the beginning and 100.5 MB in the end (delta: 53.1 MB). Peak memory consumption was 85.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:40,049 INFO L168 Benchmark]: TraceAbstraction took 14830.55 ms. Allocated memory was 236.5 MB in the beginning and 410.0 MB in the end (delta: 173.5 MB). Free memory was 100.5 MB in the beginning and 175.7 MB in the end (delta: -75.2 MB). Peak memory consumption was 98.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:40,052 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.19 ms. Allocated memory is still 140.0 MB. Free memory was 114.5 MB in the beginning and 114.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1030.45 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 93.9 MB in the beginning and 159.0 MB in the end (delta: -65.0 MB). Peak memory consumption was 36.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.68 ms. Allocated memory is still 204.5 MB. Free memory was 159.0 MB in the beginning and 153.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1389.45 ms. Allocated memory was 204.5 MB in the beginning and 236.5 MB in the end (delta: 32.0 MB). Free memory was 153.6 MB in the beginning and 100.5 MB in the end (delta: 53.1 MB). Peak memory consumption was 85.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14830.55 ms. Allocated memory was 236.5 MB in the beginning and 410.0 MB in the end (delta: 173.5 MB). Free memory was 100.5 MB in the beginning and 175.7 MB in the end (delta: -75.2 MB). Peak memory consumption was 98.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 262]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2611]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 309 locations, 16 error locations. SAFE Result, 14.7s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 9.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2745 SDtfs, 9352 SDslu, 3041 SDs, 0 SdLazy, 8200 SolverSat, 2430 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 42 SyntacticMatches, 179 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 86 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 589126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...