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-EXP.epf -i ../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:26:45,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:26:45,437 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:26:45,456 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:26:45,457 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:26:45,458 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:26:45,460 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:26:45,462 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:26:45,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:26:45,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:26:45,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:26:45,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:26:45,470 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:26:45,471 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:26:45,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:26:45,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:26:45,482 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:26:45,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:26:45,486 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:26:45,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:26:45,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:26:45,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:26:45,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:26:45,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:26:45,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:26:45,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:26:45,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:26:45,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:26:45,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:26:45,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:26:45,497 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:26:45,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:26:45,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:26:45,498 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:26:45,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:26:45,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:26:45,501 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:26:45,527 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:26:45,527 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:26:45,528 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:26:45,528 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:26:45,528 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:26:45,529 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:26:45,529 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:26:45,529 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:26:45,530 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:26:45,530 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:26:45,530 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:26:45,530 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:26:45,530 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:26:45,530 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:26:45,531 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:26:45,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:26:45,532 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:26:45,533 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:26:45,533 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:26:45,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:26:45,533 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:26:45,533 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:26:45,534 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:26:45,534 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:26:45,534 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:26:45,534 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:26:45,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:26:45,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:26:45,535 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:26:45,535 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:26:45,535 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:26:45,536 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:26:45,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:26:45,536 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:26:45,536 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:26:45,536 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:26:45,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:26:45,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:26:45,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:26:45,625 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:26:45,626 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:26:45,627 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-07 10:26:45,696 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563337618/e63f3c8834cb44b79751c054e6d48c27/FLAGb9dd68806 [2018-11-07 10:26:46,140 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:26:46,141 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-07 10:26:46,148 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563337618/e63f3c8834cb44b79751c054e6d48c27/FLAGb9dd68806 [2018-11-07 10:26:46,164 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563337618/e63f3c8834cb44b79751c054e6d48c27 [2018-11-07 10:26:46,175 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:26:46,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:26:46,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:26:46,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:26:46,181 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:26:46,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49734930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46, skipping insertion in model container [2018-11-07 10:26:46,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:26:46,229 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:26:46,471 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:26:46,480 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:26:46,543 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:26:46,569 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:26:46,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46 WrapperNode [2018-11-07 10:26:46,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:26:46,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:26:46,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:26:46,571 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:26:46,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:26:46,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:26:46,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:26:46,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:26:46,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (1/1) ... [2018-11-07 10:26:46,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:26:46,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:26:46,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:26:46,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:26:46,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:26:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:26:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:26:46,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:26:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:26:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:26:46,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:26:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:26:46,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:26:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:26:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:26:46,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:26:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-07 10:26:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:26:47,781 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:26:47,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:26:47 BoogieIcfgContainer [2018-11-07 10:26:47,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:26:47,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:26:47,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:26:47,786 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:26:47,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:26:46" (1/3) ... [2018-11-07 10:26:47,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482c7760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:26:47, skipping insertion in model container [2018-11-07 10:26:47,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:26:46" (2/3) ... [2018-11-07 10:26:47,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482c7760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:26:47, skipping insertion in model container [2018-11-07 10:26:47,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:26:47" (3/3) ... [2018-11-07 10:26:47,790 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_true-unreach-call.i [2018-11-07 10:26:47,800 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:26:47,807 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:26:47,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:26:47,868 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:26:47,868 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:26:47,868 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:26:47,869 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:26:47,869 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:26:47,869 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:26:47,869 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:26:47,870 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:26:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-11-07 10:26:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-07 10:26:47,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:47,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:47,908 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:47,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:47,914 INFO L82 PathProgramCache]: Analyzing trace with hash 858599657, now seen corresponding path program 1 times [2018-11-07 10:26:47,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:47,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:47,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:48,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:48,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:26:48,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:48,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:26:48,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:26:48,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:26:48,280 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 2 states. [2018-11-07 10:26:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:48,315 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2018-11-07 10:26:48,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:26:48,317 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 84 [2018-11-07 10:26:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:48,327 INFO L225 Difference]: With dead ends: 207 [2018-11-07 10:26:48,328 INFO L226 Difference]: Without dead ends: 121 [2018-11-07 10:26:48,332 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:26:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-07 10:26:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-11-07 10:26:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-07 10:26:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-11-07 10:26:48,384 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 84 [2018-11-07 10:26:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:48,385 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-11-07 10:26:48,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:26:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-11-07 10:26:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 10:26:48,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:48,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:48,390 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:48,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1678531354, now seen corresponding path program 1 times [2018-11-07 10:26:48,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:48,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:48,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:26:48,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:26:48,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 10:26:48,601 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:48,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:26:48,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:26:48,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:26:48,605 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 4 states. [2018-11-07 10:26:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:48,834 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-11-07 10:26:48,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:26:48,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-07 10:26:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:48,841 INFO L225 Difference]: With dead ends: 207 [2018-11-07 10:26:48,841 INFO L226 Difference]: Without dead ends: 163 [2018-11-07 10:26:48,842 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 10:26:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-07 10:26:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2018-11-07 10:26:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-07 10:26:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2018-11-07 10:26:48,862 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 87 [2018-11-07 10:26:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:48,863 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2018-11-07 10:26:48,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:26:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2018-11-07 10:26:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-07 10:26:48,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:48,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:48,866 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:48,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:48,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1900720706, now seen corresponding path program 1 times [2018-11-07 10:26:48,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:48,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:48,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:48,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:48,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:26:49,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:49,164 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:49,165 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-07 10:26:49,167 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [74], [77], [79], [82], [83], [88], [92], [96], [99], [101], [105], [108], [132], [136], [140], [143], [170], [174], [179], [180], [198], [201], [203], [209], [210], [211], [213] [2018-11-07 10:26:49,212 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:26:49,212 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:26:49,548 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 10:26:49,550 INFO L272 AbstractInterpreter]: Visited 77 different actions 81 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-11-07 10:26:49,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:49,576 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 10:26:49,878 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 64.62% of their original sizes. [2018-11-07 10:26:49,878 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 10:26:50,613 INFO L415 sIntCurrentIteration]: We unified 96 AI predicates to 96 [2018-11-07 10:26:50,613 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 10:26:50,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:26:50,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-07 10:26:50,616 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:50,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:26:50,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:26:50,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:26:50,618 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 10 states. [2018-11-07 10:26:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:53,339 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2018-11-07 10:26:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:26:53,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-11-07 10:26:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:53,342 INFO L225 Difference]: With dead ends: 252 [2018-11-07 10:26:53,342 INFO L226 Difference]: Without dead ends: 200 [2018-11-07 10:26:53,343 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:26:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-07 10:26:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 160. [2018-11-07 10:26:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-07 10:26:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2018-11-07 10:26:53,369 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 97 [2018-11-07 10:26:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:53,373 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2018-11-07 10:26:53,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:26:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2018-11-07 10:26:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 10:26:53,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:53,379 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:53,379 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:53,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:53,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1848574906, now seen corresponding path program 1 times [2018-11-07 10:26:53,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:53,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:53,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:53,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:53,384 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 10:26:53,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:53,919 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:53,920 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2018-11-07 10:26:53,920 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [74], [77], [79], [82], [83], [85], [86], [88], [92], [96], [99], [101], [105], [108], [132], [136], [140], [143], [145], [146], [147], [148], [149], [150], [151], [152], [164], [166], [170], [174], [179], [180], [198], [201], [203], [209], [210], [211], [213] [2018-11-07 10:26:53,925 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:26:53,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:26:53,978 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 10:26:53,978 INFO L272 AbstractInterpreter]: Visited 85 different actions 98 times. Merged at 5 different actions 9 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 36 variables. [2018-11-07 10:26:54,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:54,017 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 10:26:54,137 INFO L227 lantSequenceWeakener]: Weakened 92 states. On average, predicates are now at 39.55% of their original sizes. [2018-11-07 10:26:54,137 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 10:26:54,790 INFO L415 sIntCurrentIteration]: We unified 128 AI predicates to 128 [2018-11-07 10:26:54,790 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 10:26:54,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:26:54,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-07 10:26:54,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:26:54,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:26:54,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:26:54,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:26:54,793 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand 13 states. [2018-11-07 10:26:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:57,288 INFO L93 Difference]: Finished difference Result 299 states and 322 transitions. [2018-11-07 10:26:57,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:26:57,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2018-11-07 10:26:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:57,291 INFO L225 Difference]: With dead ends: 299 [2018-11-07 10:26:57,291 INFO L226 Difference]: Without dead ends: 213 [2018-11-07 10:26:57,293 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:26:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-07 10:26:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 163. [2018-11-07 10:26:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-07 10:26:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2018-11-07 10:26:57,311 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 129 [2018-11-07 10:26:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:57,312 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2018-11-07 10:26:57,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:26:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2018-11-07 10:26:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 10:26:57,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:57,315 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:57,316 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:57,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:57,316 INFO L82 PathProgramCache]: Analyzing trace with hash 578995617, now seen corresponding path program 1 times [2018-11-07 10:26:57,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:57,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:57,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:57,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:57,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 10:26:57,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:57,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:57,585 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-07 10:26:57,585 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [74], [77], [79], [82], [83], [85], [86], [88], [92], [96], [99], [101], [105], [108], [110], [111], [112], [113], [114], [115], [116], [117], [126], [128], [132], [136], [140], [143], [145], [146], [147], [148], [149], [150], [151], [152], [164], [166], [170], [174], [179], [180], [198], [201], [203], [209], [210], [211], [213] [2018-11-07 10:26:57,589 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:26:57,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:26:57,689 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:26:57,690 INFO L272 AbstractInterpreter]: Visited 117 different actions 209 times. Merged at 31 different actions 80 times. Never widened. Found 8 fixpoints after 6 different actions. Largest state had 42 variables. [2018-11-07 10:26:57,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:57,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:26:57,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:57,700 INFO L194 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-07 10:26:57,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:57,711 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:26:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:57,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:26:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 10:26:58,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:26:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 10:26:58,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:26:58,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-07 10:26:58,210 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:26:58,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:26:58,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:26:58,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:26:58,212 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand 9 states. [2018-11-07 10:26:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:26:59,015 INFO L93 Difference]: Finished difference Result 329 states and 354 transitions. [2018-11-07 10:26:59,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:26:59,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2018-11-07 10:26:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:26:59,019 INFO L225 Difference]: With dead ends: 329 [2018-11-07 10:26:59,020 INFO L226 Difference]: Without dead ends: 250 [2018-11-07 10:26:59,021 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:26:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-07 10:26:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 190. [2018-11-07 10:26:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-07 10:26:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 200 transitions. [2018-11-07 10:26:59,038 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 200 transitions. Word has length 140 [2018-11-07 10:26:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:26:59,039 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 200 transitions. [2018-11-07 10:26:59,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:26:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 200 transitions. [2018-11-07 10:26:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-07 10:26:59,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:26:59,042 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:26:59,043 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:26:59,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:26:59,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1249942257, now seen corresponding path program 2 times [2018-11-07 10:26:59,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:26:59,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:59,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:26:59,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:26:59,045 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:26:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:26:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-07 10:26:59,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:59,600 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:26:59,600 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:26:59,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:26:59,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:26:59,601 INFO L194 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-07 10:26:59,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:26:59,624 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:27:11,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 10:27:11,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:27:11,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 10:27:11,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 10:27:11,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 10:27:11,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 11 [2018-11-07 10:27:11,982 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:27:11,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:27:11,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:27:11,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:27:11,984 INFO L87 Difference]: Start difference. First operand 190 states and 200 transitions. Second operand 4 states. [2018-11-07 10:27:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:12,131 INFO L93 Difference]: Finished difference Result 292 states and 311 transitions. [2018-11-07 10:27:12,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:27:12,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-11-07 10:27:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:12,133 INFO L225 Difference]: With dead ends: 292 [2018-11-07 10:27:12,134 INFO L226 Difference]: Without dead ends: 233 [2018-11-07 10:27:12,134 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:27:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-07 10:27:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 194. [2018-11-07 10:27:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-07 10:27:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 204 transitions. [2018-11-07 10:27:12,160 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 204 transitions. Word has length 150 [2018-11-07 10:27:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:12,161 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 204 transitions. [2018-11-07 10:27:12,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:27:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2018-11-07 10:27:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 10:27:12,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:12,164 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:12,165 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:12,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1339962079, now seen corresponding path program 3 times [2018-11-07 10:27:12,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:12,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:12,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:27:12,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:12,167 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 10:27:12,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:12,436 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:12,436 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:12,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:12,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:12,436 INFO L194 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-07 10:27:12,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:27:12,445 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:27:12,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:27:12,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:27:12,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-07 10:27:12,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-07 10:27:12,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:12,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-11-07 10:27:12,916 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:12,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:27:12,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:27:12,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:27:12,917 INFO L87 Difference]: Start difference. First operand 194 states and 204 transitions. Second operand 12 states. [2018-11-07 10:27:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:14,468 INFO L93 Difference]: Finished difference Result 701 states and 766 transitions. [2018-11-07 10:27:14,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 10:27:14,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-11-07 10:27:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:14,471 INFO L225 Difference]: With dead ends: 701 [2018-11-07 10:27:14,472 INFO L226 Difference]: Without dead ends: 444 [2018-11-07 10:27:14,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 345 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=476, Invalid=1330, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 10:27:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-11-07 10:27:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 279. [2018-11-07 10:27:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-07 10:27:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 296 transitions. [2018-11-07 10:27:14,492 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 296 transitions. Word has length 172 [2018-11-07 10:27:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:14,493 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 296 transitions. [2018-11-07 10:27:14,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:27:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 296 transitions. [2018-11-07 10:27:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-07 10:27:14,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:14,496 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:14,496 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:14,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:14,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1987034330, now seen corresponding path program 4 times [2018-11-07 10:27:14,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:14,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:14,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:27:14,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:14,498 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2018-11-07 10:27:14,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:14,875 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:14,875 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:14,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:14,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:14,876 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:27:14,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:14,885 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:27:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:14,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2018-11-07 10:27:15,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2018-11-07 10:27:15,332 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:27:15,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 15 [2018-11-07 10:27:15,333 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:27:15,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:27:15,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:27:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:27:15,335 INFO L87 Difference]: Start difference. First operand 279 states and 296 transitions. Second operand 6 states. [2018-11-07 10:27:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:15,867 INFO L93 Difference]: Finished difference Result 486 states and 521 transitions. [2018-11-07 10:27:15,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:27:15,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2018-11-07 10:27:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:15,871 INFO L225 Difference]: With dead ends: 486 [2018-11-07 10:27:15,871 INFO L226 Difference]: Without dead ends: 295 [2018-11-07 10:27:15,873 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:27:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-07 10:27:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 274. [2018-11-07 10:27:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-07 10:27:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 289 transitions. [2018-11-07 10:27:15,888 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 289 transitions. Word has length 237 [2018-11-07 10:27:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:15,888 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 289 transitions. [2018-11-07 10:27:15,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:27:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 289 transitions. [2018-11-07 10:27:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-07 10:27:15,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:15,892 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:15,892 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:15,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:15,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1037656774, now seen corresponding path program 5 times [2018-11-07 10:27:15,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:15,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:15,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:15,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:15,894 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2018-11-07 10:27:16,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:16,107 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:16,107 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:16,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:16,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:16,107 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:27:16,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:27:16,118 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:27:34,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:27:34,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:27:34,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-11-07 10:27:35,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-11-07 10:27:35,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:35,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2018-11-07 10:27:35,159 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:35,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:27:35,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:27:35,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:27:35,160 INFO L87 Difference]: Start difference. First operand 274 states and 289 transitions. Second operand 12 states. [2018-11-07 10:27:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:35,606 INFO L93 Difference]: Finished difference Result 565 states and 606 transitions. [2018-11-07 10:27:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:27:35,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 237 [2018-11-07 10:27:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:35,609 INFO L225 Difference]: With dead ends: 565 [2018-11-07 10:27:35,610 INFO L226 Difference]: Without dead ends: 384 [2018-11-07 10:27:35,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:27:35,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-07 10:27:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 325. [2018-11-07 10:27:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-07 10:27:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 343 transitions. [2018-11-07 10:27:35,630 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 343 transitions. Word has length 237 [2018-11-07 10:27:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:35,630 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 343 transitions. [2018-11-07 10:27:35,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:27:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 343 transitions. [2018-11-07 10:27:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-07 10:27:35,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:35,632 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:35,633 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:35,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1240309558, now seen corresponding path program 6 times [2018-11-07 10:27:35,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:35,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:27:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:35,634 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 226 proven. 15 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2018-11-07 10:27:35,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:35,827 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:35,828 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:35,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:35,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:35,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:27:35,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:27:35,840 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:27:35,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:27:35,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:27:35,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 49 proven. 231 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-11-07 10:27:36,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 49 proven. 231 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-11-07 10:27:36,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:36,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 16 [2018-11-07 10:27:36,317 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:36,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:27:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:27:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:27:36,318 INFO L87 Difference]: Start difference. First operand 325 states and 343 transitions. Second operand 13 states. [2018-11-07 10:27:36,721 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-07 10:27:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:37,210 INFO L93 Difference]: Finished difference Result 657 states and 704 transitions. [2018-11-07 10:27:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:27:37,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 280 [2018-11-07 10:27:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:37,213 INFO L225 Difference]: With dead ends: 657 [2018-11-07 10:27:37,214 INFO L226 Difference]: Without dead ends: 465 [2018-11-07 10:27:37,215 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 547 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:27:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-11-07 10:27:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 400. [2018-11-07 10:27:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-07 10:27:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 423 transitions. [2018-11-07 10:27:37,236 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 423 transitions. Word has length 280 [2018-11-07 10:27:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:37,237 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 423 transitions. [2018-11-07 10:27:37,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:27:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 423 transitions. [2018-11-07 10:27:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-07 10:27:37,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:37,239 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:37,240 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:37,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash -454104267, now seen corresponding path program 7 times [2018-11-07 10:27:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:37,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:27:37,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:37,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 462 proven. 39 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2018-11-07 10:27:37,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:37,857 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:37,857 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:37,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:37,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:37,858 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:27:37,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:37,868 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:27:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:37,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:27:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 462 proven. 39 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2018-11-07 10:27:38,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:27:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 462 proven. 39 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2018-11-07 10:27:38,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:27:38,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-07 10:27:38,455 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:27:38,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:27:38,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:27:38,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:27:38,456 INFO L87 Difference]: Start difference. First operand 400 states and 423 transitions. Second operand 11 states. [2018-11-07 10:27:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:27:38,552 INFO L93 Difference]: Finished difference Result 792 states and 848 transitions. [2018-11-07 10:27:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:27:38,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 335 [2018-11-07 10:27:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:27:38,556 INFO L225 Difference]: With dead ends: 792 [2018-11-07 10:27:38,556 INFO L226 Difference]: Without dead ends: 540 [2018-11-07 10:27:38,557 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:27:38,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-11-07 10:27:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 475. [2018-11-07 10:27:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-11-07 10:27:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 503 transitions. [2018-11-07 10:27:38,580 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 503 transitions. Word has length 335 [2018-11-07 10:27:38,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:27:38,581 INFO L480 AbstractCegarLoop]: Abstraction has 475 states and 503 transitions. [2018-11-07 10:27:38,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:27:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 503 transitions. [2018-11-07 10:27:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-11-07 10:27:38,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:27:38,584 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:27:38,585 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:27:38,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:27:38,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1945752214, now seen corresponding path program 8 times [2018-11-07 10:27:38,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:27:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:38,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:27:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:27:38,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:27:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:27:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 786 proven. 74 refuted. 0 times theorem prover too weak. 1585 trivial. 0 not checked. [2018-11-07 10:27:39,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:39,413 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:27:39,413 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:27:39,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:27:39,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:27:39,414 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:27:39,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:27:39,432 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:28:11,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 10:28:11,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:28:11,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2406 trivial. 0 not checked. [2018-11-07 10:28:11,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2406 trivial. 0 not checked. [2018-11-07 10:28:12,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:12,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2018-11-07 10:28:12,151 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:12,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 10:28:12,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 10:28:12,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:28:12,153 INFO L87 Difference]: Start difference. First operand 475 states and 503 transitions. Second operand 12 states. [2018-11-07 10:28:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:13,159 INFO L93 Difference]: Finished difference Result 971 states and 1041 transitions. [2018-11-07 10:28:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 10:28:13,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 390 [2018-11-07 10:28:13,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:13,162 INFO L225 Difference]: With dead ends: 971 [2018-11-07 10:28:13,162 INFO L226 Difference]: Without dead ends: 659 [2018-11-07 10:28:13,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=572, Invalid=1068, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:28:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-07 10:28:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 561. [2018-11-07 10:28:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-07 10:28:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 594 transitions. [2018-11-07 10:28:13,193 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 594 transitions. Word has length 390 [2018-11-07 10:28:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:13,194 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 594 transitions. [2018-11-07 10:28:13,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 10:28:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 594 transitions. [2018-11-07 10:28:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-11-07 10:28:13,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:13,198 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:28:13,199 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:13,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1620014963, now seen corresponding path program 9 times [2018-11-07 10:28:13,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:13,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:28:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:13,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 1198 proven. 120 refuted. 0 times theorem prover too weak. 2422 trivial. 0 not checked. [2018-11-07 10:28:14,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:14,037 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:14,037 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:14,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:14,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:14,037 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:14,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:28:14,046 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:28:14,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:28:14,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:28:14,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 84 proven. 1080 refuted. 0 times theorem prover too weak. 2576 trivial. 0 not checked. [2018-11-07 10:28:14,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 84 proven. 1080 refuted. 0 times theorem prover too weak. 2576 trivial. 0 not checked. [2018-11-07 10:28:14,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:14,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 25 [2018-11-07 10:28:14,944 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:14,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 10:28:14,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 10:28:14,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:28:14,945 INFO L87 Difference]: Start difference. First operand 561 states and 594 transitions. Second operand 20 states. [2018-11-07 10:28:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:16,811 INFO L93 Difference]: Finished difference Result 1243 states and 1332 transitions. [2018-11-07 10:28:16,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 10:28:16,812 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 456 [2018-11-07 10:28:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:16,816 INFO L225 Difference]: With dead ends: 1243 [2018-11-07 10:28:16,816 INFO L226 Difference]: Without dead ends: 860 [2018-11-07 10:28:16,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 971 GetRequests, 896 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1167, Invalid=3803, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 10:28:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-11-07 10:28:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 647. [2018-11-07 10:28:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-11-07 10:28:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 685 transitions. [2018-11-07 10:28:16,850 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 685 transitions. Word has length 456 [2018-11-07 10:28:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:16,850 INFO L480 AbstractCegarLoop]: Abstraction has 647 states and 685 transitions. [2018-11-07 10:28:16,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 10:28:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 685 transitions. [2018-11-07 10:28:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-11-07 10:28:16,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:16,855 INFO L375 BasicCegarLoop]: trace histogram [35, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:28:16,855 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:16,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash 480769418, now seen corresponding path program 10 times [2018-11-07 10:28:16,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:16,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:28:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:16,857 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5321 backedges. 1698 proven. 177 refuted. 0 times theorem prover too weak. 3446 trivial. 0 not checked. [2018-11-07 10:28:17,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:17,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:17,668 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:17,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:17,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:17,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:17,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:17,677 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:28:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:17,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5321 backedges. 1698 proven. 177 refuted. 0 times theorem prover too weak. 3446 trivial. 0 not checked. [2018-11-07 10:28:19,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5321 backedges. 1698 proven. 177 refuted. 0 times theorem prover too weak. 3446 trivial. 0 not checked. [2018-11-07 10:28:19,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:19,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-11-07 10:28:19,804 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:19,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:28:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:28:19,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:28:19,806 INFO L87 Difference]: Start difference. First operand 647 states and 685 transitions. Second operand 17 states. [2018-11-07 10:28:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:28:20,040 INFO L93 Difference]: Finished difference Result 1241 states and 1324 transitions. [2018-11-07 10:28:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:28:20,040 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 522 [2018-11-07 10:28:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:28:20,045 INFO L225 Difference]: With dead ends: 1241 [2018-11-07 10:28:20,045 INFO L226 Difference]: Without dead ends: 787 [2018-11-07 10:28:20,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 1030 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:28:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-07 10:28:20,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 722. [2018-11-07 10:28:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-11-07 10:28:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 765 transitions. [2018-11-07 10:28:20,088 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 765 transitions. Word has length 522 [2018-11-07 10:28:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:28:20,089 INFO L480 AbstractCegarLoop]: Abstraction has 722 states and 765 transitions. [2018-11-07 10:28:20,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:28:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 765 transitions. [2018-11-07 10:28:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-11-07 10:28:20,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:28:20,096 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:28:20,096 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:28:20,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:28:20,097 INFO L82 PathProgramCache]: Analyzing trace with hash 922252597, now seen corresponding path program 11 times [2018-11-07 10:28:20,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:28:20,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:20,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:28:20,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:28:20,098 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:28:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:28:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7131 backedges. 2286 proven. 245 refuted. 0 times theorem prover too weak. 4600 trivial. 0 not checked. [2018-11-07 10:28:20,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:20,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:28:20,702 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:28:20,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:28:20,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:28:20,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:28:20,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:28:20,712 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:28:58,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:28:58,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:28:58,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:28:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7131 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7011 trivial. 0 not checked. [2018-11-07 10:28:58,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:28:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7131 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7011 trivial. 0 not checked. [2018-11-07 10:28:59,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:28:59,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2018-11-07 10:28:59,221 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:28:59,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:28:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:28:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:28:59,223 INFO L87 Difference]: Start difference. First operand 722 states and 765 transitions. Second operand 17 states. [2018-11-07 10:29:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:01,387 INFO L93 Difference]: Finished difference Result 1716 states and 1839 transitions. [2018-11-07 10:29:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 10:29:01,387 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 577 [2018-11-07 10:29:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:01,393 INFO L225 Difference]: With dead ends: 1716 [2018-11-07 10:29:01,393 INFO L226 Difference]: Without dead ends: 1202 [2018-11-07 10:29:01,397 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1142 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2020, Invalid=4142, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 10:29:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-11-07 10:29:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 808. [2018-11-07 10:29:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-07 10:29:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 856 transitions. [2018-11-07 10:29:01,436 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 856 transitions. Word has length 577 [2018-11-07 10:29:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:01,437 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 856 transitions. [2018-11-07 10:29:01,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:29:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 856 transitions. [2018-11-07 10:29:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2018-11-07 10:29:01,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:01,443 INFO L375 BasicCegarLoop]: trace histogram [45, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:01,443 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:01,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash 319324606, now seen corresponding path program 12 times [2018-11-07 10:29:01,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:01,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:01,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:01,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9273 backedges. 2962 proven. 324 refuted. 0 times theorem prover too weak. 5987 trivial. 0 not checked. [2018-11-07 10:29:02,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:02,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:02,076 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:02,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:02,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:02,077 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:02,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:29:02,087 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:29:02,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:29:02,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:02,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9273 backedges. 255 proven. 2848 refuted. 0 times theorem prover too weak. 6170 trivial. 0 not checked. [2018-11-07 10:29:02,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9273 backedges. 255 proven. 2848 refuted. 0 times theorem prover too weak. 6170 trivial. 0 not checked. [2018-11-07 10:29:03,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:03,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 37 [2018-11-07 10:29:03,537 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:03,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 10:29:03,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 10:29:03,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 10:29:03,540 INFO L87 Difference]: Start difference. First operand 808 states and 856 transitions. Second operand 28 states. [2018-11-07 10:29:04,892 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-11-07 10:29:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:07,673 INFO L93 Difference]: Finished difference Result 2069 states and 2218 transitions. [2018-11-07 10:29:07,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-11-07 10:29:07,674 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 643 [2018-11-07 10:29:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:07,682 INFO L225 Difference]: With dead ends: 2069 [2018-11-07 10:29:07,682 INFO L226 Difference]: Without dead ends: 1484 [2018-11-07 10:29:07,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1262 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4503 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3045, Invalid=11961, Unknown=0, NotChecked=0, Total=15006 [2018-11-07 10:29:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-11-07 10:29:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 894. [2018-11-07 10:29:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-07 10:29:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 947 transitions. [2018-11-07 10:29:07,741 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 947 transitions. Word has length 643 [2018-11-07 10:29:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:07,742 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 947 transitions. [2018-11-07 10:29:07,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 10:29:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 947 transitions. [2018-11-07 10:29:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-11-07 10:29:07,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:07,750 INFO L375 BasicCegarLoop]: trace histogram [50, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:07,750 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:07,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1758994133, now seen corresponding path program 13 times [2018-11-07 10:29:07,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:07,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:29:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:07,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11701 backedges. 3726 proven. 414 refuted. 0 times theorem prover too weak. 7561 trivial. 0 not checked. [2018-11-07 10:29:08,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:08,822 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:08,822 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:08,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:08,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:08,822 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:08,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:08,837 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:29:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:09,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11701 backedges. 3726 proven. 414 refuted. 0 times theorem prover too weak. 7561 trivial. 0 not checked. [2018-11-07 10:29:09,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:29:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11701 backedges. 3726 proven. 414 refuted. 0 times theorem prover too weak. 7561 trivial. 0 not checked. [2018-11-07 10:29:09,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:29:09,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2018-11-07 10:29:09,986 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:29:09,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 10:29:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 10:29:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=635, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:29:09,988 INFO L87 Difference]: Start difference. First operand 894 states and 947 transitions. Second operand 23 states. [2018-11-07 10:29:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:10,243 INFO L93 Difference]: Finished difference Result 1690 states and 1800 transitions. [2018-11-07 10:29:10,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:29:10,243 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 709 [2018-11-07 10:29:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:10,248 INFO L225 Difference]: With dead ends: 1690 [2018-11-07 10:29:10,248 INFO L226 Difference]: Without dead ends: 1034 [2018-11-07 10:29:10,249 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1430 GetRequests, 1398 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=487, Invalid=635, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:29:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2018-11-07 10:29:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 969. [2018-11-07 10:29:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-11-07 10:29:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1027 transitions. [2018-11-07 10:29:10,294 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1027 transitions. Word has length 709 [2018-11-07 10:29:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:10,294 INFO L480 AbstractCegarLoop]: Abstraction has 969 states and 1027 transitions. [2018-11-07 10:29:10,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 10:29:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1027 transitions. [2018-11-07 10:29:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2018-11-07 10:29:10,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:10,301 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:10,301 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:10,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:10,302 INFO L82 PathProgramCache]: Analyzing trace with hash -780359094, now seen corresponding path program 14 times [2018-11-07 10:29:10,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:10,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:10,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:10,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:10,303 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14336 backedges. 4578 proven. 515 refuted. 0 times theorem prover too weak. 9243 trivial. 0 not checked. [2018-11-07 10:29:10,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:10,874 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:29:10,874 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:29:10,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:29:10,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:29:10,874 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:29:10,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:29:10,883 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:29:51,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:29:51,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:29:51,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:29:51,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-07 10:29:51,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-07 10:29:51,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:51,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:51,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:51,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-07 10:29:51,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-07 10:29:51,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:51,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-07 10:29:51,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:51,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:51,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:51,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-07 10:29:51,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-07 10:29:51,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:51,942 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-11-07 10:29:51,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 45 [2018-11-07 10:29:51,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 10:29:52,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 10:29:52,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 10:29:52,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:75 [2018-11-07 10:29:52,328 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-07 10:29:52,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-11-07 10:29:52,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:52,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 65 [2018-11-07 10:29:52,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-07 10:29:52,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 10:29:52,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-11-07 10:29:52,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:52,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-07 10:29:52,678 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:52,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:52,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-07 10:29:52,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:94 [2018-11-07 10:29:53,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2018-11-07 10:29:53,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:53,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:53,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:53,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 67 [2018-11-07 10:29:53,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:53,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:53,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-11-07 10:29:53,423 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:53,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:53,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:53,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 67 [2018-11-07 10:29:53,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:53,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:53,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 10:29:53,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:125 [2018-11-07 10:29:54,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2018-11-07 10:29:54,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:54,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:54,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:55,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:55,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:29:55,115 INFO L303 Elim1Store]: Index analysis took 185 ms [2018-11-07 10:29:55,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2018-11-07 10:29:55,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 10:29:55,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:55,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 10:29:55,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:3 [2018-11-07 10:29:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14336 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2018-11-07 10:29:59,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:30:11,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-11-07 10:30:11,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 48 [2018-11-07 10:30:11,616 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:11,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-11-07 10:30:11,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:11,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 79 [2018-11-07 10:30:11,762 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:11,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2018-11-07 10:30:11,963 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-11-07 10:30:12,010 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:12,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2018-11-07 10:30:12,071 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 10:30:12,074 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:12,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2018-11-07 10:30:12,077 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:12,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 10:30:12,143 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:12,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 98 [2018-11-07 10:30:12,726 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2018-11-07 10:30:12,730 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 10:30:12,730 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:12,733 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:12,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:12,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:12,739 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:12,741 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:12,743 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:12,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 10:30:12,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-07 10:30:12,747 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:13,040 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:13,042 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:13,056 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:13,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 104 [2018-11-07 10:30:13,105 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-07 10:30:13,115 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:13,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:13,119 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:13,119 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:13,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-11-07 10:30:13,120 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-07 10:30:13,244 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:13,247 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 10:30:13,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 81 [2018-11-07 10:30:13,272 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-07 10:30:13,362 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 10:30:13,520 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 10:30:13,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 10:30:13,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 10:30:13,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 10:30:13,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-07 10:30:13,747 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:67, output treesize:146 [2018-11-07 10:30:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 14336 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2018-11-07 10:30:15,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:30:15,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 20] total 50 [2018-11-07 10:30:15,386 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:30:15,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 10:30:15,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 10:30:15,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2121, Unknown=5, NotChecked=0, Total=2450 [2018-11-07 10:30:15,388 INFO L87 Difference]: Start difference. First operand 969 states and 1027 transitions. Second operand 33 states. [2018-11-07 10:30:17,144 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2018-11-07 10:30:17,623 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2018-11-07 10:30:17,877 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2018-11-07 10:30:18,120 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2018-11-07 10:30:22,351 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2018-11-07 10:30:25,328 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-11-07 10:30:25,604 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-11-07 10:30:26,207 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-11-07 10:30:30,423 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-11-07 10:30:34,550 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-11-07 10:30:38,854 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 10:30:43,054 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 10:30:47,362 WARN L179 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 10:30:51,525 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 10:30:55,696 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 10:30:59,879 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 10:31:04,077 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 Received shutdown request... [2018-11-07 10:31:06,274 WARN L187 SmtUtils]: Removed 9 from assertion stack [2018-11-07 10:31:06,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-07 10:31:06,275 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:31:06,280 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:31:06,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:31:06 BoogieIcfgContainer [2018-11-07 10:31:06,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:31:06,282 INFO L168 Benchmark]: Toolchain (without parser) took 260106.00 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -718.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 10:31:06,282 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:31:06,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:31:06,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:31:06,284 INFO L168 Benchmark]: Boogie Preprocessor took 58.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:31:06,284 INFO L168 Benchmark]: RCFGBuilder took 1119.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2018-11-07 10:31:06,285 INFO L168 Benchmark]: TraceAbstraction took 258498.24 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 10:31:06,288 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 392.65 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 32.59 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 58.07 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 1119.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 258498.24 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (969states) and FLOYD_HOARE automaton (currently 82 states, 33 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. TIMEOUT Result, 258.4s OverallTime, 18 OverallIterations, 55 TraceHistogramMax, 70.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2077 SDtfs, 23788 SDslu, 13102 SDs, 0 SdLazy, 5441 SolverSat, 1934 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 11923 GetRequests, 11257 SyntacticMatches, 25 SemanticMatches, 640 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13695 ImplicationChecksByTransitivity, 76.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=969occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9857605833708776 AbsIntWeakeningRatio, 0.32589285714285715 AbsIntAvgWeakeningVarsNumRemoved, 4.611607142857143 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 2027 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 142.3s SatisfiabilityAnalysisTime, 39.4s InterpolantComputationTime, 11621 NumberOfCodeBlocks, 10209 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 17187 ConstructedInterpolants, 677 QuantifiedInterpolants, 57198952 SizeOfPredicates, 52 NumberOfNonLiveVariables, 7170 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 46 InterpolantComputations, 5 PerfectInterpolantSequences, 159697/171873 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown