java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:12:13,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:12:13,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:12:13,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:12:13,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:12:13,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:12:13,505 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:12:13,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:12:13,510 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:12:13,511 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:12:13,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:12:13,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:12:13,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:12:13,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:12:13,517 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:12:13,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:12:13,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:12:13,531 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:12:13,533 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:12:13,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:12:13,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:12:13,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:12:13,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:12:13,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:12:13,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:12:13,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:12:13,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:12:13,543 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:12:13,544 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:12:13,545 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:12:13,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:12:13,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:12:13,546 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:12:13,546 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:12:13,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:12:13,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:12:13,550 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:12:13,577 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:12:13,577 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:12:13,578 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:12:13,578 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:12:13,579 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:12:13,579 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:12:13,579 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:12:13,579 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:12:13,580 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:12:13,580 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:12:13,580 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:12:13,580 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:12:13,580 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:12:13,581 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:12:13,581 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:12:13,581 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:12:13,582 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:12:13,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:12:13,582 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:12:13,582 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:12:13,582 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:12:13,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:12:13,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:12:13,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:12:13,584 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:12:13,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:12:13,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:12:13,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:12:13,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:12:13,585 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:12:13,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:12:13,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:12:13,586 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:12:13,586 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:12:13,586 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:12:13,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:12:13,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:12:13,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:12:13,651 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:12:13,652 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:12:13,652 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-07 22:12:13,709 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2f221cf/dcd856f94d6f4cec909603c0795b41c4/FLAG50e2b61d6 [2018-11-07 22:12:14,204 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:12:14,204 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-07 22:12:14,220 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2f221cf/dcd856f94d6f4cec909603c0795b41c4/FLAG50e2b61d6 [2018-11-07 22:12:14,239 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2f221cf/dcd856f94d6f4cec909603c0795b41c4 [2018-11-07 22:12:14,248 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:12:14,250 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:12:14,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:12:14,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:12:14,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:12:14,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f099800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14, skipping insertion in model container [2018-11-07 22:12:14,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:12:14,305 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:12:14,523 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:12:14,527 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:12:14,563 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:12:14,578 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:12:14,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14 WrapperNode [2018-11-07 22:12:14,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:12:14,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:12:14,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:12:14,580 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:12:14,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:12:14,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:12:14,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:12:14,621 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:12:14,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (1/1) ... [2018-11-07 22:12:14,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:12:14,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:12:14,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:12:14,664 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:12:14,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (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 [2018-11-07 22:12:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:12:14,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:12:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:12:14,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:12:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:12:14,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:12:15,419 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:12:15,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:12:15 BoogieIcfgContainer [2018-11-07 22:12:15,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:12:15,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:12:15,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:12:15,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:12:15,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:12:14" (1/3) ... [2018-11-07 22:12:15,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1f3ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:12:15, skipping insertion in model container [2018-11-07 22:12:15,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:12:14" (2/3) ... [2018-11-07 22:12:15,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1f3ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:12:15, skipping insertion in model container [2018-11-07 22:12:15,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:12:15" (3/3) ... [2018-11-07 22:12:15,427 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-11-07 22:12:15,437 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:12:15,446 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-11-07 22:12:15,466 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-11-07 22:12:15,506 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:12:15,506 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:12:15,507 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:12:15,507 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:12:15,507 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:12:15,507 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:12:15,507 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:12:15,508 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:12:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-07 22:12:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 22:12:15,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:15,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:15,544 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:15,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:15,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2018-11-07 22:12:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:15,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:15,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:15,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:15,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:15,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:15,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:12:15,723 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:15,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:12:15,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:12:15,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:12:15,742 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-11-07 22:12:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:15,777 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2018-11-07 22:12:15,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:12:15,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-07 22:12:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:15,792 INFO L225 Difference]: With dead ends: 88 [2018-11-07 22:12:15,792 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 22:12:15,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:12:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 22:12:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-07 22:12:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 22:12:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-07 22:12:15,847 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2018-11-07 22:12:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:15,848 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-07 22:12:15,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:12:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-07 22:12:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 22:12:15,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:15,849 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:15,850 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:15,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:15,851 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2018-11-07 22:12:15,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:15,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:15,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:15,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:15,853 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:16,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:16,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 22:12:16,009 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:16,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 22:12:16,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 22:12:16,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 22:12:16,012 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2018-11-07 22:12:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:16,525 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-11-07 22:12:16,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:12:16,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 22:12:16,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:16,528 INFO L225 Difference]: With dead ends: 153 [2018-11-07 22:12:16,528 INFO L226 Difference]: Without dead ends: 101 [2018-11-07 22:12:16,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:12:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-07 22:12:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2018-11-07 22:12:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 22:12:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-07 22:12:16,540 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2018-11-07 22:12:16,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:16,540 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-07 22:12:16,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 22:12:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-07 22:12:16,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 22:12:16,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:16,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:16,542 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:16,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:16,543 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2018-11-07 22:12:16,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:16,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:16,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:16,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:16,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:16,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:16,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:12:16,643 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:16,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:12:16,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:12:16,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:12:16,644 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2018-11-07 22:12:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:16,911 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-07 22:12:16,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:12:16,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-07 22:12:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:16,913 INFO L225 Difference]: With dead ends: 75 [2018-11-07 22:12:16,914 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 22:12:16,914 INFO L604 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 [2018-11-07 22:12:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 22:12:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-11-07 22:12:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 22:12:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-07 22:12:16,931 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2018-11-07 22:12:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:16,932 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-07 22:12:16,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:12:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-07 22:12:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 22:12:16,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:16,933 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:16,934 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:16,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:16,934 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2018-11-07 22:12:16,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:16,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:16,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:16,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:16,936 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:17,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:17,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:12:17,019 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:17,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:12:17,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:12:17,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:12:17,021 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-11-07 22:12:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:17,342 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-07 22:12:17,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:12:17,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-07 22:12:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:17,344 INFO L225 Difference]: With dead ends: 98 [2018-11-07 22:12:17,344 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 22:12:17,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:12:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 22:12:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 54. [2018-11-07 22:12:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 22:12:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 22:12:17,355 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2018-11-07 22:12:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:17,356 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 22:12:17,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:12:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 22:12:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 22:12:17,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:17,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:17,358 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:17,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2018-11-07 22:12:17,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:17,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:17,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:17,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:17,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:17,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:17,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 22:12:17,722 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:17,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:12:17,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:12:17,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-07 22:12:17,724 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 8 states. [2018-11-07 22:12:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:18,346 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-07 22:12:18,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:12:18,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-07 22:12:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:18,349 INFO L225 Difference]: With dead ends: 97 [2018-11-07 22:12:18,350 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 22:12:18,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:12:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 22:12:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2018-11-07 22:12:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 22:12:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-07 22:12:18,362 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-11-07 22:12:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:18,362 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-07 22:12:18,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:12:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-07 22:12:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 22:12:18,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:18,364 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:18,364 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:18,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:18,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2018-11-07 22:12:18,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:18,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:18,367 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:18,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:18,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:12:18,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:18,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:12:18,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:12:18,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:12:18,455 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-11-07 22:12:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:18,608 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-11-07 22:12:18,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:12:18,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-07 22:12:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:18,610 INFO L225 Difference]: With dead ends: 83 [2018-11-07 22:12:18,610 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 22:12:18,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:12:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 22:12:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2018-11-07 22:12:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 22:12:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 22:12:18,620 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-11-07 22:12:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:18,621 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 22:12:18,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:12:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 22:12:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:12:18,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:18,622 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:18,623 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:18,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:18,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2018-11-07 22:12:18,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:18,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:18,625 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:18,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:18,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:12:18,715 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:18,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:12:18,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:12:18,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:12:18,717 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-11-07 22:12:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:19,091 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-11-07 22:12:19,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:12:19,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 22:12:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:19,092 INFO L225 Difference]: With dead ends: 93 [2018-11-07 22:12:19,092 INFO L226 Difference]: Without dead ends: 91 [2018-11-07 22:12:19,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:12:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-07 22:12:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 48. [2018-11-07 22:12:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 22:12:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-07 22:12:19,105 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2018-11-07 22:12:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:19,106 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-07 22:12:19,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:12:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-07 22:12:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:12:19,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:19,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:19,109 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:19,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:19,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2018-11-07 22:12:19,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:19,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:19,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:19,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:19,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:19,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:19,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:12:19,186 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:19,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:12:19,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:12:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:12:19,188 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2018-11-07 22:12:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:19,386 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-07 22:12:19,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:12:19,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-07 22:12:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:19,388 INFO L225 Difference]: With dead ends: 73 [2018-11-07 22:12:19,388 INFO L226 Difference]: Without dead ends: 71 [2018-11-07 22:12:19,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:12:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-07 22:12:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2018-11-07 22:12:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 22:12:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-07 22:12:19,397 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2018-11-07 22:12:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:19,398 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-07 22:12:19,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:12:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-07 22:12:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:12:19,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:19,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:19,400 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:19,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2018-11-07 22:12:19,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:19,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:19,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:19,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:12:19,481 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:19,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:12:19,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:12:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:12:19,482 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-11-07 22:12:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:19,682 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-07 22:12:19,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:12:19,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-07 22:12:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:19,684 INFO L225 Difference]: With dead ends: 71 [2018-11-07 22:12:19,684 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 22:12:19,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:12:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 22:12:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 44. [2018-11-07 22:12:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 22:12:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-07 22:12:19,691 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2018-11-07 22:12:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:19,692 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-07 22:12:19,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:12:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-07 22:12:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:12:19,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:19,693 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:19,694 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:19,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2018-11-07 22:12:19,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:19,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:19,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:19,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:19,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:19,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:19,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:12:19,751 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:19,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:12:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:12:19,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:12:19,752 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-11-07 22:12:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:19,889 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-07 22:12:19,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:12:19,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 22:12:19,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:19,890 INFO L225 Difference]: With dead ends: 71 [2018-11-07 22:12:19,893 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 22:12:19,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:12:19,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 22:12:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2018-11-07 22:12:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 22:12:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-07 22:12:19,902 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2018-11-07 22:12:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:19,903 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-07 22:12:19,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:12:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-07 22:12:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 22:12:19,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:19,904 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:19,905 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:19,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2018-11-07 22:12:19,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:19,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:19,906 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:19,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:19,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:12:19,990 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:19,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:12:19,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:12:19,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:12:19,991 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-11-07 22:12:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:20,144 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-07 22:12:20,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:12:20,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-07 22:12:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:20,146 INFO L225 Difference]: With dead ends: 69 [2018-11-07 22:12:20,146 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 22:12:20,147 INFO L604 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 [2018-11-07 22:12:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 22:12:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2018-11-07 22:12:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 22:12:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-07 22:12:20,156 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2018-11-07 22:12:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:20,156 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-07 22:12:20,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:12:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-07 22:12:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 22:12:20,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:20,157 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:20,158 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:20,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2018-11-07 22:12:20,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:20,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:20,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:20,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:12:20,246 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:20,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:12:20,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:12:20,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:12:20,248 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-11-07 22:12:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:20,504 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-11-07 22:12:20,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:12:20,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 22:12:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:20,506 INFO L225 Difference]: With dead ends: 89 [2018-11-07 22:12:20,506 INFO L226 Difference]: Without dead ends: 87 [2018-11-07 22:12:20,507 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 22:12:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-07 22:12:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 38. [2018-11-07 22:12:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 22:12:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-07 22:12:20,514 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2018-11-07 22:12:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:20,515 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-07 22:12:20,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:12:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-07 22:12:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 22:12:20,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:20,516 INFO L375 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] [2018-11-07 22:12:20,517 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:20,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2018-11-07 22:12:20,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:20,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:20,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:20,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:20,519 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:20,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:20,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 22:12:20,757 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:20,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:12:20,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:12:20,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:12:20,759 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2018-11-07 22:12:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:21,193 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-07 22:12:21,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:12:21,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-07 22:12:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:21,195 INFO L225 Difference]: With dead ends: 72 [2018-11-07 22:12:21,195 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 22:12:21,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:12:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 22:12:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 36. [2018-11-07 22:12:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 22:12:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-07 22:12:21,203 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2018-11-07 22:12:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:21,203 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-07 22:12:21,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:12:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-07 22:12:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 22:12:21,204 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:21,205 INFO L375 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] [2018-11-07 22:12:21,205 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:21,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2018-11-07 22:12:21,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:21,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:21,208 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:21,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:21,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:12:21,297 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:21,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:12:21,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:12:21,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:12:21,299 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-11-07 22:12:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:21,609 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-11-07 22:12:21,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:12:21,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-07 22:12:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:21,610 INFO L225 Difference]: With dead ends: 105 [2018-11-07 22:12:21,610 INFO L226 Difference]: Without dead ends: 103 [2018-11-07 22:12:21,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:12:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-07 22:12:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 34. [2018-11-07 22:12:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 22:12:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-07 22:12:21,619 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2018-11-07 22:12:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:21,619 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-07 22:12:21,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:12:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-07 22:12:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 22:12:21,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:21,620 INFO L375 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] [2018-11-07 22:12:21,621 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:21,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2018-11-07 22:12:21,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:21,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:21,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:21,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:21,623 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:21,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:21,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 22:12:21,715 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:21,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:12:21,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:12:21,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:12:21,716 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-11-07 22:12:22,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:22,313 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-07 22:12:22,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:12:22,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-07 22:12:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:22,316 INFO L225 Difference]: With dead ends: 70 [2018-11-07 22:12:22,316 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 22:12:22,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:12:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 22:12:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 32. [2018-11-07 22:12:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 22:12:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-07 22:12:22,324 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2018-11-07 22:12:22,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:22,325 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-07 22:12:22,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:12:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-07 22:12:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 22:12:22,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:22,326 INFO L375 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] [2018-11-07 22:12:22,327 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:22,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:22,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2018-11-07 22:12:22,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:22,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:22,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:22,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:22,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:12:22,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:12:22,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 22:12:22,421 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:22,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:12:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:12:22,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:12:22,423 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-11-07 22:12:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:22,665 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-07 22:12:22,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:12:22,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-07 22:12:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:22,667 INFO L225 Difference]: With dead ends: 85 [2018-11-07 22:12:22,667 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 22:12:22,668 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:12:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 22:12:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 22:12:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 22:12:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 22:12:22,670 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-07 22:12:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:22,671 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 22:12:22,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:12:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 22:12:22,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 22:12:22,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 22:12:22,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:12:22,893 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 63 [2018-11-07 22:12:22,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:12:23,057 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 94 [2018-11-07 22:12:23,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:12:23,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:12:23,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:12:23,256 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 86 [2018-11-07 22:12:24,502 WARN L179 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-07 22:12:25,229 WARN L179 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 33 [2018-11-07 22:12:25,751 WARN L179 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 18 [2018-11-07 22:12:25,755 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:12:25,755 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:12:25,755 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:12:25,755 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:12:25,756 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 22:12:25,756 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:12:25,756 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:12:25,756 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2018-11-07 22:12:25,756 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2018-11-07 22:12:25,756 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2018-11-07 22:12:25,756 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2018-11-07 22:12:25,756 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2018-11-07 22:12:25,757 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2018-11-07 22:12:25,757 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2018-11-07 22:12:25,757 INFO L421 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse2 (<= (+ main_~main__j~0 4) main_~main__bufsize~0))) (let ((.cse0 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) (.cse1 (and (<= 1 main_~main__j~0) (let ((.cse3 (<= 1 main_~main__i~0))) (or (and .cse3 (not (= 0 main_~__VERIFIER_assert__cond~12))) (and .cse3 .cse2)))))) (or (and .cse0 .cse1 (not (= 0 main_~__VERIFIER_assert__cond~14))) (and (and .cse0 (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0))) (<= 0 main_~main__j~0)) (and .cse0 .cse1 .cse2)))) [2018-11-07 22:12:25,757 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 22:12:25,757 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2018-11-07 22:12:25,757 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2018-11-07 22:12:25,757 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2018-11-07 22:12:25,758 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2018-11-07 22:12:25,758 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-11-07 22:12:25,758 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2018-11-07 22:12:25,758 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 22:12:25,758 INFO L425 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-11-07 22:12:25,758 INFO L425 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-11-07 22:12:25,758 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2018-11-07 22:12:25,758 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-07 22:12:25,758 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2018-11-07 22:12:25,758 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2018-11-07 22:12:25,759 INFO L425 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-11-07 22:12:25,759 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2018-11-07 22:12:25,759 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2018-11-07 22:12:25,759 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: true [2018-11-07 22:12:25,759 INFO L425 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-11-07 22:12:25,759 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2018-11-07 22:12:25,759 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2018-11-07 22:12:25,759 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2018-11-07 22:12:25,759 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2018-11-07 22:12:25,759 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2018-11-07 22:12:25,760 INFO L425 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-11-07 22:12:25,760 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2018-11-07 22:12:25,760 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2018-11-07 22:12:25,760 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2018-11-07 22:12:25,760 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2018-11-07 22:12:25,760 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 22:12:25,760 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2018-11-07 22:12:25,761 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-11-07 22:12:25,761 INFO L421 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__j~0)) [2018-11-07 22:12:25,761 INFO L425 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2018-11-07 22:12:25,761 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 22:12:25,761 INFO L425 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-07 22:12:25,761 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2018-11-07 22:12:25,761 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2018-11-07 22:12:25,762 INFO L425 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-07 22:12:25,762 INFO L425 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-11-07 22:12:25,762 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-07 22:12:25,762 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2018-11-07 22:12:25,762 INFO L425 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-07 22:12:25,762 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2018-11-07 22:12:25,762 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2018-11-07 22:12:25,762 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-07 22:12:25,763 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2018-11-07 22:12:25,763 INFO L421 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2018-11-07 22:12:25,763 INFO L425 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-07 22:12:25,763 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2018-11-07 22:12:25,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:12:25 BoogieIcfgContainer [2018-11-07 22:12:25,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:12:25,783 INFO L168 Benchmark]: Toolchain (without parser) took 11534.17 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -858.9 MB). Peak memory consumption was 594.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:12:25,784 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:12:25,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:12:25,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:12:25,786 INFO L168 Benchmark]: Boogie Preprocessor took 42.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:12:25,786 INFO L168 Benchmark]: RCFGBuilder took 755.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.2 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:12:25,787 INFO L168 Benchmark]: TraceAbstraction took 10361.73 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 132.1 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -108.3 MB). Peak memory consumption was 619.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:12:25,792 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 755.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.2 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10361.73 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 132.1 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -108.3 MB). Peak memory consumption was 619.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: 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: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__limit + 4 <= main__bufsize && 1 <= main__j && ((1 <= main__i && !(0 == __VERIFIER_assert__cond)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && !(0 == __VERIFIER_assert__cond)) || ((main__limit + 4 <= main__bufsize && main__i < main__len && 0 <= main__i) && 0 <= main__j)) || ((main__limit + 4 <= main__bufsize && 1 <= main__j && ((1 <= main__i && !(0 == __VERIFIER_assert__cond)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__i < main__len && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 10.2s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 917 SDtfs, 1559 SDslu, 1120 SDs, 0 SdLazy, 1186 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 16 MinimizatonAttempts, 528 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 23 NumberOfFragments, 118 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1474945965 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1237784 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 14171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...