java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:14:07,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:14:07,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:14:07,899 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:14:07,899 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:14:07,900 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:14:07,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:14:07,903 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:14:07,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:14:07,906 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:14:07,907 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:14:07,907 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:14:07,908 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:14:07,909 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:14:07,910 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:14:07,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:14:07,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:14:07,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:14:07,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:14:07,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:14:07,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:14:07,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:14:07,934 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:14:07,934 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:14:07,934 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:14:07,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:14:07,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:14:07,940 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:14:07,941 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:14:07,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:14:07,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:14:07,943 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:14:07,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:14:07,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:14:07,946 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:14:07,947 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:14:07,947 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:14:07,973 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:14:07,975 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:14:07,976 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:14:07,977 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:14:07,977 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:14:07,977 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:14:07,977 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:14:07,978 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:14:07,978 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:14:07,978 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:14:07,978 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:14:07,978 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:14:07,978 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:14:07,979 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:14:07,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:14:07,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:14:07,981 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:14:07,981 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:14:07,981 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:14:07,981 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:14:07,981 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:14:07,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:14:07,982 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:14:07,982 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:14:07,982 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:14:07,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:14:07,983 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:14:07,983 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:14:07,983 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:14:07,983 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:14:07,984 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:14:07,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:14:07,984 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:14:07,984 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:14:07,984 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:14:08,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:14:08,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:14:08,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:14:08,055 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:14:08,056 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:14:08,056 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-07 22:14:08,113 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982c68216/3b91b20f495d453492269287e6ab0858/FLAGf1205462c [2018-11-07 22:14:08,494 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:14:08,494 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-07 22:14:08,501 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982c68216/3b91b20f495d453492269287e6ab0858/FLAGf1205462c [2018-11-07 22:14:08,515 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982c68216/3b91b20f495d453492269287e6ab0858 [2018-11-07 22:14:08,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:14:08,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:14:08,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:14:08,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:14:08,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:14:08,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:14:08" (1/1) ... [2018-11-07 22:14:08,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5032af73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08, skipping insertion in model container [2018-11-07 22:14:08,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:14:08" (1/1) ... [2018-11-07 22:14:08,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:14:08,565 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:14:08,800 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:14:08,810 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:14:08,827 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:14:08,843 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:14:08,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08 WrapperNode [2018-11-07 22:14:08,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:14:08,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:14:08,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:14:08,844 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:14:08,851 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:14:08" (1/1) ... [2018-11-07 22:14:08,859 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:14:08" (1/1) ... [2018-11-07 22:14:08,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:14:08,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:14:08,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:14:08,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:14:08,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08" (1/1) ... [2018-11-07 22:14:08,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08" (1/1) ... [2018-11-07 22:14:08,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08" (1/1) ... [2018-11-07 22:14:08,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08" (1/1) ... [2018-11-07 22:14:08,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08" (1/1) ... [2018-11-07 22:14:08,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08" (1/1) ... [2018-11-07 22:14:08,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08" (1/1) ... [2018-11-07 22:14:08,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:14:08,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:14:08,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:14:08,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:14:08,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:14:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:14:09,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:14:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 22:14:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:14:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:14:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 22:14:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:14:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:14:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 22:14:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:14:09,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:14:09,421 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:14:09,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:09 BoogieIcfgContainer [2018-11-07 22:14:09,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:14:09,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:14:09,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:14:09,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:14:09,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:14:08" (1/3) ... [2018-11-07 22:14:09,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a23e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:14:09, skipping insertion in model container [2018-11-07 22:14:09,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:14:08" (2/3) ... [2018-11-07 22:14:09,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a23e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:14:09, skipping insertion in model container [2018-11-07 22:14:09,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:14:09" (3/3) ... [2018-11-07 22:14:09,430 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-07 22:14:09,439 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:14:09,447 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:14:09,461 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:14:09,493 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:14:09,493 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:14:09,493 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:14:09,493 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:14:09,493 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:14:09,494 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:14:09,494 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:14:09,494 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:14:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-07 22:14:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:14:09,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:09,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:09,523 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:09,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash 849314513, now seen corresponding path program 1 times [2018-11-07 22:14:09,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:09,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:09,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:09,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:09,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:09,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:14:09,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:14:09,685 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:14:09,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:14:09,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:14:09,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:14:09,704 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-07 22:14:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:09,724 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-07 22:14:09,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:14:09,725 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-07 22:14:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:09,733 INFO L225 Difference]: With dead ends: 49 [2018-11-07 22:14:09,733 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 22:14:09,736 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 22:14:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 22:14:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 22:14:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 22:14:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-07 22:14:09,771 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2018-11-07 22:14:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:09,771 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-07 22:14:09,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:14:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-07 22:14:09,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:14:09,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:09,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:09,773 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:09,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1258796197, now seen corresponding path program 1 times [2018-11-07 22:14:09,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:09,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:09,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:09,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:09,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:09,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:14:09,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:14:09,947 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:14:09,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:14:09,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:14:09,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:14:09,950 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-11-07 22:14:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:10,064 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-07 22:14:10,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:14:10,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 22:14:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:10,065 INFO L225 Difference]: With dead ends: 45 [2018-11-07 22:14:10,065 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 22:14:10,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:14:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 22:14:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-07 22:14:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 22:14:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-07 22:14:10,073 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 19 [2018-11-07 22:14:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:10,073 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-07 22:14:10,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:14:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-07 22:14:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 22:14:10,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:10,075 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:10,075 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:10,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:10,076 INFO L82 PathProgramCache]: Analyzing trace with hash 11668962, now seen corresponding path program 1 times [2018-11-07 22:14:10,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:10,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:10,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:10,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:10,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:10,528 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2018-11-07 22:14:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:10,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:10,650 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:10,651 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 22:14:10,653 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [15], [18], [20], [21], [23], [27], [31], [36], [37], [47], [50], [52], [58], [59], [60], [62] [2018-11-07 22:14:10,688 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:14:10,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:14:11,010 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:14:11,012 INFO L272 AbstractInterpreter]: Visited 22 different actions 82 times. Merged at 9 different actions 43 times. Widened at 2 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-11-07 22:14:11,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:11,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:14:11,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:11,045 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 22:14:11,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:11,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:11,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:11,237 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 11 treesize of output 8 [2018-11-07 22:14:11,240 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 8 treesize of output 7 [2018-11-07 22:14:11,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:11,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:11,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:11,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-07 22:14:11,319 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 15 treesize of output 11 [2018-11-07 22:14:11,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-07 22:14:11,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:11,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:11,339 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 22:14:11,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-07 22:14:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:11,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:11,677 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 14 treesize of output 12 [2018-11-07 22:14:11,890 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-07 22:14:11,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-11-07 22:14:11,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:11,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:11,940 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 22:14:11,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:5 [2018-11-07 22:14:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:11,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:11,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2018-11-07 22:14:11,995 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:11,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:14:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:14:11,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:14:11,997 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2018-11-07 22:14:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:12,318 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-07 22:14:12,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:14:12,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-07 22:14:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:12,321 INFO L225 Difference]: With dead ends: 42 [2018-11-07 22:14:12,321 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 22:14:12,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:14:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 22:14:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-07 22:14:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 22:14:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-07 22:14:12,331 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 23 [2018-11-07 22:14:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:12,332 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-07 22:14:12,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:14:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-07 22:14:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 22:14:12,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:12,334 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 22:14:12,334 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:12,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:12,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1730228756, now seen corresponding path program 1 times [2018-11-07 22:14:12,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:12,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:12,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:12,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:12,336 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:12,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:12,462 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:12,462 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-11-07 22:14:12,463 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [15], [18], [20], [21], [23], [27], [31], [36], [37], [39], [41], [47], [50], [52], [55], [57], [58], [59], [60], [62], [63] [2018-11-07 22:14:12,465 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:14:12,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:14:12,600 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:14:12,601 INFO L272 AbstractInterpreter]: Visited 27 different actions 109 times. Merged at 12 different actions 53 times. Widened at 3 different actions 3 times. Found 6 fixpoints after 4 different actions. Largest state had 21 variables. [2018-11-07 22:14:12,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:12,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:14:12,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:12,627 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 22:14:12,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:12,636 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:12,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:12,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:12,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:12,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-11-07 22:14:12,886 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:12,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:14:12,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:14:12,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:14:12,887 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 10 states. [2018-11-07 22:14:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:13,091 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-11-07 22:14:13,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:14:13,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-07 22:14:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:13,094 INFO L225 Difference]: With dead ends: 63 [2018-11-07 22:14:13,095 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 22:14:13,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:14:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 22:14:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-07 22:14:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 22:14:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-07 22:14:13,106 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 33 [2018-11-07 22:14:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:13,107 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-07 22:14:13,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:14:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-07 22:14:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 22:14:13,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:13,108 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-07 22:14:13,109 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:13,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash -464225189, now seen corresponding path program 2 times [2018-11-07 22:14:13,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:13,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:13,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:13,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:13,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:13,383 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:13,383 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:13,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:13,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:13,384 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 22:14:13,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:13,404 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:13,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:14:13,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:13,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:13,535 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 22:14:13,537 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 22:14:13,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:13,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:13,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:13,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-07 22:14:13,957 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 23 treesize of output 19 [2018-11-07 22:14:13,965 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:14:13,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-07 22:14:13,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:13,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:13,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:13,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-07 22:14:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:14,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:14,421 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 18 treesize of output 16 [2018-11-07 22:14:14,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2018-11-07 22:14:14,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:14,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:14,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:14,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-11-07 22:14:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:14:14,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:14,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 28 [2018-11-07 22:14:14,547 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:14,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:14:14,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:14:14,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-11-07 22:14:14,549 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 23 states. [2018-11-07 22:14:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:17,653 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-07 22:14:17,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 22:14:17,653 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-11-07 22:14:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:17,655 INFO L225 Difference]: With dead ends: 75 [2018-11-07 22:14:17,655 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 22:14:17,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=260, Invalid=1720, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:14:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 22:14:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-07 22:14:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 22:14:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-07 22:14:17,666 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 37 [2018-11-07 22:14:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:17,667 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-07 22:14:17,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:14:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-07 22:14:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 22:14:17,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:17,669 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:17,669 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:17,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:17,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1917919404, now seen corresponding path program 3 times [2018-11-07 22:14:17,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:17,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:17,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:17,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 22:14:18,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:18,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:18,137 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:18,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:18,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:18,137 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 22:14:18,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:18,146 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:18,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:18,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:18,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:18,193 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 22:14:18,196 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 22:14:18,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:18,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:18,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:14:18,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-07 22:14:25,422 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 23 treesize of output 19 [2018-11-07 22:14:25,439 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:14:25,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-07 22:14:25,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:25,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:25,446 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 22:14:25,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:3 [2018-11-07 22:14:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:14:25,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:27,596 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 20 treesize of output 18 [2018-11-07 22:14:27,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 3 [2018-11-07 22:14:27,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:27,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:27,615 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 22:14:27,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-07 22:14:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:14:27,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:27,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 20 [2018-11-07 22:14:27,660 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:27,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 22:14:27,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 22:14:27,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=325, Unknown=3, NotChecked=0, Total=380 [2018-11-07 22:14:27,662 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 19 states. [2018-11-07 22:14:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:32,344 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-07 22:14:32,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:14:32,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-11-07 22:14:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:32,346 INFO L225 Difference]: With dead ends: 70 [2018-11-07 22:14:32,346 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 22:14:32,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 87 SyntacticMatches, 14 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=108, Invalid=645, Unknown=3, NotChecked=0, Total=756 [2018-11-07 22:14:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 22:14:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-11-07 22:14:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 22:14:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-07 22:14:32,357 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 51 [2018-11-07 22:14:32,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:32,357 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-07 22:14:32,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 22:14:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-07 22:14:32,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 22:14:32,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:32,360 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:32,360 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:32,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:32,361 INFO L82 PathProgramCache]: Analyzing trace with hash -320578298, now seen corresponding path program 4 times [2018-11-07 22:14:32,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:32,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:32,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:32,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:32,362 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:14:32,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:32,542 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:32,542 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:32,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:32,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:32,543 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 22:14:32,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:32,576 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:14:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:32,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:14:32,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:14:32,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:32,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2018-11-07 22:14:32,918 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:32,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 22:14:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 22:14:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:14:32,919 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 16 states. [2018-11-07 22:14:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:33,290 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-11-07 22:14:33,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:14:33,294 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-11-07 22:14:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:33,296 INFO L225 Difference]: With dead ends: 103 [2018-11-07 22:14:33,296 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 22:14:33,299 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:14:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 22:14:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-07 22:14:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 22:14:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-11-07 22:14:33,314 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 61 [2018-11-07 22:14:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:33,314 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-11-07 22:14:33,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 22:14:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-07 22:14:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 22:14:33,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:33,321 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:33,322 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:33,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash -53672243, now seen corresponding path program 5 times [2018-11-07 22:14:33,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:33,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:33,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:14:33,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:33,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 5 proven. 69 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:14:34,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:34,360 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:34,361 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:34,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:34,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:34,361 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 22:14:34,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:14:34,369 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:14:34,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 22:14:34,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:34,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:34,475 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 22:14:34,477 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 22:14:34,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:34,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:34,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:34,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-07 22:14:35,147 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 23 treesize of output 19 [2018-11-07 22:14:35,149 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:14:35,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-07 22:14:35,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:35,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:35,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:35,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-07 22:14:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:14:35,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:14:37,544 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 18 treesize of output 16 [2018-11-07 22:14:37,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2018-11-07 22:14:37,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:37,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:37,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:37,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-11-07 22:14:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:14:37,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:14:37,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 38 [2018-11-07 22:14:37,656 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:14:37,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:14:37,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:14:37,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1240, Unknown=1, NotChecked=0, Total=1406 [2018-11-07 22:14:37,657 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 31 states. [2018-11-07 22:14:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:14:46,657 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-11-07 22:14:46,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 22:14:46,657 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 65 [2018-11-07 22:14:46,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:14:46,659 INFO L225 Difference]: With dead ends: 115 [2018-11-07 22:14:46,659 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 22:14:46,661 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 99 SyntacticMatches, 14 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=495, Invalid=3792, Unknown=3, NotChecked=0, Total=4290 [2018-11-07 22:14:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 22:14:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-11-07 22:14:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 22:14:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-11-07 22:14:46,671 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 65 [2018-11-07 22:14:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:14:46,672 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-11-07 22:14:46,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:14:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-07 22:14:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 22:14:46,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:14:46,674 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:14:46,674 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:14:46,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:14:46,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1837972794, now seen corresponding path program 6 times [2018-11-07 22:14:46,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:14:46,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:46,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:14:46,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:14:46,676 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:14:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:14:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 7 proven. 112 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 22:14:47,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:47,064 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:14:47,064 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:14:47,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:14:47,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:14:47,064 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 22:14:47,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:14:47,074 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:14:47,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:14:47,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:14:47,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:14:47,131 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 22:14:47,133 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 22:14:47,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:14:47,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:14:47,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:14:47,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-07 22:15:17,995 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 21 treesize of output 17 [2018-11-07 22:15:17,996 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:15:17,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-07 22:15:17,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:15:17,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:15:18,001 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 22:15:18,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-11-07 22:15:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:15:18,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:20,217 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 18 treesize of output 16 [2018-11-07 22:15:20,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2018-11-07 22:15:20,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:15:20,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:15:20,236 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 22:15:20,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:5 [2018-11-07 22:15:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:15:20,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:20,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 26 [2018-11-07 22:15:20,301 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:20,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 22:15:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 22:15:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=575, Unknown=5, NotChecked=0, Total=650 [2018-11-07 22:15:20,303 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 25 states. [2018-11-07 22:15:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:29,181 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2018-11-07 22:15:29,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 22:15:29,181 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-11-07 22:15:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:29,182 INFO L225 Difference]: With dead ends: 98 [2018-11-07 22:15:29,182 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 22:15:29,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 135 SyntacticMatches, 20 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=142, Invalid=1113, Unknown=5, NotChecked=0, Total=1260 [2018-11-07 22:15:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 22:15:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2018-11-07 22:15:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 22:15:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-11-07 22:15:29,194 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 79 [2018-11-07 22:15:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:29,194 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-11-07 22:15:29,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 22:15:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-11-07 22:15:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 22:15:29,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:29,196 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:29,196 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:29,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:29,197 INFO L82 PathProgramCache]: Analyzing trace with hash 843061752, now seen corresponding path program 7 times [2018-11-07 22:15:29,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:29,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:29,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:29,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:15:29,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:29,399 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:29,399 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:29,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:15:29,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:29,400 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 22:15:29,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:29,411 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:15:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:29,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:15:29,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:15:29,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:29,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2018-11-07 22:15:29,964 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:29,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 22:15:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 22:15:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-11-07 22:15:29,965 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 22 states. [2018-11-07 22:15:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:30,338 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2018-11-07 22:15:30,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:15:30,339 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 89 [2018-11-07 22:15:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:30,340 INFO L225 Difference]: With dead ends: 143 [2018-11-07 22:15:30,340 INFO L226 Difference]: Without dead ends: 98 [2018-11-07 22:15:30,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 160 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2018-11-07 22:15:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-07 22:15:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-07 22:15:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-07 22:15:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-11-07 22:15:30,353 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 89 [2018-11-07 22:15:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:30,353 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-11-07 22:15:30,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 22:15:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-11-07 22:15:30,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 22:15:30,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:30,355 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:30,355 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:30,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1323572417, now seen corresponding path program 8 times [2018-11-07 22:15:30,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:30,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:30,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:15:30,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:30,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 9 proven. 165 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 22:15:31,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:31,278 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:31,278 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:31,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:15:31,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:31,278 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 22:15:31,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:15:31,288 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:15:31,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 22:15:31,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:31,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:31,452 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 22:15:31,454 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 22:15:31,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:15:31,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:15:31,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:15:31,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-07 22:15:32,835 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 23 treesize of output 19 [2018-11-07 22:15:32,837 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:15:32,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-07 22:15:32,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:15:32,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:15:32,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:15:32,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-07 22:15:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 70 proven. 92 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:15:32,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:15:34,788 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 18 treesize of output 16 [2018-11-07 22:15:34,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2018-11-07 22:15:34,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:15:34,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:15:34,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:15:34,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-11-07 22:15:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 70 proven. 92 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 22:15:35,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:15:35,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 21] total 48 [2018-11-07 22:15:35,106 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:15:35,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:15:35,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:15:35,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2008, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 22:15:35,108 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 39 states. [2018-11-07 22:15:48,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:15:48,606 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2018-11-07 22:15:48,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 22:15:48,607 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 93 [2018-11-07 22:15:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:15:48,608 INFO L225 Difference]: With dead ends: 175 [2018-11-07 22:15:48,609 INFO L226 Difference]: Without dead ends: 114 [2018-11-07 22:15:48,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 143 SyntacticMatches, 20 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=804, Invalid=7568, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 22:15:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-07 22:15:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-11-07 22:15:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-07 22:15:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-11-07 22:15:48,623 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 93 [2018-11-07 22:15:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:15:48,623 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-11-07 22:15:48,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:15:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-11-07 22:15:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 22:15:48,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:15:48,625 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:15:48,625 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:15:48,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:15:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash -570673096, now seen corresponding path program 9 times [2018-11-07 22:15:48,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:15:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:48,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:15:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:15:48,627 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:15:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:15:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 11 proven. 228 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 22:15:49,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:49,657 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:15:49,657 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:15:49,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:15:49,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:15:49,657 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 22:15:49,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:15:49,667 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:15:49,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:15:49,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:15:49,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:15:49,774 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 22:15:49,787 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 22:15:49,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:15:49,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:15:49,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:15:49,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-07 22:16:41,797 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 21 treesize of output 17 [2018-11-07 22:16:41,822 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:16:41,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-07 22:16:41,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:16:41,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:16:41,826 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 22:16:41,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-11-07 22:16:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:16:41,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:16:45,690 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 18 treesize of output 16 [2018-11-07 22:16:45,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2018-11-07 22:16:45,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:16:45,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:16:45,706 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 22:16:45,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:5 [2018-11-07 22:16:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 12 proven. 212 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 22:16:45,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:16:45,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 32 [2018-11-07 22:16:45,756 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:16:45,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:16:45,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:16:45,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=897, Unknown=7, NotChecked=0, Total=992 [2018-11-07 22:16:45,757 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 31 states. [2018-11-07 22:16:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:16:59,138 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-11-07 22:16:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:16:59,139 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 107 [2018-11-07 22:16:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:16:59,142 INFO L225 Difference]: With dead ends: 126 [2018-11-07 22:16:59,142 INFO L226 Difference]: Without dead ends: 124 [2018-11-07 22:16:59,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 183 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 56.8s TimeCoverageRelationStatistics Valid=176, Invalid=1709, Unknown=7, NotChecked=0, Total=1892 [2018-11-07 22:16:59,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-07 22:16:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-11-07 22:16:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 22:16:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-11-07 22:16:59,155 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 107 [2018-11-07 22:16:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:16:59,156 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-11-07 22:16:59,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:16:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-11-07 22:16:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 22:16:59,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:16:59,157 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:16:59,158 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:16:59,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:16:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash 974317802, now seen corresponding path program 10 times [2018-11-07 22:16:59,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:16:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:16:59,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:16:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:16:59,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:16:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:16:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 130 proven. 136 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:16:59,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:16:59,442 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:16:59,442 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:16:59,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:16:59,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:16:59,442 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 22:16:59,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:16:59,456 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:16:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:16:59,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:16:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 168 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:16:59,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:16:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 168 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:16:59,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:16:59,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 29 [2018-11-07 22:16:59,830 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:16:59,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 22:16:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 22:16:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:16:59,832 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 28 states. [2018-11-07 22:17:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:00,271 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-11-07 22:17:00,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:17:00,272 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 117 [2018-11-07 22:17:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:00,273 INFO L225 Difference]: With dead ends: 183 [2018-11-07 22:17:00,273 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 22:17:00,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 210 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 22:17:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 22:17:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-11-07 22:17:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-07 22:17:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-11-07 22:17:00,287 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 117 [2018-11-07 22:17:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:00,287 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-11-07 22:17:00,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 22:17:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-11-07 22:17:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 22:17:00,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:00,289 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:00,289 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:00,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:00,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1644138929, now seen corresponding path program 11 times [2018-11-07 22:17:00,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:00,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:17:00,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:00,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 13 proven. 301 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:17:00,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:00,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:00,938 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:00,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:00,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:00,938 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 22:17:00,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:17:00,946 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:17:01,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 22:17:01,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:17:01,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:01,212 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 22:17:01,214 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 22:17:01,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:17:01,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:17:01,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:17:01,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-07 22:17:03,060 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 23 treesize of output 19 [2018-11-07 22:17:03,062 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:17:03,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-07 22:17:03,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:17:03,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:17:03,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:17:03,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-07 22:17:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 140 proven. 156 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:17:03,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:17:03,959 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 18 treesize of output 16 [2018-11-07 22:17:03,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2018-11-07 22:17:03,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:17:03,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:17:03,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:17:03,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-11-07 22:17:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 140 proven. 156 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:17:04,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:17:04,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 25] total 58 [2018-11-07 22:17:04,205 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:17:04,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 22:17:04,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 22:17:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2955, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 22:17:04,208 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 47 states. [2018-11-07 22:17:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:17:34,313 INFO L93 Difference]: Finished difference Result 207 states and 217 transitions. [2018-11-07 22:17:34,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 22:17:34,313 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 121 [2018-11-07 22:17:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:17:34,316 INFO L225 Difference]: With dead ends: 207 [2018-11-07 22:17:34,316 INFO L226 Difference]: Without dead ends: 154 [2018-11-07 22:17:34,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 192 SyntacticMatches, 26 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2825 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=989, Invalid=10353, Unknown=0, NotChecked=0, Total=11342 [2018-11-07 22:17:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-07 22:17:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2018-11-07 22:17:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-07 22:17:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-11-07 22:17:34,333 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 121 [2018-11-07 22:17:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:17:34,334 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-11-07 22:17:34,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 22:17:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-11-07 22:17:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 22:17:34,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:17:34,335 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:17:34,336 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:17:34,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:17:34,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1791606698, now seen corresponding path program 12 times [2018-11-07 22:17:34,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:17:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:34,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:17:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:17:34,337 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:17:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:17:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 15 proven. 384 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 22:17:34,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:34,880 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:17:34,880 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:17:34,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:17:34,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:17:34,881 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 22:17:34,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:17:34,890 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:17:34,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:17:34,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:17:34,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:17:34,935 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 22:17:34,938 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 22:17:34,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:17:34,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:17:34,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 22:17:34,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 Received shutdown request... [2018-11-07 22:18:46,795 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 22:18:46,996 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:18:46,997 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:18:47,003 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:18:47,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:18:47 BoogieIcfgContainer [2018-11-07 22:18:47,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:18:47,004 INFO L168 Benchmark]: Toolchain (without parser) took 278478.20 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 951.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.8 MB). Peak memory consumption was 157.2 MB. Max. memory is 7.1 GB. [2018-11-07 22:18:47,005 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:18:47,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:18:47,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:18:47,006 INFO L168 Benchmark]: Boogie Preprocessor took 25.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:18:47,006 INFO L168 Benchmark]: RCFGBuilder took 531.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-11-07 22:18:47,007 INFO L168 Benchmark]: TraceAbstraction took 277580.61 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 233.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -41.0 MB). Peak memory consumption was 192.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:18:47,009 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.08 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 20.65 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 25.32 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 531.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 277580.61 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 233.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -41.0 MB). Peak memory consumption was 192.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was analyzing trace of length 136 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. TIMEOUT Result, 277.5s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 84.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 909 SDslu, 5111 SDs, 0 SdLazy, 7540 SolverSat, 493 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 62.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2168 GetRequests, 1474 SyntacticMatches, 169 SemanticMatches, 525 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8520 ImplicationChecksByTransitivity, 135.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 54 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 118.0s InterpolantComputationTime, 1789 NumberOfCodeBlocks, 1783 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2627 ConstructedInterpolants, 344 QuantifiedInterpolants, 1616315 SizeOfPredicates, 104 NumberOfNonLiveVariables, 1702 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 2382/5220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown