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/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:40:18,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:40:18,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:40:18,343 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:40:18,343 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:40:18,344 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:40:18,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:40:18,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:40:18,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:40:18,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:40:18,354 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:40:18,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:40:18,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:40:18,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:40:18,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:40:18,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:40:18,359 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:40:18,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:40:18,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:40:18,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:40:18,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:40:18,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:40:18,369 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:40:18,369 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:40:18,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:40:18,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:40:18,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:40:18,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:40:18,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:40:18,377 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:40:18,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:40:18,378 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:40:18,378 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:40:18,379 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:40:18,380 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:40:18,380 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:40:18,381 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-12 20:40:18,413 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:40:18,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:40:18,414 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:40:18,414 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:40:18,415 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:40:18,415 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:40:18,415 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:40:18,415 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:40:18,415 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:40:18,415 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:40:18,416 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:40:18,416 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:40:18,416 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:40:18,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:40:18,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:40:18,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:40:18,417 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:40:18,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:40:18,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:40:18,418 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:40:18,418 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:40:18,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:40:18,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:40:18,419 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:40:18,419 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:40:18,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:40:18,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:40:18,419 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:40:18,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:40:18,420 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:40:18,420 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:40:18,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:40:18,420 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:40:18,421 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:40:18,421 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:40:18,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:40:18,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:40:18,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:40:18,509 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:40:18,510 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:40:18,510 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-12 20:40:18,568 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92bef09b/127579beece046fba4eed60854b0640d/FLAG84678c402 [2018-11-12 20:40:19,024 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:40:19,025 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-12 20:40:19,033 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92bef09b/127579beece046fba4eed60854b0640d/FLAG84678c402 [2018-11-12 20:40:19,050 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92bef09b/127579beece046fba4eed60854b0640d [2018-11-12 20:40:19,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:40:19,062 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:40:19,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:40:19,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:40:19,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:40:19,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d97970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19, skipping insertion in model container [2018-11-12 20:40:19,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:40:19,129 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:40:19,421 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:40:19,427 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:40:19,475 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:40:19,492 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:40:19,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19 WrapperNode [2018-11-12 20:40:19,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:40:19,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:40:19,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:40:19,494 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:40:19,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:40:19,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:40:19,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:40:19,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:40:19,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (1/1) ... [2018-11-12 20:40:19,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:40:19,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:40:19,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:40:19,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:40:19,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (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-12 20:40:19,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:40:19,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:40:19,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:40:19,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:40:19,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:40:19,682 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:40:20,461 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:40:20,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:40:20 BoogieIcfgContainer [2018-11-12 20:40:20,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:40:20,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:40:20,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:40:20,471 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:40:20,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:40:19" (1/3) ... [2018-11-12 20:40:20,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392b5d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:40:20, skipping insertion in model container [2018-11-12 20:40:20,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:19" (2/3) ... [2018-11-12 20:40:20,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392b5d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:40:20, skipping insertion in model container [2018-11-12 20:40:20,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:40:20" (3/3) ... [2018-11-12 20:40:20,476 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-12 20:40:20,486 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:40:20,497 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-12 20:40:20,518 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-12 20:40:20,573 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:40:20,573 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:40:20,573 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:40:20,573 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:40:20,573 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:40:20,574 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:40:20,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:40:20,574 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:40:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-11-12 20:40:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 20:40:20,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:20,607 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-12 20:40:20,610 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:20,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2018-11-12 20:40:20,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:20,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:20,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:20,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:20,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:20,811 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-12 20:40:20,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:20,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:40:20,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:20,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:40:20,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:40:20,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:40:20,837 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2018-11-12 20:40:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:20,880 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2018-11-12 20:40:20,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:40:20,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-12 20:40:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:20,896 INFO L225 Difference]: With dead ends: 93 [2018-11-12 20:40:20,896 INFO L226 Difference]: Without dead ends: 80 [2018-11-12 20:40:20,899 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-12 20:40:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-12 20:40:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-12 20:40:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-12 20:40:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-11-12 20:40:20,949 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2018-11-12 20:40:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:20,949 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-11-12 20:40:20,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:40:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-12 20:40:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 20:40:20,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:20,951 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-12 20:40:20,951 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:20,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:20,952 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2018-11-12 20:40:20,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:20,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:20,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:20,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:20,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:21,289 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-12 20:40:21,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:21,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:21,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:21,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:21,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:21,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:21,292 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2018-11-12 20:40:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:21,581 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-12 20:40:21,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:21,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-12 20:40:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:21,584 INFO L225 Difference]: With dead ends: 80 [2018-11-12 20:40:21,584 INFO L226 Difference]: Without dead ends: 78 [2018-11-12 20:40:21,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-12 20:40:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-12 20:40:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-12 20:40:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-12 20:40:21,596 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2018-11-12 20:40:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:21,597 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-12 20:40:21,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-12 20:40:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-12 20:40:21,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:21,598 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-12 20:40:21,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:21,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:21,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2018-11-12 20:40:21,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:21,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:21,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:21,818 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-12 20:40:21,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:21,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:21,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:21,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:21,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:21,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:21,821 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2018-11-12 20:40:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:22,051 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-12 20:40:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:22,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-12 20:40:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:22,055 INFO L225 Difference]: With dead ends: 116 [2018-11-12 20:40:22,056 INFO L226 Difference]: Without dead ends: 114 [2018-11-12 20:40:22,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-12 20:40:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 76. [2018-11-12 20:40:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-12 20:40:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-12 20:40:22,067 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2018-11-12 20:40:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:22,068 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-12 20:40:22,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-12 20:40:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:40:22,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:22,069 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-12 20:40:22,070 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:22,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:22,071 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2018-11-12 20:40:22,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:22,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:22,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:22,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:22,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:22,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-12 20:40:22,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:22,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:22,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:22,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:22,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:22,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:22,299 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-11-12 20:40:22,525 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 20:40:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:22,692 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-12 20:40:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:22,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-12 20:40:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:22,696 INFO L225 Difference]: With dead ends: 76 [2018-11-12 20:40:22,696 INFO L226 Difference]: Without dead ends: 74 [2018-11-12 20:40:22,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:40:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-12 20:40:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-12 20:40:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-12 20:40:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-12 20:40:22,705 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2018-11-12 20:40:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:22,706 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-12 20:40:22,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-12 20:40:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-12 20:40:22,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:22,707 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, 1] [2018-11-12 20:40:22,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:22,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:22,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2018-11-12 20:40:22,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:22,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:22,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:22,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:22,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:22,815 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-12 20:40:22,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:22,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:22,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:22,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:22,817 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-11-12 20:40:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:23,252 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-11-12 20:40:23,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:23,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-12 20:40:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:23,256 INFO L225 Difference]: With dead ends: 141 [2018-11-12 20:40:23,256 INFO L226 Difference]: Without dead ends: 139 [2018-11-12 20:40:23,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-12 20:40:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2018-11-12 20:40:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-12 20:40:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-12 20:40:23,267 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2018-11-12 20:40:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:23,267 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-12 20:40:23,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-12 20:40:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-12 20:40:23,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:23,269 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, 1] [2018-11-12 20:40:23,270 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:23,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2018-11-12 20:40:23,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:23,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:23,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:23,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:23,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:23,361 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-12 20:40:23,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:23,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:23,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:23,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:23,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:23,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:23,363 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-12 20:40:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:23,587 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-11-12 20:40:23,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:23,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-12 20:40:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:23,593 INFO L225 Difference]: With dead ends: 108 [2018-11-12 20:40:23,594 INFO L226 Difference]: Without dead ends: 106 [2018-11-12 20:40:23,594 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-12 20:40:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-11-12 20:40:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-12 20:40:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-12 20:40:23,605 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2018-11-12 20:40:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:23,605 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-12 20:40:23,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-12 20:40:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:40:23,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:23,611 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, 1, 1] [2018-11-12 20:40:23,612 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:23,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:23,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2018-11-12 20:40:23,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:23,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:23,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:23,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:23,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:23,772 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-12 20:40:23,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:23,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:23,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:23,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:23,774 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-11-12 20:40:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:23,937 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-11-12 20:40:23,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:40:23,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-12 20:40:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:23,940 INFO L225 Difference]: With dead ends: 121 [2018-11-12 20:40:23,940 INFO L226 Difference]: Without dead ends: 119 [2018-11-12 20:40:23,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-12 20:40:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2018-11-12 20:40:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-12 20:40:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-12 20:40:23,951 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2018-11-12 20:40:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:23,951 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-12 20:40:23,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-12 20:40:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:40:23,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:23,952 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, 1, 1] [2018-11-12 20:40:23,953 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:23,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:23,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2018-11-12 20:40:23,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:23,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:23,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:24,046 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-12 20:40:24,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:24,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:24,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:24,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:24,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:24,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:24,048 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-12 20:40:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:24,185 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-12 20:40:24,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:40:24,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-12 20:40:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:24,186 INFO L225 Difference]: With dead ends: 77 [2018-11-12 20:40:24,187 INFO L226 Difference]: Without dead ends: 75 [2018-11-12 20:40:24,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-12 20:40:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-12 20:40:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-12 20:40:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-12 20:40:24,194 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2018-11-12 20:40:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:24,195 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-12 20:40:24,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-12 20:40:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:40:24,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:24,196 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, 1, 1, 1, 1] [2018-11-12 20:40:24,197 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:24,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:24,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2018-11-12 20:40:24,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:24,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:24,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:24,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:24,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:24,265 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-12 20:40:24,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:24,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:40:24,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:24,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:40:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:40:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:40:24,268 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2018-11-12 20:40:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:24,433 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-12 20:40:24,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:40:24,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-12 20:40:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:24,435 INFO L225 Difference]: With dead ends: 115 [2018-11-12 20:40:24,435 INFO L226 Difference]: Without dead ends: 75 [2018-11-12 20:40:24,436 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-12 20:40:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-12 20:40:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-12 20:40:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-12 20:40:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-11-12 20:40:24,444 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2018-11-12 20:40:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:24,445 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-11-12 20:40:24,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:40:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-11-12 20:40:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-12 20:40:24,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:24,446 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, 1, 1, 1, 1, 1] [2018-11-12 20:40:24,447 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:24,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2018-11-12 20:40:24,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:24,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:24,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:24,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:24,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:24,571 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-12 20:40:24,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:24,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:40:24,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:24,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:40:24,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:40:24,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:24,573 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 7 states. [2018-11-12 20:40:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:24,732 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-12 20:40:24,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:24,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-12 20:40:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:24,734 INFO L225 Difference]: With dead ends: 76 [2018-11-12 20:40:24,734 INFO L226 Difference]: Without dead ends: 74 [2018-11-12 20:40:24,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:40:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-12 20:40:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-12 20:40:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-12 20:40:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-12 20:40:24,744 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2018-11-12 20:40:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:24,744 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-12 20:40:24,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:40:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-12 20:40:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-12 20:40:24,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:24,746 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 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-12 20:40:24,746 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:24,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:24,747 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2018-11-12 20:40:24,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:24,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:24,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:24,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:24,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-12 20:40:24,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:24,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:24,863 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-12 20:40:24,864 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [192], [195], [196], [198], [204], [214], [215], [216] [2018-11-12 20:40:24,896 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:40:24,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:40:25,291 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:40:25,293 INFO L272 AbstractInterpreter]: Visited 28 different actions 64 times. Merged at 6 different actions 36 times. Widened at 1 different actions 2 times. Performed 381 root evaluator evaluations with a maximum evaluation depth of 6. Performed 381 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-12 20:40:25,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:25,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:40:25,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:25,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:25,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:25,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:25,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-12 20:40:25,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-12 20:40:25,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:25,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-11-12 20:40:25,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:25,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:40:25,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:40:25,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:40:25,594 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2018-11-12 20:40:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:25,907 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-11-12 20:40:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:25,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-12 20:40:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:25,909 INFO L225 Difference]: With dead ends: 111 [2018-11-12 20:40:25,909 INFO L226 Difference]: Without dead ends: 109 [2018-11-12 20:40:25,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-12 20:40:25,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2018-11-12 20:40:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-12 20:40:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-12 20:40:25,917 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2018-11-12 20:40:25,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:25,918 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-12 20:40:25,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:40:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-12 20:40:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 20:40:25,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:25,919 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, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:25,920 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:25,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:25,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2018-11-12 20:40:25,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:25,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:25,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:25,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:26,035 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-12 20:40:26,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:26,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:26,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:26,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:26,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:26,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:26,038 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2018-11-12 20:40:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:26,220 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-12 20:40:26,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:26,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-12 20:40:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:26,222 INFO L225 Difference]: With dead ends: 70 [2018-11-12 20:40:26,222 INFO L226 Difference]: Without dead ends: 68 [2018-11-12 20:40:26,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:40:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-12 20:40:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-12 20:40:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-12 20:40:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-12 20:40:26,229 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2018-11-12 20:40:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:26,229 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-12 20:40:26,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-12 20:40:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 20:40:26,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:26,231 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 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-12 20:40:26,232 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:26,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:26,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2018-11-12 20:40:26,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:26,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:26,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:26,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:26,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-12 20:40:26,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:26,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:26,361 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-12 20:40:26,361 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [85], [86], [192], [198], [204], [214], [215], [216] [2018-11-12 20:40:26,364 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:40:26,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:40:26,607 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:40:26,608 INFO L272 AbstractInterpreter]: Visited 30 different actions 75 times. Merged at 8 different actions 44 times. Widened at 2 different actions 3 times. Performed 459 root evaluator evaluations with a maximum evaluation depth of 6. Performed 459 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-11-12 20:40:26,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:26,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:40:26,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:26,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:26,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:26,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:26,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-12 20:40:26,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-12 20:40:27,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:27,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-11-12 20:40:27,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:27,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:40:27,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:40:27,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:40:27,071 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2018-11-12 20:40:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:27,254 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-12 20:40:27,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:27,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-12 20:40:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:27,255 INFO L225 Difference]: With dead ends: 69 [2018-11-12 20:40:27,255 INFO L226 Difference]: Without dead ends: 67 [2018-11-12 20:40:27,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-12 20:40:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-11-12 20:40:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-12 20:40:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-12 20:40:27,261 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2018-11-12 20:40:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:27,262 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-12 20:40:27,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:40:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-12 20:40:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-12 20:40:27,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:27,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:27,263 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:27,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2018-11-12 20:40:27,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:27,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:27,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:27,835 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-12 20:40:27,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:27,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:40:27,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:27,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:40:27,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:40:27,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:27,837 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 7 states. [2018-11-12 20:40:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:28,106 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-12 20:40:28,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:28,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-12 20:40:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:28,108 INFO L225 Difference]: With dead ends: 63 [2018-11-12 20:40:28,108 INFO L226 Difference]: Without dead ends: 61 [2018-11-12 20:40:28,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:40:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-12 20:40:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-12 20:40:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:40:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-12 20:40:28,114 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-11-12 20:40:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:28,114 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-12 20:40:28,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:40:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-12 20:40:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-12 20:40:28,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:28,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:28,115 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:28,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:28,116 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2018-11-12 20:40:28,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:28,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:28,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:28,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:28,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:28,232 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-12 20:40:28,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:28,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 20:40:28,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:28,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:40:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:40:28,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:28,235 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2018-11-12 20:40:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:28,419 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-11-12 20:40:28,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:28,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-12 20:40:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:28,420 INFO L225 Difference]: With dead ends: 71 [2018-11-12 20:40:28,420 INFO L226 Difference]: Without dead ends: 69 [2018-11-12 20:40:28,421 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:40:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-12 20:40:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2018-11-12 20:40:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-12 20:40:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-12 20:40:28,427 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2018-11-12 20:40:28,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:28,427 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-12 20:40:28,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:40:28,427 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-12 20:40:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-12 20:40:28,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:28,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:28,429 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:28,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2018-11-12 20:40:28,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:28,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:28,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:28,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:28,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:28,510 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-12 20:40:28,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:28,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:28,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:28,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:28,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:28,511 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2018-11-12 20:40:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:28,768 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-12 20:40:28,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:28,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-12 20:40:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:28,769 INFO L225 Difference]: With dead ends: 91 [2018-11-12 20:40:28,770 INFO L226 Difference]: Without dead ends: 89 [2018-11-12 20:40:28,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12 20:40:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-12 20:40:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2018-11-12 20:40:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-12 20:40:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-11-12 20:40:28,777 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2018-11-12 20:40:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:28,778 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-11-12 20:40:28,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-12 20:40:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-12 20:40:28,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:28,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:28,779 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:28,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:28,780 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2018-11-12 20:40:28,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:28,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:28,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:28,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:28,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:28,990 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-12 20:40:29,059 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-12 20:40:29,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:29,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:29,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:29,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:29,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:29,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:29,061 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2018-11-12 20:40:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:29,226 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-12 20:40:29,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:40:29,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-12 20:40:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:29,228 INFO L225 Difference]: With dead ends: 61 [2018-11-12 20:40:29,228 INFO L226 Difference]: Without dead ends: 59 [2018-11-12 20:40:29,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-12 20:40:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-12 20:40:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-12 20:40:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-12 20:40:29,236 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2018-11-12 20:40:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:29,236 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-12 20:40:29,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-12 20:40:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 20:40:29,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:29,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:29,238 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:29,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:29,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2018-11-12 20:40:29,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:29,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:29,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:29,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:29,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:29,512 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-12 20:40:29,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:29,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:29,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:29,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:29,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:29,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:29,514 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2018-11-12 20:40:29,775 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 20:40:30,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:30,075 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-11-12 20:40:30,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:30,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-12 20:40:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:30,076 INFO L225 Difference]: With dead ends: 70 [2018-11-12 20:40:30,076 INFO L226 Difference]: Without dead ends: 68 [2018-11-12 20:40:30,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-12 20:40:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-11-12 20:40:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-12 20:40:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-12 20:40:30,083 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2018-11-12 20:40:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:30,084 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-12 20:40:30,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-12 20:40:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-12 20:40:30,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:30,085 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:30,085 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:30,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2018-11-12 20:40:30,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:30,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:30,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:30,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:30,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:30,461 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-12 20:40:30,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:30,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:30,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:30,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:30,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:30,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:30,463 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-11-12 20:40:30,679 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 20:40:30,937 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 20:40:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:31,037 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-12 20:40:31,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:31,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-12 20:40:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:31,039 INFO L225 Difference]: With dead ends: 66 [2018-11-12 20:40:31,039 INFO L226 Difference]: Without dead ends: 64 [2018-11-12 20:40:31,040 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:40:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-12 20:40:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-11-12 20:40:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-12 20:40:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-12 20:40:31,046 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2018-11-12 20:40:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:31,047 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-12 20:40:31,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-12 20:40:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-12 20:40:31,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:31,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:31,048 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:31,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:31,049 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2018-11-12 20:40:31,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:31,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:31,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:31,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:31,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:31,233 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 20:40:31,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-12 20:40:31,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:31,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:31,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:31,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:31,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:31,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:31,248 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2018-11-12 20:40:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:31,432 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-11-12 20:40:31,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:31,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-12 20:40:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:31,434 INFO L225 Difference]: With dead ends: 88 [2018-11-12 20:40:31,434 INFO L226 Difference]: Without dead ends: 86 [2018-11-12 20:40:31,435 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:31,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-12 20:40:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-11-12 20:40:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:40:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-12 20:40:31,465 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2018-11-12 20:40:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:31,465 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-12 20:40:31,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-12 20:40:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-12 20:40:31,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:31,466 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:40:31,466 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:31,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2018-11-12 20:40:31,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:31,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:31,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:31,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:31,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:31,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:31,778 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-12 20:40:31,779 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [21], [25], [29], [32], [35], [38], [42], [46], [52], [58], [61], [67], [73], [77], [80], [82], [88], [94], [100], [106], [112], [117], [120], [126], [132], [136], [139], [142], [143], [145], [151], [180], [182], [214], [215], [216] [2018-11-12 20:40:31,781 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:40:31,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:40:31,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:40:31,973 INFO L272 AbstractInterpreter]: Visited 42 different actions 89 times. Merged at 8 different actions 47 times. Widened at 2 different actions 3 times. Performed 483 root evaluator evaluations with a maximum evaluation depth of 6. Performed 483 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 44 variables. [2018-11-12 20:40:32,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:32,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:40:32,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:32,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:32,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:32,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:32,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:32,404 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-11-12 20:40:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:32,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:32,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:32,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-11-12 20:40:32,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:32,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:40:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:40:32,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:40:32,883 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 9 states. [2018-11-12 20:40:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:33,048 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-12 20:40:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:33,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-12 20:40:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:33,050 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:40:33,050 INFO L226 Difference]: Without dead ends: 58 [2018-11-12 20:40:33,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-12 20:40:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-12 20:40:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-12 20:40:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-12 20:40:33,060 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2018-11-12 20:40:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:33,060 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-12 20:40:33,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:40:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-12 20:40:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-12 20:40:33,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:33,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:33,061 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:33,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:33,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2018-11-12 20:40:33,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:33,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:33,136 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-12 20:40:33,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:33,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:33,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:33,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:33,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:33,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:33,138 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-11-12 20:40:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:33,280 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-12 20:40:33,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:40:33,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-12 20:40:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:33,282 INFO L225 Difference]: With dead ends: 69 [2018-11-12 20:40:33,282 INFO L226 Difference]: Without dead ends: 67 [2018-11-12 20:40:33,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12 20:40:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-12 20:40:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2018-11-12 20:40:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-12 20:40:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-12 20:40:33,288 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2018-11-12 20:40:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:33,288 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-12 20:40:33,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-12 20:40:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:40:33,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:33,289 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:40:33,290 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:33,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:33,290 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2018-11-12 20:40:33,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:33,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:33,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:33,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:33,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:33,493 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 20:40:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:40:33,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:33,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:33,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:33,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:33,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:33,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:33,535 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-11-12 20:40:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:33,719 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-12 20:40:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:40:33,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-12 20:40:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:33,720 INFO L225 Difference]: With dead ends: 75 [2018-11-12 20:40:33,720 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 20:40:33,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:40:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 20:40:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 20:40:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 20:40:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 20:40:33,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-11-12 20:40:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:33,722 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 20:40:33,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 20:40:33,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 20:40:33,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 20:40:33,843 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 107 [2018-11-12 20:40:33,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:40:33,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:40:33,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:40:33,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 20:40:35,126 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 105 DAG size of output: 69 [2018-11-12 20:40:35,375 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 27 [2018-11-12 20:40:35,773 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2018-11-12 20:40:35,983 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2018-11-12 20:40:35,993 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:40:35,993 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:40:35,993 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:40:35,993 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 20:40:35,993 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-12 20:40:35,993 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 20:40:35,993 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 20:40:35,993 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-11-12 20:40:35,994 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-12 20:40:35,995 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2018-11-12 20:40:35,995 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2018-11-12 20:40:35,995 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-11-12 20:40:35,995 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-12 20:40:35,995 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2018-11-12 20:40:35,995 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2018-11-12 20:40:35,995 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-12 20:40:35,995 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2018-11-12 20:40:35,996 INFO L421 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse2 (<= 2 main_~main__cp~0)) (.cse1 (= main_~main__c~0 0)) (.cse3 (= main_~__VERIFIER_assert__cond~9 1)) (.cse4 (and (and (not (= 0 main_~__VERIFIER_assert__cond~7)) (and (= main_~__VERIFIER_assert__cond~3 1) (not (= 0 main_~__VERIFIER_assert__cond~2)) (not (= 0 main_~__VERIFIER_assert__cond~5)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (<= 1 main_~main__scheme~0) (not (= 0 main_~__VERIFIER_assert__cond~6)) (not (= 0 main_~__VERIFIER_assert__cond~1))) (<= 1 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~0 1) (= main_~__VERIFIER_assert__cond~4 1)) (not (= 0 main_~__VERIFIER_assert__cond~8))))) (or (and (let ((.cse0 (let ((.cse5 (not (= 0 main_~__VERIFIER_assert__cond~11)))) (or (and .cse2 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (not (= 0 main_~__VERIFIER_assert__cond~12))))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse0) (and .cse1 .cse0))) (= main_~__VERIFIER_assert__cond~10 1)) (and .cse2 (<= (+ main_~main__cp~0 2) main_~main__urilen~0) .cse1 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~8 1)))) [2018-11-12 20:40:35,996 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2018-11-12 20:40:35,996 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2018-11-12 20:40:35,996 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2018-11-12 20:40:35,996 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2018-11-12 20:40:35,996 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2018-11-12 20:40:35,997 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2018-11-12 20:40:35,997 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2018-11-12 20:40:35,997 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2018-11-12 20:40:35,997 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2018-11-12 20:40:35,997 INFO L425 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2018-11-12 20:40:35,997 INFO L425 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2018-11-12 20:40:35,997 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-12 20:40:35,997 INFO L425 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-11-12 20:40:35,997 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2018-11-12 20:40:35,998 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2018-11-12 20:40:35,998 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2018-11-12 20:40:35,998 INFO L425 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2018-11-12 20:40:35,998 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2018-11-12 20:40:35,998 INFO L425 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2018-11-12 20:40:35,998 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2018-11-12 20:40:35,998 INFO L425 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2018-11-12 20:40:35,998 INFO L425 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2018-11-12 20:40:35,999 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 20:40:35,999 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2018-11-12 20:40:35,999 INFO L421 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (<= 1 main_~main__cp~0)) (.cse2 (<= 1 main_~main__scheme~0)) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and .cse0 (= main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3) (and .cse0 (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse1 (not (= 0 main_~__VERIFIER_assert__cond~17)) (= main_~__VERIFIER_assert__cond~16 1) .cse2 .cse3))) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1)) [2018-11-12 20:40:35,999 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2018-11-12 20:40:35,999 INFO L425 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2018-11-12 20:40:35,999 INFO L425 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2018-11-12 20:40:35,999 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2018-11-12 20:40:35,999 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-12 20:40:36,000 INFO L421 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (<= 1 main_~main__cp~0)) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= 1 main_~main__scheme~0)) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse0 .cse1 (not (= 0 main_~__VERIFIER_assert__cond~16)) .cse2 .cse3) (and (= main_~__VERIFIER_assert__cond~2 1) .cse0 .cse1 .cse2 .cse3))) (< main_~main__cp~0 main_~main__urilen~0)) [2018-11-12 20:40:36,000 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2018-11-12 20:40:36,000 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2018-11-12 20:40:36,000 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2018-11-12 20:40:36,000 INFO L421 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (let ((.cse1 (<= 2 main_~main__cp~0)) (.cse2 (not (= 0 main_~__VERIFIER_assert__cond~7))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (not (= 0 main_~__VERIFIER_assert__cond~2))) (.cse5 (not (= 0 main_~__VERIFIER_assert__cond~5))) (.cse6 (not (= 0 main_~__VERIFIER_assert__cond~8))) (.cse7 (not (= 0 main_~__VERIFIER_assert__cond~11))) (.cse8 (= main_~__VERIFIER_assert__cond~9 1)) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (= main_~__VERIFIER_assert__cond~0 1)) (.cse11 (= main_~__VERIFIER_assert__cond~4 1)) (.cse12 (<= 1 main_~main__scheme~0)) (.cse13 (not (= 0 main_~__VERIFIER_assert__cond~6))) (.cse14 (not (= 0 main_~__VERIFIER_assert__cond~1)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 main_~__VERIFIER_assert__cond~12)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) (or (and (<= 1 main_~main__c~0) (not (= 0 main_~__VERIFIER_assert__cond~13)) .cse0) (and .cse0 (= main_~main__c~0 0))))) [2018-11-12 20:40:36,001 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2018-11-12 20:40:36,001 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-12 20:40:36,001 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2018-11-12 20:40:36,001 INFO L425 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2018-11-12 20:40:36,001 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2018-11-12 20:40:36,001 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2018-11-12 20:40:36,001 INFO L421 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= main_~__VERIFIER_assert__cond~0 1) [2018-11-12 20:40:36,001 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2018-11-12 20:40:36,002 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2018-11-12 20:40:36,002 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-12 20:40:36,002 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-12 20:40:36,002 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2018-11-12 20:40:36,002 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2018-11-12 20:40:36,002 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2018-11-12 20:40:36,002 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2018-11-12 20:40:36,002 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2018-11-12 20:40:36,003 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-11-12 20:40:36,003 INFO L425 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2018-11-12 20:40:36,003 INFO L425 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-12 20:40:36,003 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2018-11-12 20:40:36,003 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-12 20:40:36,003 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2018-11-12 20:40:36,003 INFO L425 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-11-12 20:40:36,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:40:36 BoogieIcfgContainer [2018-11-12 20:40:36,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:40:36,029 INFO L168 Benchmark]: Toolchain (without parser) took 16968.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 854.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -527.9 MB). Peak memory consumption was 326.1 MB. Max. memory is 7.1 GB. [2018-11-12 20:40:36,030 INFO L168 Benchmark]: CDTParser took 0.27 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-12 20:40:36,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.38 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-12 20:40:36,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.57 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-12 20:40:36,032 INFO L168 Benchmark]: Boogie Preprocessor took 31.26 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-12 20:40:36,032 INFO L168 Benchmark]: RCFGBuilder took 916.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -723.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-11-12 20:40:36,033 INFO L168 Benchmark]: TraceAbstraction took 15561.74 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 157.8 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 184.7 MB). Peak memory consumption was 342.5 MB. Max. memory is 7.1 GB. [2018-11-12 20:40:36,037 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.27 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 430.38 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 21.57 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 31.26 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 916.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -723.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15561.74 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 157.8 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 184.7 MB). Peak memory consumption was 342.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: 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: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((2 <= main__cp && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || (main__c == 0 && (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((2 <= main__cp && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond))))) && __VERIFIER_assert__cond == 1) || (((((2 <= main__cp && main__cp + 2 <= main__urilen) && main__c == 0) && __VERIFIER_assert__cond == 1) && ((((!(0 == __VERIFIER_assert__cond) && (((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)))) && main__cp < main__urilen - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 && (((1 <= main__c && !(0 == __VERIFIER_assert__cond)) && (((((((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((((((((((2 <= main__cp && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) || ((((((((((((((((2 <= main__cp && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((((((((((2 <= main__cp && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond))) && main__c == 0)) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond)) || ((((((__VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) && !(0 == __VERIFIER_assert__cond))) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. SAFE Result, 15.4s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1337 SDtfs, 2961 SDslu, 1868 SDs, 0 SdLazy, 1141 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 248 SyntacticMatches, 16 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 311 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 685 HoareAnnotationTreeSize, 9 FomulaSimplifications, 326253 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 80271 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 71718 SizeOfPredicates, 27 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...