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/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 21:59:52,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 21:59:52,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 21:59:52,874 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 21:59:52,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 21:59:52,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 21:59:52,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 21:59:52,882 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 21:59:52,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 21:59:52,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 21:59:52,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 21:59:52,885 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 21:59:52,886 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 21:59:52,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 21:59:52,890 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 21:59:52,891 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 21:59:52,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 21:59:52,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 21:59:52,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 21:59:52,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 21:59:52,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 21:59:52,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 21:59:52,911 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 21:59:52,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 21:59:52,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 21:59:52,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 21:59:52,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 21:59:52,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 21:59:52,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 21:59:52,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 21:59:52,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 21:59:52,921 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 21:59:52,921 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 21:59:52,921 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 21:59:52,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 21:59:52,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 21:59:52,926 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 21:59:52,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 21:59:52,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 21:59:52,954 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 21:59:52,954 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 21:59:52,954 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 21:59:52,955 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 21:59:52,955 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 21:59:52,955 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 21:59:52,955 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 21:59:52,955 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 21:59:52,955 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 21:59:52,956 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 21:59:52,956 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 21:59:52,957 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 21:59:52,957 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 21:59:52,957 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 21:59:52,957 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 21:59:52,957 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 21:59:52,957 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 21:59:52,958 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 21:59:52,958 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 21:59:52,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 21:59:52,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 21:59:52,958 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 21:59:52,959 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 21:59:52,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 21:59:52,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 21:59:52,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 21:59:52,959 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 21:59:52,960 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 21:59:52,960 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 21:59:52,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 21:59:52,960 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 21:59:52,960 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 21:59:52,961 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 21:59:53,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 21:59:53,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 21:59:53,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 21:59:53,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 21:59:53,040 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 21:59:53,041 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-07 21:59:53,098 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6138af555/03be0b145bad40dea5f7702843e1c07f/FLAG6530a0e5e [2018-11-07 21:59:53,524 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 21:59:53,525 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-07 21:59:53,531 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6138af555/03be0b145bad40dea5f7702843e1c07f/FLAG6530a0e5e [2018-11-07 21:59:53,544 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6138af555/03be0b145bad40dea5f7702843e1c07f [2018-11-07 21:59:53,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 21:59:53,555 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 21:59:53,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 21:59:53,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 21:59:53,560 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 21:59:53,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56927dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53, skipping insertion in model container [2018-11-07 21:59:53,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 21:59:53,605 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 21:59:53,847 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 21:59:53,853 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 21:59:53,872 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 21:59:53,889 INFO L193 MainTranslator]: Completed translation [2018-11-07 21:59:53,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53 WrapperNode [2018-11-07 21:59:53,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 21:59:53,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 21:59:53,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 21:59:53,891 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 21:59:53,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 21:59:53,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 21:59:53,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 21:59:53,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 21:59:53,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (1/1) ... [2018-11-07 21:59:53,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 21:59:53,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 21:59:53,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 21:59:53,942 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 21:59:53,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (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 21:59:54,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 21:59:54,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 21:59:54,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 21:59:54,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 21:59:54,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 21:59:54,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 21:59:54,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 21:59:54,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 21:59:54,296 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 21:59:54,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:59:54 BoogieIcfgContainer [2018-11-07 21:59:54,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 21:59:54,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 21:59:54,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 21:59:54,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 21:59:54,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:59:53" (1/3) ... [2018-11-07 21:59:54,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4277d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:59:54, skipping insertion in model container [2018-11-07 21:59:54,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:59:53" (2/3) ... [2018-11-07 21:59:54,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4277d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:59:54, skipping insertion in model container [2018-11-07 21:59:54,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:59:54" (3/3) ... [2018-11-07 21:59:54,304 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-07 21:59:54,315 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 21:59:54,324 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 21:59:54,353 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 21:59:54,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 21:59:54,434 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 21:59:54,434 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 21:59:54,435 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 21:59:54,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 21:59:54,435 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 21:59:54,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 21:59:54,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 21:59:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 21:59:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 21:59:54,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:59:54,469 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:59:54,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:59:54,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:59:54,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-07 21:59:54,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:59:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:54,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:59:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:54,523 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:59:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:59:54,596 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 21:59:54,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:59:54,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 21:59:54,599 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:59:54,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 21:59:54,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 21:59:54,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 21:59:54,623 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 21:59:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:59:54,644 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-07 21:59:54,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 21:59:54,646 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 21:59:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:59:54,654 INFO L225 Difference]: With dead ends: 31 [2018-11-07 21:59:54,655 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 21:59:54,658 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 21:59:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 21:59:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 21:59:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 21:59:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-07 21:59:54,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-07 21:59:54,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:59:54,700 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-07 21:59:54,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 21:59:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-07 21:59:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 21:59:54,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:59:54,701 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:59:54,701 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:59:54,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:59:54,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1143179357, now seen corresponding path program 1 times [2018-11-07 21:59:54,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:59:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:54,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:59:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:54,704 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:59:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:59:54,826 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 21:59:54,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:59:54,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 21:59:54,827 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:59:54,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 21:59:54,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 21:59:54,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 21:59:54,830 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-07 21:59:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:59:54,919 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-07 21:59:54,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 21:59:54,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-07 21:59:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:59:54,921 INFO L225 Difference]: With dead ends: 21 [2018-11-07 21:59:54,922 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 21:59:54,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 21:59:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 21:59:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 21:59:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 21:59:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-07 21:59:54,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-07 21:59:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:59:54,929 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-07 21:59:54,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 21:59:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-07 21:59:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 21:59:54,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:59:54,930 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:59:54,931 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:59:54,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:59:54,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1652058138, now seen corresponding path program 1 times [2018-11-07 21:59:54,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:59:54,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:54,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:59:54,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:54,933 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:59:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:59:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:59:54,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:59:54,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 21:59:54,999 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:59:55,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 21:59:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 21:59:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 21:59:55,001 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-07 21:59:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:59:55,044 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-07 21:59:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 21:59:55,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-07 21:59:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:59:55,045 INFO L225 Difference]: With dead ends: 27 [2018-11-07 21:59:55,045 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 21:59:55,046 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 21:59:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 21:59:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-07 21:59:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-07 21:59:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-07 21:59:55,050 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-11-07 21:59:55,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:59:55,051 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-07 21:59:55,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 21:59:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-07 21:59:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 21:59:55,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:59:55,052 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:59:55,052 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:59:55,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:59:55,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1833562532, now seen corresponding path program 1 times [2018-11-07 21:59:55,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:59:55,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:55,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:59:55,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:55,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:59:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:59:55,413 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-11-07 21:59:55,581 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-11-07 21:59:55,639 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 21:59:55,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:59:55,639 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:59:55,640 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-11-07 21:59:55,642 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [13], [18], [20], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 21:59:55,678 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:59:55,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:59:55,805 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:59:56,083 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:59:56,084 INFO L272 AbstractInterpreter]: Visited 14 different actions 76 times. Merged at 5 different actions 35 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-07 21:59:56,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:59:56,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:59:56,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:59:56,132 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 21:59:56,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:59:56,149 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:59:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:59:56,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:59:56,529 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 21:59:56,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:59:56,811 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 21:59:56,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:59:56,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2018-11-07 21:59:56,834 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:59:56,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 21:59:56,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 21:59:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-07 21:59:56,836 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 12 states. [2018-11-07 21:59:57,225 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-07 21:59:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:59:57,474 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-07 21:59:57,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 21:59:57,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-11-07 21:59:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:59:57,476 INFO L225 Difference]: With dead ends: 30 [2018-11-07 21:59:57,476 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 21:59:57,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-11-07 21:59:57,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 21:59:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 21:59:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 21:59:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-07 21:59:57,483 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2018-11-07 21:59:57,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:59:57,483 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-07 21:59:57,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 21:59:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-07 21:59:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 21:59:57,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:59:57,485 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:59:57,485 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:59:57,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:59:57,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1892022867, now seen corresponding path program 1 times [2018-11-07 21:59:57,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:59:57,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:57,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:59:57,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:57,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:59:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:59:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:59:57,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:59:57,548 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:59:57,548 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-07 21:59:57,548 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [13], [16], [18], [20], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 21:59:57,550 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:59:57,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:59:57,554 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:59:57,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:59:57,704 INFO L272 AbstractInterpreter]: Visited 15 different actions 95 times. Merged at 6 different actions 41 times. Widened at 1 different actions 3 times. Found 7 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-07 21:59:57,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:59:57,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:59:57,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:59:57,747 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 21:59:57,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:59:57,759 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:59:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:59:57,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:59:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:59:57,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:59:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:59:57,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:59:57,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2018-11-07 21:59:57,866 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:59:57,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 21:59:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 21:59:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-07 21:59:57,867 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2018-11-07 21:59:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:59:57,911 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-07 21:59:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 21:59:57,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-07 21:59:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:59:57,913 INFO L225 Difference]: With dead ends: 33 [2018-11-07 21:59:57,913 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 21:59:57,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-07 21:59:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 21:59:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 21:59:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 21:59:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-07 21:59:57,919 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2018-11-07 21:59:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:59:57,919 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-07 21:59:57,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 21:59:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-07 21:59:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 21:59:57,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:59:57,921 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:59:57,921 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:59:57,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:59:57,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1658992628, now seen corresponding path program 2 times [2018-11-07 21:59:57,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:59:57,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:57,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:59:57,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:57,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:59:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:59:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:59:57,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:59:57,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:59:57,975 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 21:59:57,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 21:59:57,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:59:57,976 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 21:59:57,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 21:59:57,987 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 21:59:58,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 21:59:58,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 21:59:58,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:59:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:59:58,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:59:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:59:58,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:59:58,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-11-07 21:59:58,090 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:59:58,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 21:59:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 21:59:58,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-07 21:59:58,092 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2018-11-07 21:59:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:59:58,141 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-07 21:59:58,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 21:59:58,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-07 21:59:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:59:58,143 INFO L225 Difference]: With dead ends: 35 [2018-11-07 21:59:58,143 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 21:59:58,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-07 21:59:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 21:59:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-07 21:59:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 21:59:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-07 21:59:58,150 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-11-07 21:59:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:59:58,150 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-07 21:59:58,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 21:59:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-07 21:59:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 21:59:58,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:59:58,152 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:59:58,152 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:59:58,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:59:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash 849646002, now seen corresponding path program 2 times [2018-11-07 21:59:58,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:59:58,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:58,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 21:59:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:58,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:59:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:59:58,493 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-11-07 21:59:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 21:59:58,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:59:58,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:59:58,611 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 21:59:58,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 21:59:58,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:59:58,611 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 21:59:58,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 21:59:58,620 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 21:59:58,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 21:59:58,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 21:59:58,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:59:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:59:58,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:59:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:59:59,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:59:59,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 27 [2018-11-07 21:59:59,316 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:59:59,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 21:59:59,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 21:59:59,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-11-07 21:59:59,318 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 17 states. [2018-11-07 21:59:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:59:59,912 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-07 21:59:59,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 21:59:59,912 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-07 21:59:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:59:59,913 INFO L225 Difference]: With dead ends: 38 [2018-11-07 21:59:59,913 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 21:59:59,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 21:59:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 21:59:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-11-07 21:59:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-07 21:59:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-07 21:59:59,919 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 23 [2018-11-07 21:59:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:59:59,919 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-07 21:59:59,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 21:59:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-07 21:59:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 21:59:59,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:59:59,921 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:59:59,921 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:59:59,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:59:59,921 INFO L82 PathProgramCache]: Analyzing trace with hash -418779461, now seen corresponding path program 3 times [2018-11-07 21:59:59,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:59:59,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:59,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 21:59:59,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:59:59,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:59:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 21:59:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 21:59:59,962 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 21:59:59,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:59:59 BoogieIcfgContainer [2018-11-07 21:59:59,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 21:59:59,991 INFO L168 Benchmark]: Toolchain (without parser) took 6436.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -438.9 MB). Peak memory consumption was 298.3 MB. Max. memory is 7.1 GB. [2018-11-07 21:59:59,992 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 21:59:59,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.28 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 21:59:59,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.75 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 21:59:59,994 INFO L168 Benchmark]: Boogie Preprocessor took 25.80 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 21:59:59,995 INFO L168 Benchmark]: RCFGBuilder took 355.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-07 21:59:59,996 INFO L168 Benchmark]: TraceAbstraction took 5692.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 338.3 MB). Peak memory consumption was 338.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:00:00,000 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 334.28 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 24.75 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.80 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 355.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5692.85 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 338.3 MB). Peak memory consumption was 338.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=2, n=4] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=2, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=6, n=4] [L15] COND FALSE !(i==4) VAL [i=3, n=4, n=6] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=8, n=4] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=4, n=-10] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 5.5s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 92 SDtfs, 21 SDslu, 279 SDs, 0 SdLazy, 286 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 261 ConstructedInterpolants, 12 QuantifiedInterpolants, 24641 SizeOfPredicates, 10 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 49/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...