java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:11:54,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:11:54,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:11:54,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:11:54,206 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:11:54,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:11:54,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:11:54,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:11:54,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:11:54,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:11:54,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:11:54,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:11:54,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:11:54,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:11:54,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:11:54,219 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:11:54,222 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:11:54,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:11:54,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:11:54,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:11:54,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:11:54,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:11:54,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:11:54,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:11:54,246 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:11:54,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:11:54,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:11:54,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:11:54,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:11:54,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:11:54,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:11:54,258 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:11:54,258 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:11:54,258 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:11:54,259 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:11:54,261 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:11:54,261 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:11:54,285 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:11:54,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:11:54,286 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:11:54,286 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:11:54,286 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:11:54,286 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:11:54,291 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:11:54,292 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:11:54,292 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:11:54,292 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:11:54,292 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:11:54,292 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:11:54,292 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:11:54,294 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:11:54,294 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:11:54,294 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:11:54,294 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:11:54,294 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:11:54,295 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:11:54,295 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:11:54,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:11:54,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:11:54,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:11:54,297 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:11:54,298 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:11:54,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:11:54,298 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:11:54,298 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:11:54,299 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:11:54,300 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:11:54,300 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:11:54,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:11:54,300 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:11:54,301 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:11:54,301 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:11:54,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:11:54,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:11:54,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:11:54,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:11:54,379 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:11:54,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-07 22:11:54,448 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6053ea400/50571a6e276943fa8af0d621a9f729ce/FLAG82922a296 [2018-11-07 22:11:54,868 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:11:54,869 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-07 22:11:54,877 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6053ea400/50571a6e276943fa8af0d621a9f729ce/FLAG82922a296 [2018-11-07 22:11:54,891 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6053ea400/50571a6e276943fa8af0d621a9f729ce [2018-11-07 22:11:54,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:11:54,905 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:11:54,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:11:54,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:11:54,910 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:11:54,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:54" (1/1) ... [2018-11-07 22:11:54,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41600c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:54, skipping insertion in model container [2018-11-07 22:11:54,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:54" (1/1) ... [2018-11-07 22:11:54,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:11:54,950 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:11:55,196 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:11:55,200 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:11:55,219 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:11:55,232 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:11:55,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55 WrapperNode [2018-11-07 22:11:55,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:11:55,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:11:55,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:11:55,234 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:11:55,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (1/1) ... [2018-11-07 22:11:55,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (1/1) ... [2018-11-07 22:11:55,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:11:55,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:11:55,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:11:55,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:11:55,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (1/1) ... [2018-11-07 22:11:55,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (1/1) ... [2018-11-07 22:11:55,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (1/1) ... [2018-11-07 22:11:55,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (1/1) ... [2018-11-07 22:11:55,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (1/1) ... [2018-11-07 22:11:55,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (1/1) ... [2018-11-07 22:11:55,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (1/1) ... [2018-11-07 22:11:55,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:11:55,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:11:55,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:11:55,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:11:55,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:11:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:11:55,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:11:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:11:55,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:11:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:11:55,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:11:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:11:55,415 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:11:55,822 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:11:55,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:55 BoogieIcfgContainer [2018-11-07 22:11:55,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:11:55,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:11:55,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:11:55,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:11:55,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:11:54" (1/3) ... [2018-11-07 22:11:55,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603567d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:55, skipping insertion in model container [2018-11-07 22:11:55,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:55" (2/3) ... [2018-11-07 22:11:55,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603567d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:55, skipping insertion in model container [2018-11-07 22:11:55,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:55" (3/3) ... [2018-11-07 22:11:55,830 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-07 22:11:55,840 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:11:55,847 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:11:55,861 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:11:55,896 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:11:55,896 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:11:55,896 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:11:55,896 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:11:55,896 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:11:55,897 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:11:55,897 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:11:55,897 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:11:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-07 22:11:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 22:11:55,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:55,926 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:55,929 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:55,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:55,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1538012201, now seen corresponding path program 1 times [2018-11-07 22:11:55,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:55,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:55,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:55,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:55,985 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:56,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:11:56,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:11:56,052 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:11:56,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:11:56,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:11:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:11:56,072 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-07 22:11:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:56,100 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2018-11-07 22:11:56,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:11:56,103 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 22:11:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:56,114 INFO L225 Difference]: With dead ends: 63 [2018-11-07 22:11:56,114 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 22:11:56,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:11:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 22:11:56,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 22:11:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 22:11:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-11-07 22:11:56,173 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 14 [2018-11-07 22:11:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:56,174 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-07 22:11:56,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:11:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-11-07 22:11:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 22:11:56,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:56,176 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:56,177 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:56,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:56,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1856547447, now seen corresponding path program 1 times [2018-11-07 22:11:56,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:56,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:56,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:56,179 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:56,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:11:56,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 22:11:56,449 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:11:56,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:11:56,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:11:56,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 22:11:56,452 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2018-11-07 22:11:56,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:56,652 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-07 22:11:56,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:11:56,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-07 22:11:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:56,654 INFO L225 Difference]: With dead ends: 36 [2018-11-07 22:11:56,655 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 22:11:56,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:11:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 22:11:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-07 22:11:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 22:11:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-07 22:11:56,669 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2018-11-07 22:11:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:56,669 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-07 22:11:56,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:11:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-07 22:11:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 22:11:56,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:56,671 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:11:56,671 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:56,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1929535109, now seen corresponding path program 1 times [2018-11-07 22:11:56,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:56,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:56,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:56,675 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:57,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:57,038 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:57,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-07 22:11:57,049 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84] [2018-11-07 22:11:57,085 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:11:57,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:11:57,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:11:57,235 INFO L272 AbstractInterpreter]: Visited 20 different actions 25 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-11-07 22:11:57,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:57,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:11:57,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:57,248 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:57,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:57,261 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:57,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:57,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:11:57,639 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:11:57,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 13 [2018-11-07 22:11:57,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:11:57,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:11:57,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:11:57,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:11:57,641 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2018-11-07 22:11:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:57,842 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-07 22:11:57,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:11:57,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 22:11:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:57,845 INFO L225 Difference]: With dead ends: 50 [2018-11-07 22:11:57,845 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 22:11:57,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:11:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 22:11:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-07 22:11:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 22:11:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-07 22:11:57,858 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 21 [2018-11-07 22:11:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:57,859 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-07 22:11:57,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:11:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2018-11-07 22:11:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 22:11:57,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:57,861 INFO L375 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, 1] [2018-11-07 22:11:57,861 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:57,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:57,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1060690802, now seen corresponding path program 1 times [2018-11-07 22:11:57,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:57,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:57,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:57,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:57,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 22:11:58,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:58,099 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:58,099 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-07 22:11:58,099 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78] [2018-11-07 22:11:58,102 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:11:58,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:11:58,150 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:11:58,150 INFO L272 AbstractInterpreter]: Visited 25 different actions 35 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-07 22:11:58,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:58,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:11:58,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:58,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:58,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:58,207 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:58,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:11:58,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 22:11:58,584 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:11:58,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 11 [2018-11-07 22:11:58,584 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:11:58,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:11:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:11:58,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:11:58,585 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 6 states. [2018-11-07 22:11:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:58,730 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-07 22:11:58,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:11:58,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-07 22:11:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:58,733 INFO L225 Difference]: With dead ends: 57 [2018-11-07 22:11:58,734 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 22:11:58,734 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:11:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 22:11:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-11-07 22:11:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 22:11:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-07 22:11:58,747 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 29 [2018-11-07 22:11:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:58,747 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-07 22:11:58,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:11:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-07 22:11:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 22:11:58,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:58,749 INFO L375 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] [2018-11-07 22:11:58,749 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:58,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash 578348401, now seen corresponding path program 1 times [2018-11-07 22:11:58,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:58,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:58,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:58,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:58,751 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:11:58,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:58,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:58,866 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 22:11:58,867 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [52], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84], [85], [86], [87], [88] [2018-11-07 22:11:58,869 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:11:58,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:11:58,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:11:58,910 INFO L272 AbstractInterpreter]: Visited 25 different actions 40 times. Never merged. Never widened. Never found a fixpoint. Largest state had 9 variables. [2018-11-07 22:11:58,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:58,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:11:58,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:58,919 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:58,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:58,929 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:58,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:11:59,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:11:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:11:59,249 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:11:59,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 13 [2018-11-07 22:11:59,251 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:11:59,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:11:59,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:11:59,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:11:59,253 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 7 states. [2018-11-07 22:11:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:11:59,557 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-11-07 22:11:59,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:11:59,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-11-07 22:11:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:11:59,560 INFO L225 Difference]: With dead ends: 73 [2018-11-07 22:11:59,560 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 22:11:59,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:11:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 22:11:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-07 22:11:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 22:11:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2018-11-07 22:11:59,573 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 32 [2018-11-07 22:11:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:11:59,574 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2018-11-07 22:11:59,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:11:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2018-11-07 22:11:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 22:11:59,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:11:59,575 INFO L375 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, 1] [2018-11-07 22:11:59,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:11:59,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash 434465614, now seen corresponding path program 1 times [2018-11-07 22:11:59,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:11:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:59,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:11:59,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:11:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:11:59,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:59,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:11:59,702 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-07 22:11:59,702 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80] [2018-11-07 22:11:59,704 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:11:59,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:11:59,765 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:11:59,765 INFO L272 AbstractInterpreter]: Visited 27 different actions 42 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-07 22:11:59,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:11:59,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:11:59,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:11:59,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:11:59,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:11:59,783 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:11:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:11:59,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:11:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:11:59,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 22:12:00,110 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:12:00,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [10] total 17 [2018-11-07 22:12:00,111 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:12:00,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:12:00,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:12:00,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:12:00,112 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 8 states. [2018-11-07 22:12:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:00,316 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2018-11-07 22:12:00,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:12:00,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-07 22:12:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:00,318 INFO L225 Difference]: With dead ends: 75 [2018-11-07 22:12:00,319 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 22:12:00,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:12:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 22:12:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-11-07 22:12:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 22:12:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-11-07 22:12:00,332 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 34 [2018-11-07 22:12:00,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:00,333 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-11-07 22:12:00,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:12:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-11-07 22:12:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 22:12:00,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:00,335 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 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] [2018-11-07 22:12:00,336 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:00,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2058374368, now seen corresponding path program 1 times [2018-11-07 22:12:00,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:00,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:00,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:00,592 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-07 22:12:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-07 22:12:00,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:00,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:00,712 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-07 22:12:00,712 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [34], [39], [42], [44], [52], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-07 22:12:00,714 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:12:00,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:12:01,170 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:12:01,170 INFO L272 AbstractInterpreter]: Visited 37 different actions 450 times. Merged at 15 different actions 90 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2018-11-07 22:12:01,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:01,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:12:01,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:01,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:01,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:01,239 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:01,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:12:01,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:12:02,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:02,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-11-07 22:12:02,170 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:02,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:12:02,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:12:02,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:12:02,172 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 18 states. [2018-11-07 22:12:02,416 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-11-07 22:12:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:03,189 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2018-11-07 22:12:03,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:12:03,195 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-11-07 22:12:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:03,199 INFO L225 Difference]: With dead ends: 108 [2018-11-07 22:12:03,199 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 22:12:03,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:12:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 22:12:03,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-07 22:12:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-07 22:12:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2018-11-07 22:12:03,216 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 58 [2018-11-07 22:12:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:03,216 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-11-07 22:12:03,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:12:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2018-11-07 22:12:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-07 22:12:03,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:03,219 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:03,219 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:03,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 574589245, now seen corresponding path program 1 times [2018-11-07 22:12:03,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:03,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 22:12:03,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:03,404 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:03,405 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-07 22:12:03,405 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81] [2018-11-07 22:12:03,406 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:12:03,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:12:03,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:12:03,565 INFO L272 AbstractInterpreter]: Visited 28 different actions 247 times. Merged at 10 different actions 60 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2018-11-07 22:12:03,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:03,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:12:03,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:03,600 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:03,614 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:12:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:03,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:04,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 22:12:04,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:04,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2018-11-07 22:12:04,298 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:04,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 22:12:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 22:12:04,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:12:04,300 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 16 states. [2018-11-07 22:12:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:05,029 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-11-07 22:12:05,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 22:12:05,030 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-11-07 22:12:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:05,031 INFO L225 Difference]: With dead ends: 106 [2018-11-07 22:12:05,031 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 22:12:05,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 110 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-11-07 22:12:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 22:12:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-07 22:12:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-07 22:12:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2018-11-07 22:12:05,061 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 60 [2018-11-07 22:12:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:05,061 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2018-11-07 22:12:05,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 22:12:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2018-11-07 22:12:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 22:12:05,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:05,071 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:12:05,071 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:05,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1079113108, now seen corresponding path program 2 times [2018-11-07 22:12:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:05,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:12:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:05,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 44 proven. 50 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-11-07 22:12:05,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:05,317 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:05,317 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:05,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:05,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:05,318 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:05,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:05,332 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:05,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 22:12:05,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:05,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 45 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 22:12:05,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 45 proven. 37 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 22:12:06,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:06,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 15] total 31 [2018-11-07 22:12:06,508 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:06,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:12:06,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:12:06,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:12:06,510 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 23 states. [2018-11-07 22:12:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:07,591 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-11-07 22:12:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 22:12:07,591 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-11-07 22:12:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:07,594 INFO L225 Difference]: With dead ends: 115 [2018-11-07 22:12:07,594 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 22:12:07,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=390, Invalid=1680, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 22:12:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 22:12:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-11-07 22:12:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 22:12:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-11-07 22:12:07,608 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 86 [2018-11-07 22:12:07,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:07,608 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-11-07 22:12:07,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:12:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-11-07 22:12:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-07 22:12:07,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:12:07,611 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 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] [2018-11-07 22:12:07,611 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:12:07,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:12:07,612 INFO L82 PathProgramCache]: Analyzing trace with hash -795584450, now seen corresponding path program 2 times [2018-11-07 22:12:07,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:12:07,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:07,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:12:07,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:12:07,613 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:12:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:12:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 64 proven. 81 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2018-11-07 22:12:07,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:07,845 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:12:07,845 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:12:07,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:12:07,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:12:07,846 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:12:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:12:07,863 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:12:07,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 22:12:07,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:12:07,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:12:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 100 proven. 29 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-07 22:12:08,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:12:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 100 proven. 29 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-07 22:12:08,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:12:08,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 21 [2018-11-07 22:12:08,781 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:12:08,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:12:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:12:08,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:12:08,782 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 17 states. [2018-11-07 22:12:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:12:09,364 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-11-07 22:12:09,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:12:09,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 110 [2018-11-07 22:12:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:12:09,367 INFO L225 Difference]: With dead ends: 108 [2018-11-07 22:12:09,367 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 22:12:09,369 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 209 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2018-11-07 22:12:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 22:12:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 22:12:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 22:12:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 22:12:09,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2018-11-07 22:12:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:12:09,370 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 22:12:09,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:12:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 22:12:09,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 22:12:09,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 22:12:09,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:12:09,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:12:10,159 WARN L179 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-11-07 22:12:10,271 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2018-11-07 22:12:10,379 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-11-07 22:12:10,591 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-11-07 22:12:10,895 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 22:12:10,896 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:12:10,896 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:12:10,896 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 22:12:10,896 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:12:10,896 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:12:10,896 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (< main_~bufferlen~0 main_~inlen~0)) (.cse1 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse2 (+ main_~buflim~0 2))) (or (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse0 .cse1 (= main_~bufferlen~0 .cse2) (= main_~buf~0 0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse2) (<= 1 main_~in~0) .cse1 (<= 0 main_~buf~0) (<= .cse2 main_~bufferlen~0)))) [2018-11-07 22:12:10,897 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (< main_~bufferlen~0 main_~inlen~0)) (.cse1 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse2 (+ main_~buflim~0 2))) (or (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse0 .cse1 (= main_~bufferlen~0 .cse2) (= main_~buf~0 0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse2) (<= 1 main_~in~0) .cse1 (<= 0 main_~buf~0) (<= .cse2 main_~bufferlen~0)))) [2018-11-07 22:12:10,897 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-11-07 22:12:10,897 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-11-07 22:12:10,897 INFO L425 ceAbstractionStarter]: For program point L23-2(lines 23 34) no Hoare annotation was computed. [2018-11-07 22:12:10,897 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-07 22:12:10,897 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (and (<= main_~buf~0 2) .cse1 .cse0 (<= 3 main_~inlen~0) .cse2) (let ((.cse3 (+ main_~buflim~0 2))) (and (< main_~bufferlen~0 main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse3) .cse1 .cse0 (<= .cse3 main_~bufferlen~0) .cse2)))) [2018-11-07 22:12:10,898 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-07 22:12:10,898 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (< main_~bufferlen~0 main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0))) [2018-11-07 22:12:10,898 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (< main_~bufferlen~0 main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0))) [2018-11-07 22:12:10,898 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 22:12:10,898 INFO L428 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-11-07 22:12:10,898 INFO L421 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse0 (< main_~bufferlen~0 main_~inlen~0)) (.cse1 (+ main_~buflim~0 2))) (or (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse0 (= main_~bufferlen~0 .cse1) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse1) (<= 1 main_~in~0) (<= 0 main_~buf~0) (<= .cse1 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)))) [2018-11-07 22:12:10,899 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-11-07 22:12:10,899 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-07 22:12:10,899 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-11-07 22:12:10,899 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-11-07 22:12:10,899 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-11-07 22:12:10,899 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (and (<= 0 main_~in~0) (<= 0 main_~buf~0)))) (or (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (and (<= 3 main_~inlen~0) .cse0) (< 1 main_~bufferlen~0)) (and (<= main_~buf~0 1) .cse0 (<= 2 main_~bufferlen~0)))) [2018-11-07 22:12:10,899 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-07 22:12:10,899 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-11-07 22:12:10,899 INFO L425 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-11-07 22:12:10,899 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-07 22:12:10,900 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse0 (<= 0 main_~buf~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= main_~buf~0 0) (<= 0 main_~in~0) .cse0 (<= 2 main_~bufferlen~0)) (and (<= main_~buf~0 2) .cse1 .cse0 (<= 3 main_~inlen~0) .cse2) (let ((.cse3 (+ main_~buflim~0 2))) (and (< main_~bufferlen~0 main_~inlen~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse3) .cse1 .cse0 (<= .cse3 main_~bufferlen~0) .cse2)))) [2018-11-07 22:12:10,900 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 22:12:10,900 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 22:12:10,900 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:12:10,900 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 22:12:10,900 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 22:12:10,900 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:12:10,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:12:10 BoogieIcfgContainer [2018-11-07 22:12:10,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:12:10,914 INFO L168 Benchmark]: Toolchain (without parser) took 16009.21 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 883.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -275.3 MB). Peak memory consumption was 608.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:12:10,915 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:12:10,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:12:10,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:12:10,917 INFO L168 Benchmark]: Boogie Preprocessor took 21.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:12:10,918 INFO L168 Benchmark]: RCFGBuilder took 544.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-07 22:12:10,919 INFO L168 Benchmark]: TraceAbstraction took 15089.51 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.9 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 507.1 MB). Peak memory consumption was 645.0 MB. Max. memory is 7.1 GB. [2018-11-07 22:12:10,923 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 18.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 544.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15089.51 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.9 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 507.1 MB). Peak memory consumption was 645.0 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 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((0 <= in && in <= 0) && bufferlen < inlen) && bufferlen == buflim + 2) && buf == 0) && 2 <= bufferlen) || ((((((bufferlen < inlen && in + bufferlen + 1 <= buf + inlen) && bufferlen <= buflim + 2) && 1 <= in) && 0 <= buf) && buflim + 2 <= bufferlen) && buf + 2 <= bufferlen) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. SAFE Result, 15.0s OverallTime, 10 OverallIterations, 16 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 368 SDtfs, 506 SDslu, 1385 SDs, 0 SdLazy, 1394 SolverSat, 544 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1002 GetRequests, 790 SyntacticMatches, 35 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 58 PreInvPairs, 100 NumberOfFragments, 441 HoareAnnotationTreeSize, 58 FomulaSimplifications, 806 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1193 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 890 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1294 ConstructedInterpolants, 0 QuantifiedInterpolants, 386614 SizeOfPredicates, 37 NumberOfNonLiveVariables, 783 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 2650/3048 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...