java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loops/n.c11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:34:57,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:34:57,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:34:57,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:34:57,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:34:57,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:34:57,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:34:57,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:34:57,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:34:57,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:34:57,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:34:57,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:34:57,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:34:57,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:34:57,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:34:57,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:34:57,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:34:57,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:34:57,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:34:57,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:34:57,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:34:57,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:34:57,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:34:57,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:34:57,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:34:57,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:34:57,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:34:57,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:34:57,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:34:57,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:34:57,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:34:57,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:34:57,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:34:57,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:34:57,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:34:57,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:34:57,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:34:57,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:34:57,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:34:57,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:34:57,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:34:57,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:34:57,640 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:34:57,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:34:57,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:34:57,641 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:34:57,642 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:34:57,642 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:34:57,642 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:34:57,642 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:34:57,643 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:34:57,643 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:34:57,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:34:57,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:34:57,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:34:57,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:34:57,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:34:57,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:34:57,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:34:57,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:34:57,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:34:57,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:34:57,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:34:57,648 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:34:57,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:34:57,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:34:57,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:34:57,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:34:57,649 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:34:57,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:34:57,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:34:57,650 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:34:57,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:34:57,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:34:57,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:34:57,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:34:57,725 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:34:57,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c11.c [2019-10-03 02:34:57,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b141e3af2/34dd1a75d02549d495992b543dd0d589/FLAGa3adbe3bc [2019-10-03 02:34:58,245 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:34:58,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c11.c [2019-10-03 02:34:58,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b141e3af2/34dd1a75d02549d495992b543dd0d589/FLAGa3adbe3bc [2019-10-03 02:34:58,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b141e3af2/34dd1a75d02549d495992b543dd0d589 [2019-10-03 02:34:58,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:34:58,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:34:58,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:34:58,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:34:58,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:34:58,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:34:58" (1/1) ... [2019-10-03 02:34:58,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283534bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58, skipping insertion in model container [2019-10-03 02:34:58,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:34:58" (1/1) ... [2019-10-03 02:34:58,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:34:58,684 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:34:58,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:34:58,948 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:34:58,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:34:58,980 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:34:58,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58 WrapperNode [2019-10-03 02:34:58,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:34:58,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:34:58,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:34:58,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:34:59,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58" (1/1) ... [2019-10-03 02:34:59,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58" (1/1) ... [2019-10-03 02:34:59,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58" (1/1) ... [2019-10-03 02:34:59,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58" (1/1) ... [2019-10-03 02:34:59,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58" (1/1) ... [2019-10-03 02:34:59,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58" (1/1) ... [2019-10-03 02:34:59,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58" (1/1) ... [2019-10-03 02:34:59,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:34:59,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:34:59,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:34:59,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:34:59,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58" (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 [2019-10-03 02:34:59,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:34:59,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:34:59,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-03 02:34:59,234 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:34:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:34:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:34:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 02:34:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:34:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:34:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:34:59,412 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:34:59,412 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:34:59,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:34:59 BoogieIcfgContainer [2019-10-03 02:34:59,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:34:59,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:34:59,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:34:59,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:34:59,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:34:58" (1/3) ... [2019-10-03 02:34:59,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b77cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:34:59, skipping insertion in model container [2019-10-03 02:34:59,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:34:58" (2/3) ... [2019-10-03 02:34:59,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b77cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:34:59, skipping insertion in model container [2019-10-03 02:34:59,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:34:59" (3/3) ... [2019-10-03 02:34:59,428 INFO L109 eAbstractionObserver]: Analyzing ICFG n.c11.c [2019-10-03 02:34:59,449 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:34:59,475 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:34:59,523 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:34:59,567 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:34:59,567 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:34:59,567 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:34:59,567 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:34:59,567 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:34:59,567 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:34:59,568 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:34:59,568 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:34:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-03 02:34:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-03 02:34:59,589 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:59,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:59,591 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2019-10-03 02:34:59,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:59,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:59,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:59,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:59,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:34:59,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:34:59,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:34:59,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:34:59,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:34:59,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:34:59,733 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-10-03 02:34:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:59,746 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-10-03 02:34:59,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:34:59,747 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-03 02:34:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:59,755 INFO L225 Difference]: With dead ends: 20 [2019-10-03 02:34:59,755 INFO L226 Difference]: Without dead ends: 13 [2019-10-03 02:34:59,757 INFO L640 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 [2019-10-03 02:34:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-03 02:34:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-03 02:34:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-03 02:34:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-03 02:34:59,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-10-03 02:34:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:59,795 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-03 02:34:59,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:34:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-03 02:34:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-03 02:34:59,796 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:59,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:59,797 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:59,798 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2019-10-03 02:34:59,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:59,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:59,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:59,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:59,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:59,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:34:59,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:34:59,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:34:59,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:34:59,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:34:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:34:59,941 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-10-03 02:35:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:00,004 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-10-03 02:35:00,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:35:00,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-03 02:35:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:00,005 INFO L225 Difference]: With dead ends: 19 [2019-10-03 02:35:00,006 INFO L226 Difference]: Without dead ends: 16 [2019-10-03 02:35:00,007 INFO L640 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 [2019-10-03 02:35:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-03 02:35:00,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-03 02:35:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-03 02:35:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-03 02:35:00,011 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2019-10-03 02:35:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:00,011 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-03 02:35:00,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:35:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-10-03 02:35:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:35:00,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:00,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:00,013 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:00,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2019-10-03 02:35:00,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:00,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:00,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:00,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:00,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:00,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:00,138 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-10-03 02:35:00,141 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [18], [20], [27], [30], [32], [38], [39], [40], [42] [2019-10-03 02:35:00,177 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:35:00,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:35:00,237 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:35:00,336 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:35:00,339 INFO L272 AbstractInterpreter]: Visited 13 different actions 69 times. Merged at 4 different actions 28 times. Widened at 1 different actions 5 times. Performed 109 root evaluator evaluations with a maximum evaluation depth of 6. Performed 109 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-10-03 02:35:00,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:00,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:35:00,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:00,344 INFO L193 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 [2019-10-03 02:35:00,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:00,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:00,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 02:35:00,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:00,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:35:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:00,483 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:00,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:00,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-10-03 02:35:00,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:00,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:35:00,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:35:00,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:35:00,561 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 9 states. [2019-10-03 02:35:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:00,634 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-10-03 02:35:00,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:35:00,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-10-03 02:35:00,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:00,635 INFO L225 Difference]: With dead ends: 22 [2019-10-03 02:35:00,636 INFO L226 Difference]: Without dead ends: 19 [2019-10-03 02:35:00,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:35:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-03 02:35:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-10-03 02:35:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-03 02:35:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-03 02:35:00,641 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-03 02:35:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:00,641 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-03 02:35:00,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:35:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-03 02:35:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:35:00,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:00,642 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:00,643 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash 199799702, now seen corresponding path program 2 times [2019-10-03 02:35:00,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:00,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:00,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:00,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:00,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:00,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:00,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:00,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:00,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:00,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:00,796 INFO L193 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) [2019-10-03 02:35:00,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:00,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:00,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:35:00,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:00,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 02:35:00,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:00,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:35:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:00,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:01,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:01,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 14 [2019-10-03 02:35:01,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:01,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:35:01,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:35:01,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:35:01,047 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 10 states. [2019-10-03 02:35:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:01,157 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-10-03 02:35:01,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:35:01,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-10-03 02:35:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:01,158 INFO L225 Difference]: With dead ends: 25 [2019-10-03 02:35:01,158 INFO L226 Difference]: Without dead ends: 22 [2019-10-03 02:35:01,159 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:35:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-03 02:35:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-03 02:35:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-03 02:35:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-03 02:35:01,168 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2019-10-03 02:35:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:01,169 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-03 02:35:01,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:35:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-03 02:35:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:35:01,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:01,170 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:01,170 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:01,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1443974601, now seen corresponding path program 3 times [2019-10-03 02:35:01,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:01,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:01,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:01,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:01,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:01,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:01,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:01,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:01,442 INFO L193 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) [2019-10-03 02:35:01,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:35:01,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:01,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:35:01,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:01,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-03 02:35:01,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:01,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:35:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:01,527 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:01,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:01,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-10-03 02:35:01,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:01,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:35:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:35:01,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:35:01,612 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-10-03 02:35:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:01,717 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-10-03 02:35:01,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:35:01,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-10-03 02:35:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:01,720 INFO L225 Difference]: With dead ends: 28 [2019-10-03 02:35:01,720 INFO L226 Difference]: Without dead ends: 25 [2019-10-03 02:35:01,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:35:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-03 02:35:01,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-03 02:35:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-03 02:35:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-03 02:35:01,729 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2019-10-03 02:35:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:01,729 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-03 02:35:01,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:35:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-03 02:35:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:35:01,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:01,731 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:01,731 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:01,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash 92873718, now seen corresponding path program 4 times [2019-10-03 02:35:01,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:01,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:01,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:01,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:01,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:01,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:01,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:01,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:01,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:01,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:01,876 INFO L193 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) [2019-10-03 02:35:01,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:01,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:01,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-03 02:35:01,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:01,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:35:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:01,980 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:02,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:02,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-10-03 02:35:02,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:02,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:35:02,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:35:02,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:35:02,101 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2019-10-03 02:35:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:02,220 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-10-03 02:35:02,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:35:02,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-10-03 02:35:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:02,221 INFO L225 Difference]: With dead ends: 22 [2019-10-03 02:35:02,221 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:35:02,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:35:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:35:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:35:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:35:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:35:02,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-03 02:35:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:02,223 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:35:02,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:35:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:35:02,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:35:02,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:35:02 BoogieIcfgContainer [2019-10-03 02:35:02,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:35:02,232 INFO L168 Benchmark]: Toolchain (without parser) took 3585.77 ms. Allocated memory was 129.5 MB in the beginning and 217.6 MB in the end (delta: 88.1 MB). Free memory was 84.9 MB in the beginning and 66.5 MB in the end (delta: 18.4 MB). Peak memory consumption was 106.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:35:02,233 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 129.5 MB. Free memory was 103.6 MB in the beginning and 103.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:35:02,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.56 ms. Allocated memory is still 129.5 MB. Free memory was 84.7 MB in the beginning and 75.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:35:02,235 INFO L168 Benchmark]: Boogie Preprocessor took 182.32 ms. Allocated memory was 129.5 MB in the beginning and 200.3 MB in the end (delta: 70.8 MB). Free memory was 75.2 MB in the beginning and 175.8 MB in the end (delta: -100.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:35:02,236 INFO L168 Benchmark]: RCFGBuilder took 249.64 ms. Allocated memory is still 200.3 MB. Free memory was 175.8 MB in the beginning and 164.4 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:35:02,237 INFO L168 Benchmark]: TraceAbstraction took 2813.58 ms. Allocated memory was 200.3 MB in the beginning and 217.6 MB in the end (delta: 17.3 MB). Free memory was 164.4 MB in the beginning and 66.5 MB in the end (delta: 97.9 MB). Peak memory consumption was 115.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:35:02,241 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 129.5 MB. Free memory was 103.6 MB in the beginning and 103.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 334.56 ms. Allocated memory is still 129.5 MB. Free memory was 84.7 MB in the beginning and 75.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 182.32 ms. Allocated memory was 129.5 MB in the beginning and 200.3 MB in the end (delta: 70.8 MB). Free memory was 75.2 MB in the beginning and 175.8 MB in the end (delta: -100.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 249.64 ms. Allocated memory is still 200.3 MB. Free memory was 175.8 MB in the beginning and 164.4 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2813.58 ms. Allocated memory was 200.3 MB in the beginning and 217.6 MB in the end (delta: 17.3 MB). Free memory was 164.4 MB in the beginning and 66.5 MB in the end (delta: 97.9 MB). Peak memory consumption was 115.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 83 SDtfs, 39 SDslu, 331 SDs, 0 SdLazy, 261 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 116 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 17754 SizeOfPredicates, 8 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 2/120 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...