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/recursive-simple/sum_10x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:10:16,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:10:16,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:10:16,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:10:16,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:10:16,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:10:16,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:10:16,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:10:16,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:10:16,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:10:16,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:10:16,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:10:16,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:10:16,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:10:16,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:10:16,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:10:16,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:10:16,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:10:16,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:10:16,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:10:16,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:10:16,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:10:16,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:10:16,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:10:16,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:10:16,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:10:16,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:10:16,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:10:16,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:10:16,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:10:16,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:10:16,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:10:16,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:10:16,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:10:16,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:10:16,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:10:16,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:10:16,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:10:16,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:10:16,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:10:16,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:10:16,745 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-09-10 03:10:16,760 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:10:16,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:10:16,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:10:16,762 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:10:16,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:10:16,763 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:10:16,763 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:10:16,764 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:10:16,764 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:10:16,765 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:10:16,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:10:16,766 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:10:16,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:10:16,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:10:16,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:10:16,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:10:16,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:10:16,768 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:10:16,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:10:16,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:10:16,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:10:16,769 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:10:16,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:10:16,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:10:16,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:10:16,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:10:16,770 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:10:16,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:10:16,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:10:16,770 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:10:16,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:10:16,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:10:16,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:10:16,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:10:16,845 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:10:16,846 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_10x0-1.c [2019-09-10 03:10:16,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4cda631/e26d96a30b064dd5a8687c16399ddb4f/FLAG1ec394e5a [2019-09-10 03:10:17,346 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:10:17,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_10x0-1.c [2019-09-10 03:10:17,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4cda631/e26d96a30b064dd5a8687c16399ddb4f/FLAG1ec394e5a [2019-09-10 03:10:17,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4cda631/e26d96a30b064dd5a8687c16399ddb4f [2019-09-10 03:10:17,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:10:17,734 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:10:17,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:10:17,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:10:17,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:10:17,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:10:17" (1/1) ... [2019-09-10 03:10:17,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8ba14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17, skipping insertion in model container [2019-09-10 03:10:17,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:10:17" (1/1) ... [2019-09-10 03:10:17,750 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:10:17,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:10:17,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:10:17,954 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:10:17,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:10:17,982 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:10:17,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17 WrapperNode [2019-09-10 03:10:17,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:10:17,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:10:17,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:10:17,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:10:18,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17" (1/1) ... [2019-09-10 03:10:18,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17" (1/1) ... [2019-09-10 03:10:18,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17" (1/1) ... [2019-09-10 03:10:18,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17" (1/1) ... [2019-09-10 03:10:18,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17" (1/1) ... [2019-09-10 03:10:18,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17" (1/1) ... [2019-09-10 03:10:18,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17" (1/1) ... [2019-09-10 03:10:18,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:10:18,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:10:18,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:10:18,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:10:18,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17" (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-09-10 03:10:18,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:10:18,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:10:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-09-10 03:10:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:10:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:10:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-09-10 03:10:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:10:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:10:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:10:18,319 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:10:18,320 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:10:18,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:10:18 BoogieIcfgContainer [2019-09-10 03:10:18,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:10:18,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:10:18,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:10:18,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:10:18,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:10:17" (1/3) ... [2019-09-10 03:10:18,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5244dd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:10:18, skipping insertion in model container [2019-09-10 03:10:18,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:10:17" (2/3) ... [2019-09-10 03:10:18,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5244dd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:10:18, skipping insertion in model container [2019-09-10 03:10:18,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:10:18" (3/3) ... [2019-09-10 03:10:18,330 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_10x0-1.c [2019-09-10 03:10:18,341 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:10:18,349 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:10:18,369 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:10:18,421 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:10:18,422 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:10:18,422 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:10:18,422 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:10:18,422 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:10:18,423 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:10:18,423 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:10:18,423 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:10:18,453 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-09-10 03:10:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:10:18,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:18,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:18,479 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:18,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2019-09-10 03:10:18,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:18,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:18,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:18,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:18,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:10:18,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:10:18,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:10:18,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:10:18,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:10:18,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:10:18,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:10:18,734 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2019-09-10 03:10:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:18,808 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-09-10 03:10:18,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:10:18,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:10:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:18,818 INFO L225 Difference]: With dead ends: 22 [2019-09-10 03:10:18,818 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 03:10:18,820 INFO L628 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-09-10 03:10:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 03:10:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 03:10:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 03:10:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-10 03:10:18,856 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-10 03:10:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:18,856 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-10 03:10:18,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:10:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-10 03:10:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 03:10:18,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:18,859 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:18,859 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:18,860 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2019-09-10 03:10:18,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:18,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:18,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:18,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:18,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:10:18,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:18,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:18,927 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2019-09-10 03:10:18,929 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [10], [11], [12], [14], [17], [19], [25], [26], [27], [29], [30], [31], [32] [2019-09-10 03:10:18,959 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:10:18,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:10:19,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:10:19,085 INFO L272 AbstractInterpreter]: Visited 17 different actions 68 times. Merged at 2 different actions 4 times. Widened at 1 different actions 4 times. Performed 86 root evaluator evaluations with a maximum evaluation depth of 5. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2019-09-10 03:10:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:19,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:10:19,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:19,090 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-09-10 03:10:19,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:19,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:10:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:19,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 03:10:19,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:10:19,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:19,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:10:19,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:19,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2019-09-10 03:10:19,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:19,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:10:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:10:19,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:10:19,394 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-09-10 03:10:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:19,473 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-09-10 03:10:19,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:10:19,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-10 03:10:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:19,475 INFO L225 Difference]: With dead ends: 21 [2019-09-10 03:10:19,475 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 03:10:19,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:10:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 03:10:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 03:10:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 03:10:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-10 03:10:19,487 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-09-10 03:10:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:19,489 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-10 03:10:19,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:10:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-10 03:10:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 03:10:19,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:19,492 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:19,492 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2019-09-10 03:10:19,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:19,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:19,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:10:19,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:19,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:19,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:19,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:19,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:19,634 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:19,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:10:19,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:10:19,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:10:19,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:19,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:10:19,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 03:10:19,690 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:19,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:19,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 03:10:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:20,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2019-09-10 03:10:20,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:20,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:10:20,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:10:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:10:20,051 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2019-09-10 03:10:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:20,128 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-09-10 03:10:20,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:10:20,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-10 03:10:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:20,131 INFO L225 Difference]: With dead ends: 24 [2019-09-10 03:10:20,131 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 03:10:20,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:10:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 03:10:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 03:10:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 03:10:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-10 03:10:20,138 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2019-09-10 03:10:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:20,138 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-10 03:10:20,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:10:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-10 03:10:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 03:10:20,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:20,140 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:20,140 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:20,141 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2019-09-10 03:10:20,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:20,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:20,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:20,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:20,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:10:20,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:20,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:20,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:20,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:20,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:20,242 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-09-10 03:10:20,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:10:20,270 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-09-10 03:10:20,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:10:20,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:20,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:10:20,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:10:20,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:20,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:20,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:20,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:10:20,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:20,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2019-09-10 03:10:20,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:20,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:10:20,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:10:20,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:10:20,900 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2019-09-10 03:10:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:20,985 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-09-10 03:10:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:10:20,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-10 03:10:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:20,986 INFO L225 Difference]: With dead ends: 27 [2019-09-10 03:10:20,986 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 03:10:20,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:10:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 03:10:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 03:10:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 03:10:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-10 03:10:20,992 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2019-09-10 03:10:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:20,993 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-10 03:10:20,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:10:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-10 03:10:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 03:10:20,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:20,994 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:20,995 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2019-09-10 03:10:20,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:20,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:20,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:10:21,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:21,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:21,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:21,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:21,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:21,087 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:21,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:21,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:10:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:21,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 03:10:21,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:10:21,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:21,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:21,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:21,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:21,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 03:10:21,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:21,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2019-09-10 03:10:21,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:21,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:10:21,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:10:21,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:10:21,926 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2019-09-10 03:10:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:22,026 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-09-10 03:10:22,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:10:22,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-09-10 03:10:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:22,028 INFO L225 Difference]: With dead ends: 30 [2019-09-10 03:10:22,028 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:10:22,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:10:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:10:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:10:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:10:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-10 03:10:22,034 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2019-09-10 03:10:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:22,035 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-10 03:10:22,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:10:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-10 03:10:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 03:10:22,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:22,037 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:22,037 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:22,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2019-09-10 03:10:22,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:22,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:22,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:22,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:22,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:10:22,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:22,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:22,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:22,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:22,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:22,158 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:10:22,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:10:22,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:22,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 03:10:22,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:22,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 03:10:22,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 03:10:22,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:23,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:23,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:23,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:23,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:23,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 03:10:23,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:23,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2019-09-10 03:10:23,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:23,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:10:23,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:10:23,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:10:23,578 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2019-09-10 03:10:23,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:23,728 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-09-10 03:10:23,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:10:23,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-09-10 03:10:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:23,730 INFO L225 Difference]: With dead ends: 33 [2019-09-10 03:10:23,730 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 03:10:23,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-09-10 03:10:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 03:10:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 03:10:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 03:10:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-10 03:10:23,736 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2019-09-10 03:10:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:23,737 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-10 03:10:23,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:10:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-10 03:10:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:10:23,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:23,738 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:23,739 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2019-09-10 03:10:23,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:23,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:23,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:23,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:10:23,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:23,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:23,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:23,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:23,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:23,887 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:23,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:10:23,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:10:23,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:10:23,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:23,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 03:10:23,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:10:23,944 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:25,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:25,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:25,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:25,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:25,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:25,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 03:10:25,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:25,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2019-09-10 03:10:25,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:25,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:10:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:10:25,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 03:10:25,910 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2019-09-10 03:10:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:26,079 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-09-10 03:10:26,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:10:26,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-09-10 03:10:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:26,082 INFO L225 Difference]: With dead ends: 36 [2019-09-10 03:10:26,082 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 03:10:26,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:10:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 03:10:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 03:10:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 03:10:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-10 03:10:26,090 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2019-09-10 03:10:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:26,090 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-10 03:10:26,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:10:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-10 03:10:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:10:26,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:26,091 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:26,092 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2019-09-10 03:10:26,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:26,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:26,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:26,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:10:26,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:26,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:26,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:26,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:26,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:26,261 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:26,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:26,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:10:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:26,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 03:10:26,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:10:26,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:27,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:28,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:28,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:28,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:29,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:29,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:29,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 03:10:29,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:29,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2019-09-10 03:10:29,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:29,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:10:29,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:10:29,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:10:29,228 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2019-09-10 03:10:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:29,406 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-09-10 03:10:29,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:10:29,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-10 03:10:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:29,408 INFO L225 Difference]: With dead ends: 39 [2019-09-10 03:10:29,408 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 03:10:29,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 93 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:10:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 03:10:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 03:10:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 03:10:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-10 03:10:29,415 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2019-09-10 03:10:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:29,416 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-10 03:10:29,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:10:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-10 03:10:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 03:10:29,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:29,417 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:29,418 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2019-09-10 03:10:29,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:29,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:29,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:29,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:29,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:10:29,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:29,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:29,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:29,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:29,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:29,529 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:29,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:10:29,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:10:29,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 03:10:29,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:29,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 03:10:29,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-10 03:10:29,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:31,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:32,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:32,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:33,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:33,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:33,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:33,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:33,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 03:10:33,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:33,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2019-09-10 03:10:33,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:33,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:10:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:10:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-09-10 03:10:33,575 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2019-09-10 03:10:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:33,733 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-09-10 03:10:33,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:10:33,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-10 03:10:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:33,735 INFO L225 Difference]: With dead ends: 42 [2019-09-10 03:10:33,735 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 03:10:33,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 103 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2019-09-10 03:10:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 03:10:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 03:10:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 03:10:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-10 03:10:33,742 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2019-09-10 03:10:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:33,742 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-10 03:10:33,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:10:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-10 03:10:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 03:10:33,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:33,744 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:33,744 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2019-09-10 03:10:33,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:33,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:33,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:10:33,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:33,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:33,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:33,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:33,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:33,877 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:33,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:10:33,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:10:33,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:10:33,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:10:33,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 03:10:33,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-10 03:10:33,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:36,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:37,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:38,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:38,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:38,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:39,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:39,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:39,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:39,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:10:39,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:39,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 24 [2019-09-10 03:10:39,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:39,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:10:39,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:10:39,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-09-10 03:10:39,371 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2019-09-10 03:10:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:39,544 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-09-10 03:10:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:10:39,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-09-10 03:10:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:39,546 INFO L225 Difference]: With dead ends: 45 [2019-09-10 03:10:39,547 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 03:10:39,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 03:10:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 03:10:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 03:10:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 03:10:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-10 03:10:39,554 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2019-09-10 03:10:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:39,555 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-10 03:10:39,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:10:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-10 03:10:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 03:10:39,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:10:39,556 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:10:39,557 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:10:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:10:39,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2019-09-10 03:10:39,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:10:39,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:39,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:10:39,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:10:39,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:10:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 135 proven. 39 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-10 03:10:40,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:40,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:10:40,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:10:40,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:10:40,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:10:40,218 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:10:40,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:10:40,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:10:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:10:40,271 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-10 03:10:40,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:10:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 154 proven. 20 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-10 03:10:40,525 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:10:42,233 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-09-10 03:10:42,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:44,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:44,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:44,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:44,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:44,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:44,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:44,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:44,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:46,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:46,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:46,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:46,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:46,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:46,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:46,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:46,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:47,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:47,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:47,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:47,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:47,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:47,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:47,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:47,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:47,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:47,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:47,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:48,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:48,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:48,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:48,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:48,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:48,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:48,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:48,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:49,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:49,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:49,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:49,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:49,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 03:10:50,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:50,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:51,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:10:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 135 proven. 120 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-10 03:10:51,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:10:51,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 38] total 65 [2019-09-10 03:10:51,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:10:51,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 03:10:51,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 03:10:51,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=3292, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 03:10:51,103 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 34 states. [2019-09-10 03:10:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:10:52,097 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-09-10 03:10:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 03:10:52,097 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2019-09-10 03:10:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:10:52,098 INFO L225 Difference]: With dead ends: 43 [2019-09-10 03:10:52,098 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 03:10:52,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 114 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1704, Invalid=5778, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 03:10:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 03:10:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 03:10:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 03:10:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 03:10:52,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2019-09-10 03:10:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:10:52,102 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 03:10:52,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 03:10:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 03:10:52,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 03:10:52,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:10:52 BoogieIcfgContainer [2019-09-10 03:10:52,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:10:52,109 INFO L168 Benchmark]: Toolchain (without parser) took 34374.82 ms. Allocated memory was 136.8 MB in the beginning and 450.9 MB in the end (delta: 314.0 MB). Free memory was 93.2 MB in the beginning and 92.5 MB in the end (delta: 656.0 kB). Peak memory consumption was 314.7 MB. Max. memory is 7.1 GB. [2019-09-10 03:10:52,110 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:10:52,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.68 ms. Allocated memory is still 136.8 MB. Free memory was 93.0 MB in the beginning and 84.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-09-10 03:10:52,112 INFO L168 Benchmark]: Boogie Preprocessor took 117.45 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 84.0 MB in the beginning and 178.0 MB in the end (delta: -94.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-09-10 03:10:52,112 INFO L168 Benchmark]: RCFGBuilder took 219.75 ms. Allocated memory is still 200.8 MB. Free memory was 178.0 MB in the beginning and 167.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-09-10 03:10:52,113 INFO L168 Benchmark]: TraceAbstraction took 33784.98 ms. Allocated memory was 200.8 MB in the beginning and 450.9 MB in the end (delta: 250.1 MB). Free memory was 166.7 MB in the beginning and 92.5 MB in the end (delta: 74.1 MB). Peak memory consumption was 324.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:10:52,117 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.21 ms. Allocated memory is still 136.8 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 248.68 ms. Allocated memory is still 136.8 MB. Free memory was 93.0 MB in the beginning and 84.0 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.45 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 84.0 MB in the beginning and 178.0 MB in the end (delta: -94.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 219.75 ms. Allocated memory is still 200.8 MB. Free memory was 178.0 MB in the beginning and 167.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33784.98 ms. Allocated memory was 200.8 MB in the beginning and 450.9 MB in the end (delta: 250.1 MB). Free memory was 166.7 MB in the beginning and 92.5 MB in the end (delta: 74.1 MB). Peak memory consumption was 324.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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, 33.7s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 176 SDslu, 763 SDs, 0 SdLazy, 733 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1165 GetRequests, 773 SyntacticMatches, 115 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2943 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 30.1s InterpolantComputationTime, 933 NumberOfCodeBlocks, 912 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 323736 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1266 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 1816/3630 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...