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/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:01:36,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:01:36,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:01:36,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:01:36,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:01:36,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:01:36,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:01:36,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:01:36,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:01:36,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:01:36,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:01:36,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:01:36,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:01:36,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:01:36,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:01:36,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:01:36,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:01:36,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:01:36,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:01:36,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:01:36,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:01:36,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:01:36,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:01:36,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:01:36,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:01:36,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:01:36,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:01:36,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:01:36,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:01:36,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:01:36,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:01:36,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:01:36,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:01:36,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:01:36,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:01:36,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:01:36,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:01:36,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:01:36,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:01:36,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:01:36,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:01:36,661 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-05 13:01:36,678 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:01:36,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:01:36,679 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:01:36,680 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:01:36,681 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:01:36,681 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:01:36,681 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:01:36,681 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:01:36,681 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:01:36,682 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:01:36,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:01:36,684 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:01:36,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:01:36,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:01:36,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:01:36,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:01:36,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:01:36,685 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:01:36,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:01:36,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:01:36,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:01:36,686 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:01:36,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:01:36,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:01:36,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:01:36,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:01:36,687 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:01:36,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:01:36,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:01:36,688 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:01:36,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:01:36,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:01:36,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:01:36,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:01:36,739 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:01:36,740 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-09-05 13:01:36,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbfe1543e/6b8eb24a8f21443b9b555315b8bf8bd7/FLAGbffc7b1c0 [2019-09-05 13:01:37,252 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:01:37,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-09-05 13:01:37,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbfe1543e/6b8eb24a8f21443b9b555315b8bf8bd7/FLAGbffc7b1c0 [2019-09-05 13:01:37,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbfe1543e/6b8eb24a8f21443b9b555315b8bf8bd7 [2019-09-05 13:01:37,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:01:37,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:01:37,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:37,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:01:37,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:01:37,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:37" (1/1) ... [2019-09-05 13:01:37,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5572eb6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37, skipping insertion in model container [2019-09-05 13:01:37,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:37" (1/1) ... [2019-09-05 13:01:37,652 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:01:37,672 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:01:37,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:37,818 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:01:37,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:37,847 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:01:37,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37 WrapperNode [2019-09-05 13:01:37,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:37,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:01:37,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:01:37,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:01:37,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37" (1/1) ... [2019-09-05 13:01:37,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37" (1/1) ... [2019-09-05 13:01:37,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37" (1/1) ... [2019-09-05 13:01:37,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37" (1/1) ... [2019-09-05 13:01:37,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37" (1/1) ... [2019-09-05 13:01:37,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37" (1/1) ... [2019-09-05 13:01:37,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37" (1/1) ... [2019-09-05 13:01:37,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:01:37,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:01:37,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:01:37,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:01:37,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37" (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-05 13:01:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:01:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:01:38,029 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:01:38,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:01:38,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:01:38,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:01:38,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:01:38,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:01:38,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:01:38,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:01:38,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:01:38,240 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:01:38,241 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 13:01:38,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:38 BoogieIcfgContainer [2019-09-05 13:01:38,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:01:38,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:01:38,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:01:38,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:01:38,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:01:37" (1/3) ... [2019-09-05 13:01:38,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a25e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:38, skipping insertion in model container [2019-09-05 13:01:38,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:37" (2/3) ... [2019-09-05 13:01:38,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a25e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:38, skipping insertion in model container [2019-09-05 13:01:38,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:38" (3/3) ... [2019-09-05 13:01:38,250 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-09-05 13:01:38,259 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:01:38,267 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:01:38,283 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:01:38,307 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:01:38,307 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:01:38,307 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:01:38,307 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:01:38,308 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:01:38,308 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:01:38,308 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:01:38,308 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:01:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-05 13:01:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 13:01:38,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:38,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:38,335 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:38,341 INFO L82 PathProgramCache]: Analyzing trace with hash -584482135, now seen corresponding path program 1 times [2019-09-05 13:01:38,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:38,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:38,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:38,443 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-05 13:01:38,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:38,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:01:38,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:38,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:01:38,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:01:38,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:01:38,461 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-09-05 13:01:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:38,478 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-09-05 13:01:38,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:01:38,480 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-05 13:01:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:38,488 INFO L225 Difference]: With dead ends: 35 [2019-09-05 13:01:38,489 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 13:01:38,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:01:38,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 13:01:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-05 13:01:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 13:01:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-09-05 13:01:38,535 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2019-09-05 13:01:38,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:38,536 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-09-05 13:01:38,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:01:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-09-05 13:01:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 13:01:38,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:38,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:38,538 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:38,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1528524609, now seen corresponding path program 1 times [2019-09-05 13:01:38,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:38,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:38,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:38,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:38,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:38,775 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-05 13:01:38,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:38,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:38,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:38,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:38,780 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2019-09-05 13:01:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:38,927 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-09-05 13:01:38,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:38,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 13:01:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:38,929 INFO L225 Difference]: With dead ends: 33 [2019-09-05 13:01:38,930 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 13:01:38,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 13:01:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 13:01:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 13:01:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-09-05 13:01:38,951 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2019-09-05 13:01:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:38,951 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-09-05 13:01:38,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-09-05 13:01:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 13:01:38,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:38,954 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:38,955 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:38,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash -552299140, now seen corresponding path program 1 times [2019-09-05 13:01:38,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:38,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:38,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:39,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:39,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:39,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:39,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:39,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:39,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:39,077 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2019-09-05 13:01:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:39,238 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-09-05 13:01:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:01:39,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-05 13:01:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:39,240 INFO L225 Difference]: With dead ends: 46 [2019-09-05 13:01:39,240 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 13:01:39,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 13:01:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-05 13:01:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 13:01:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-09-05 13:01:39,250 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2019-09-05 13:01:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:39,251 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-09-05 13:01:39,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-09-05 13:01:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 13:01:39,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:39,253 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:39,253 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash -641752059, now seen corresponding path program 1 times [2019-09-05 13:01:39,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:39,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:39,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:39,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:39,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:01:39,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:39,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:39,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:39,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:39,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:39,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:39,329 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 6 states. [2019-09-05 13:01:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:39,446 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2019-09-05 13:01:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:01:39,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-05 13:01:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:39,449 INFO L225 Difference]: With dead ends: 53 [2019-09-05 13:01:39,449 INFO L226 Difference]: Without dead ends: 53 [2019-09-05 13:01:39,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:39,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-05 13:01:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-09-05 13:01:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 13:01:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-09-05 13:01:39,468 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2019-09-05 13:01:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:39,469 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-09-05 13:01:39,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2019-09-05 13:01:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 13:01:39,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:39,472 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:39,473 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:39,473 INFO L82 PathProgramCache]: Analyzing trace with hash 7477945, now seen corresponding path program 1 times [2019-09-05 13:01:39,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:39,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:39,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:39,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 13:01:39,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:39,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 13:01:39,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:39,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 13:01:39,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 13:01:39,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:39,605 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 7 states. [2019-09-05 13:01:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:39,813 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2019-09-05 13:01:39,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:01:39,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-05 13:01:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:39,815 INFO L225 Difference]: With dead ends: 68 [2019-09-05 13:01:39,816 INFO L226 Difference]: Without dead ends: 63 [2019-09-05 13:01:39,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:01:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-05 13:01:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-05 13:01:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-05 13:01:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-09-05 13:01:39,825 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2019-09-05 13:01:39,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:39,826 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-09-05 13:01:39,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 13:01:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-09-05 13:01:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 13:01:39,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:39,827 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:39,828 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1583771254, now seen corresponding path program 1 times [2019-09-05 13:01:39,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:39,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:39,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:39,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 13:01:39,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:39,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-05 13:01:39,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:39,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:01:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:01:39,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:39,913 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2019-09-05 13:01:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:40,076 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-09-05 13:01:40,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 13:01:40,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-05 13:01:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:40,078 INFO L225 Difference]: With dead ends: 70 [2019-09-05 13:01:40,079 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 13:01:40,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:01:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 13:01:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-09-05 13:01:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 13:01:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-09-05 13:01:40,093 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 33 [2019-09-05 13:01:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:40,094 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-09-05 13:01:40,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:01:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-09-05 13:01:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 13:01:40,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:40,099 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:40,099 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:40,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:40,100 INFO L82 PathProgramCache]: Analyzing trace with hash 199583202, now seen corresponding path program 1 times [2019-09-05 13:01:40,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:40,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:40,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:40,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:40,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 13:01:40,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:40,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:01:40,297 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2019-09-05 13:01:40,305 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [28], [31], [33], [38], [41], [43], [51], [58], [61], [63], [66], [68], [69], [70], [71], [73], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87] [2019-09-05 13:01:40,351 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:01:40,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:01:40,754 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:01:40,756 INFO L272 AbstractInterpreter]: Visited 36 different actions 443 times. Merged at 14 different actions 84 times. Widened at 1 different actions 2 times. Performed 514 root evaluator evaluations with a maximum evaluation depth of 6. Performed 514 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2019-09-05 13:01:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:40,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:01:40,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:40,762 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-05 13:01:40,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:40,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:01:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:40,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 13:01:40,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:01:41,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-05 13:01:41,053 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:01:41,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:41,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:41,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-05 13:01:41,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:01:41,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2019-09-05 13:01:41,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:01:41,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 13:01:41,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 13:01:41,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-05 13:01:41,241 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 16 states. [2019-09-05 13:01:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:41,901 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2019-09-05 13:01:41,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:01:41,902 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-09-05 13:01:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:41,911 INFO L225 Difference]: With dead ends: 109 [2019-09-05 13:01:41,911 INFO L226 Difference]: Without dead ends: 96 [2019-09-05 13:01:41,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2019-09-05 13:01:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-05 13:01:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-09-05 13:01:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-05 13:01:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2019-09-05 13:01:41,933 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 56 [2019-09-05 13:01:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:41,933 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-09-05 13:01:41,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 13:01:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2019-09-05 13:01:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 13:01:41,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:41,935 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:41,935 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:41,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1513329503, now seen corresponding path program 1 times [2019-09-05 13:01:41,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:41,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:41,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:41,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 13:01:42,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:42,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:01:42,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2019-09-05 13:01:42,070 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [28], [33], [38], [41], [43], [58], [61], [63], [66], [68], [69], [70], [71], [73], [74], [75], [76], [77], [78], [79], [80] [2019-09-05 13:01:42,072 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:01:42,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:01:42,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:01:42,157 INFO L272 AbstractInterpreter]: Visited 27 different actions 240 times. Merged at 9 different actions 54 times. Widened at 1 different actions 2 times. Performed 286 root evaluator evaluations with a maximum evaluation depth of 6. Performed 286 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2019-09-05 13:01:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:42,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:01:42,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:42,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:01:42,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:42,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:01:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:42,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:01:42,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:01:42,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 13:01:42,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:01:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 13:01:42,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:01:42,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2019-09-05 13:01:42,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:01:42,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 13:01:42,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 13:01:42,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:01:42,386 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 14 states. [2019-09-05 13:01:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:42,584 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2019-09-05 13:01:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 13:01:42,585 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-09-05 13:01:42,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:42,589 INFO L225 Difference]: With dead ends: 95 [2019-09-05 13:01:42,589 INFO L226 Difference]: Without dead ends: 95 [2019-09-05 13:01:42,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-09-05 13:01:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-05 13:01:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-05 13:01:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 13:01:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2019-09-05 13:01:42,608 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 58 [2019-09-05 13:01:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:42,608 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2019-09-05 13:01:42,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 13:01:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2019-09-05 13:01:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-05 13:01:42,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:42,610 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:42,611 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:42,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1920756074, now seen corresponding path program 2 times [2019-09-05 13:01:42,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:42,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:42,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:42,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:42,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-05 13:01:42,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:42,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:01:42,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:01:42,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:01:42,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:42,833 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-05 13:01:42,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:01:42,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:01:42,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 13:01:42,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:01:42,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 13:01:42,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:01:43,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-09-05 13:01:43,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:01:43,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:43,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:43,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:43,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:43,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-09-05 13:01:43,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:01:43,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 33 [2019-09-05 13:01:43,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:01:43,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:01:43,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:01:43,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 13:01:43,653 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 24 states. [2019-09-05 13:01:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:45,250 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2019-09-05 13:01:45,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 13:01:45,251 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 83 [2019-09-05 13:01:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:45,254 INFO L225 Difference]: With dead ends: 133 [2019-09-05 13:01:45,254 INFO L226 Difference]: Without dead ends: 133 [2019-09-05 13:01:45,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 13:01:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-05 13:01:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2019-09-05 13:01:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-05 13:01:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2019-09-05 13:01:45,276 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 83 [2019-09-05 13:01:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:45,276 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2019-09-05 13:01:45,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:01:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2019-09-05 13:01:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-05 13:01:45,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:45,279 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:45,279 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:45,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:45,279 INFO L82 PathProgramCache]: Analyzing trace with hash -357754430, now seen corresponding path program 2 times [2019-09-05 13:01:45,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:45,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:45,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:01:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:45,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-09-05 13:01:45,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:45,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:01:45,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:01:45,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:01:45,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:45,474 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-05 13:01:45,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:01:45,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:01:45,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:01:45,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:01:45,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 13:01:45,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:01:45,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 100 proven. 26 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-09-05 13:01:45,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:01:45,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:45,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:45,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:45,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 100 proven. 26 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2019-09-05 13:01:46,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:01:46,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2019-09-05 13:01:46,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:01:46,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 13:01:46,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 13:01:46,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-09-05 13:01:46,016 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand 20 states. [2019-09-05 13:01:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:46,268 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2019-09-05 13:01:46,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 13:01:46,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-05 13:01:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:46,271 INFO L225 Difference]: With dead ends: 124 [2019-09-05 13:01:46,272 INFO L226 Difference]: Without dead ends: 113 [2019-09-05 13:01:46,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2019-09-05 13:01:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-05 13:01:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-05 13:01:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-05 13:01:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-09-05 13:01:46,281 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 106 [2019-09-05 13:01:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:46,281 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-09-05 13:01:46,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 13:01:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-09-05 13:01:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-05 13:01:46,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:46,285 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:46,285 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:46,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:46,285 INFO L82 PathProgramCache]: Analyzing trace with hash 480072479, now seen corresponding path program 3 times [2019-09-05 13:01:46,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:46,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:01:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:46,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 46 proven. 105 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2019-09-05 13:01:46,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:46,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:01:46,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:01:46,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:01:46,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:01:46,608 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:01:46,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:01:46,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:01:46,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:01:46,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:01:46,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 13:01:46,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:01:47,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 104 proven. 203 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2019-09-05 13:01:47,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:01:47,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:47,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:47,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:47,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:47,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:01:47,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:01:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 104 proven. 203 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2019-09-05 13:01:47,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:01:47,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 20] total 46 [2019-09-05 13:01:47,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:01:47,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 13:01:47,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 13:01:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1773, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:01:47,672 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 32 states. [2019-09-05 13:01:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:49,478 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2019-09-05 13:01:49,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 13:01:49,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 158 [2019-09-05 13:01:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:49,480 INFO L225 Difference]: With dead ends: 131 [2019-09-05 13:01:49,480 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:01:49,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 286 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=935, Invalid=4321, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 13:01:49,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:01:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:01:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:01:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:01:49,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2019-09-05 13:01:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:49,484 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:01:49,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 13:01:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:01:49,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:01:49,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:01:49 BoogieIcfgContainer [2019-09-05 13:01:49,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:01:49,491 INFO L168 Benchmark]: Toolchain (without parser) took 11860.85 ms. Allocated memory was 137.4 MB in the beginning and 380.6 MB in the end (delta: 243.3 MB). Free memory was 83.7 MB in the beginning and 87.3 MB in the end (delta: -3.6 MB). Peak memory consumption was 239.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:49,492 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 102.2 MB in the beginning and 102.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 13:01:49,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.63 ms. Allocated memory is still 137.4 MB. Free memory was 83.5 MB in the beginning and 73.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:49,494 INFO L168 Benchmark]: Boogie Preprocessor took 121.60 ms. Allocated memory was 137.4 MB in the beginning and 198.2 MB in the end (delta: 60.8 MB). Free memory was 73.9 MB in the beginning and 175.6 MB in the end (delta: -101.7 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:49,494 INFO L168 Benchmark]: RCFGBuilder took 272.32 ms. Allocated memory is still 198.2 MB. Free memory was 175.6 MB in the beginning and 162.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:49,495 INFO L168 Benchmark]: TraceAbstraction took 11246.04 ms. Allocated memory was 198.2 MB in the beginning and 380.6 MB in the end (delta: 182.5 MB). Free memory was 162.2 MB in the beginning and 87.3 MB in the end (delta: 74.9 MB). Peak memory consumption was 257.3 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:49,499 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 137.4 MB. Free memory was 102.2 MB in the beginning and 102.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 211.63 ms. Allocated memory is still 137.4 MB. Free memory was 83.5 MB in the beginning and 73.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.60 ms. Allocated memory was 137.4 MB in the beginning and 198.2 MB in the end (delta: 60.8 MB). Free memory was 73.9 MB in the beginning and 175.6 MB in the end (delta: -101.7 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 272.32 ms. Allocated memory is still 198.2 MB. Free memory was 175.6 MB in the beginning and 162.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11246.04 ms. Allocated memory was 198.2 MB in the beginning and 380.6 MB in the end (delta: 182.5 MB). Free memory was 162.2 MB in the beginning and 87.3 MB in the end (delta: 74.9 MB). Peak memory consumption was 257.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. SAFE Result, 11.1s OverallTime, 11 OverallIterations, 24 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 412 SDtfs, 481 SDslu, 2408 SDs, 0 SdLazy, 2752 SolverSat, 648 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 843 SyntacticMatches, 24 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2504 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 36 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1017 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 609659 SizeOfPredicates, 35 NumberOfNonLiveVariables, 788 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 5744/6502 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...