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.epf -i ../../../trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:54:33,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:54:33,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:54:33,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:54:33,225 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:54:33,226 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:54:33,227 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:54:33,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:54:33,231 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:54:33,232 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:54:33,233 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:54:33,233 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:54:33,234 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:54:33,235 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:54:33,236 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:54:33,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:54:33,239 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:54:33,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:54:33,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:54:33,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:54:33,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:54:33,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:54:33,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:54:33,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:54:33,264 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:54:33,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:54:33,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:54:33,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:54:33,267 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:54:33,271 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:54:33,271 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:54:33,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:54:33,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:54:33,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:54:33,275 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:54:33,276 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:54:33,277 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:54:33,297 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:54:33,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:54:33,299 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:54:33,299 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:54:33,299 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:54:33,299 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:54:33,300 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:54:33,300 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:54:33,300 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:54:33,300 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:54:33,300 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:54:33,301 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:54:33,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:54:33,302 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:54:33,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:54:33,302 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:54:33,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:54:33,302 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:54:33,303 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:54:33,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:54:33,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:54:33,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:54:33,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:54:33,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:54:33,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:54:33,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:54:33,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:54:33,305 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:54:33,305 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:54:33,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:54:33,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:54:33,305 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:54:33,306 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:54:33,306 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:54:33,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:54:33,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:54:33,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:54:33,402 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:54:33,403 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:54:33,403 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i [2018-11-07 04:54:33,471 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56e96927/ef3a797a3c444adf833278e13b1719be/FLAG9431d606a [2018-11-07 04:54:33,965 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:54:33,966 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i [2018-11-07 04:54:33,973 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56e96927/ef3a797a3c444adf833278e13b1719be/FLAG9431d606a [2018-11-07 04:54:33,990 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56e96927/ef3a797a3c444adf833278e13b1719be [2018-11-07 04:54:34,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:54:34,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:54:34,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:54:34,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:54:34,008 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:54:34,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:54:33" (1/1) ... [2018-11-07 04:54:34,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531eb58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34, skipping insertion in model container [2018-11-07 04:54:34,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:54:33" (1/1) ... [2018-11-07 04:54:34,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:54:34,048 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:54:34,251 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:54:34,255 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:54:34,273 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:54:34,290 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:54:34,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34 WrapperNode [2018-11-07 04:54:34,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:54:34,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:54:34,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:54:34,292 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:54:34,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (1/1) ... [2018-11-07 04:54:34,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (1/1) ... [2018-11-07 04:54:34,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:54:34,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:54:34,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:54:34,318 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:54:34,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (1/1) ... [2018-11-07 04:54:34,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (1/1) ... [2018-11-07 04:54:34,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (1/1) ... [2018-11-07 04:54:34,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (1/1) ... [2018-11-07 04:54:34,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (1/1) ... [2018-11-07 04:54:34,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (1/1) ... [2018-11-07 04:54:34,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (1/1) ... [2018-11-07 04:54:34,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:54:34,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:54:34,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:54:34,348 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:54:34,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (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 04:54:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:54:34,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:54:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:54:34,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:54:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:54:34,502 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:54:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:54:34,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:54:34,782 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:54:34,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:54:34 BoogieIcfgContainer [2018-11-07 04:54:34,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:54:34,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:54:34,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:54:34,787 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:54:34,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:54:33" (1/3) ... [2018-11-07 04:54:34,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c79d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:54:34, skipping insertion in model container [2018-11-07 04:54:34,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:54:34" (2/3) ... [2018-11-07 04:54:34,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c79d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:54:34, skipping insertion in model container [2018-11-07 04:54:34,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:54:34" (3/3) ... [2018-11-07 04:54:34,791 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03_false-unreach-call_true-termination.i [2018-11-07 04:54:34,802 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:54:34,810 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:54:34,837 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:54:34,891 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:54:34,892 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:54:34,892 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:54:34,892 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:54:34,893 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:54:34,893 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:54:34,893 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:54:34,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:54:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 04:54:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 04:54:34,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:34,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:34,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:34,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:34,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1231955355, now seen corresponding path program 1 times [2018-11-07 04:54:34,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:35,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:35,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:35,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:35,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:35,301 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 04:54:35,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:35,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 04:54:35,304 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:35,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:54:35,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:54:35,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:54:35,324 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 6 states. [2018-11-07 04:54:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:35,504 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-11-07 04:54:35,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:54:35,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-07 04:54:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:35,515 INFO L225 Difference]: With dead ends: 41 [2018-11-07 04:54:35,516 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 04:54:35,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:54:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 04:54:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-07 04:54:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 04:54:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-07 04:54:35,559 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-11-07 04:54:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:35,560 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-07 04:54:35,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:54:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-07 04:54:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 04:54:35,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:35,562 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:35,562 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:35,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:35,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1174697053, now seen corresponding path program 1 times [2018-11-07 04:54:35,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:35,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:35,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:35,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:35,565 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:35,666 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 04:54:35,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:54:35,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 04:54:35,667 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:54:35,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:54:35,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:54:35,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 04:54:35,670 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-11-07 04:54:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:35,884 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-07 04:54:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:54:35,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-07 04:54:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:35,888 INFO L225 Difference]: With dead ends: 39 [2018-11-07 04:54:35,888 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 04:54:35,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:54:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 04:54:35,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 04:54:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 04:54:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-07 04:54:35,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 13 [2018-11-07 04:54:35,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:35,901 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-07 04:54:35,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:54:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-07 04:54:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 04:54:35,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:35,904 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:35,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:35,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash -494238111, now seen corresponding path program 1 times [2018-11-07 04:54:35,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:35,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:35,907 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:54:36,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:36,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:36,101 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-07 04:54:36,103 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [17], [19], [21], [27], [30], [32], [35], [37], [38], [39], [40], [42], [43] [2018-11-07 04:54:36,159 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:54:36,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:54:36,274 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:54:37,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:54:37,016 INFO L272 AbstractInterpreter]: Visited 17 different actions 331 times. Merged at 6 different actions 113 times. Widened at 1 different actions 13 times. Found 17 fixpoints after 2 different actions. Largest state had 7 variables. [2018-11-07 04:54:37,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:37,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:54:37,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:37,062 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 04:54:37,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:37,086 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:54:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:37,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:54:37,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:54:37,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:37,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 04:54:37,280 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:37,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 04:54:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 04:54:37,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:54:37,282 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2018-11-07 04:54:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:37,340 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-07 04:54:37,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:54:37,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-07 04:54:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:37,343 INFO L225 Difference]: With dead ends: 54 [2018-11-07 04:54:37,343 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 04:54:37,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:54:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 04:54:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 04:54:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 04:54:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-07 04:54:37,355 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2018-11-07 04:54:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:37,357 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-07 04:54:37,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 04:54:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-07 04:54:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 04:54:37,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:37,360 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:37,360 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:37,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2135506589, now seen corresponding path program 2 times [2018-11-07 04:54:37,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:37,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:37,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:37,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:37,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:54:37,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:37,530 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:37,530 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:37,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:37,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:37,531 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 04:54:37,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:54:37,546 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:54:37,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:54:37,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:37,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:54:37,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:54:37,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:37,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 04:54:37,843 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:37,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:54:37,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:54:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:54:37,845 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2018-11-07 04:54:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:37,979 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-07 04:54:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:54:37,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-07 04:54:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:37,982 INFO L225 Difference]: With dead ends: 50 [2018-11-07 04:54:37,982 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 04:54:37,983 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:54:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 04:54:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-07 04:54:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 04:54:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-07 04:54:37,992 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 31 [2018-11-07 04:54:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:37,992 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-07 04:54:37,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:54:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-07 04:54:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-07 04:54:37,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:37,994 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:37,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:37,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash -374355807, now seen corresponding path program 3 times [2018-11-07 04:54:37,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:37,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:54:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:37,996 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 04:54:38,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:38,319 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:38,319 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:38,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:38,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:38,320 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 04:54:38,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:54:38,334 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:54:38,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:54:38,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:38,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 04:54:38,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 04:54:38,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:38,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 04:54:38,617 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:38,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:54:38,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:54:38,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:54:38,620 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-07 04:54:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:39,003 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-07 04:54:39,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:54:39,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-07 04:54:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:39,005 INFO L225 Difference]: With dead ends: 55 [2018-11-07 04:54:39,006 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 04:54:39,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:54:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 04:54:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-07 04:54:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 04:54:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-07 04:54:39,016 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2018-11-07 04:54:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:39,016 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-07 04:54:39,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:54:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-07 04:54:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 04:54:39,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:39,019 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:39,019 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:39,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:39,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1263007965, now seen corresponding path program 4 times [2018-11-07 04:54:39,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:39,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:39,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:54:39,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:39,021 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 04:54:39,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:39,181 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:39,181 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:39,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:39,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:39,181 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 04:54:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:39,190 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:54:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:39,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 04:54:39,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 04:54:39,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:39,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 04:54:39,552 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:39,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 04:54:39,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 04:54:39,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:54:39,554 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-11-07 04:54:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:39,668 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-07 04:54:39,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:54:39,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-07 04:54:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:39,671 INFO L225 Difference]: With dead ends: 60 [2018-11-07 04:54:39,671 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 04:54:39,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:54:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 04:54:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 04:54:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 04:54:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-07 04:54:39,680 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 49 [2018-11-07 04:54:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:39,681 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-07 04:54:39,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 04:54:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-07 04:54:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 04:54:39,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:39,683 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:39,684 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:39,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1453262111, now seen corresponding path program 5 times [2018-11-07 04:54:39,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:39,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:39,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:39,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:39,686 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 04:54:39,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:39,923 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:39,923 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:39,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:39,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:39,924 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 04:54:39,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:54:39,932 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:54:40,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 04:54:40,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:40,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 04:54:40,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 04:54:41,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:41,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 04:54:41,010 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:41,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:54:41,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:54:41,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-07 04:54:41,011 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 8 states. [2018-11-07 04:54:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:41,211 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-07 04:54:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:54:41,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-07 04:54:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:41,213 INFO L225 Difference]: With dead ends: 65 [2018-11-07 04:54:41,213 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 04:54:41,214 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-07 04:54:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 04:54:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-07 04:54:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-07 04:54:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-07 04:54:41,223 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 58 [2018-11-07 04:54:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:41,223 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-07 04:54:41,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:54:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-07 04:54:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-07 04:54:41,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:41,226 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:41,226 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:41,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:41,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1989893347, now seen corresponding path program 6 times [2018-11-07 04:54:41,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:41,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:41,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:54:41,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:41,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 04:54:41,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:41,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:41,459 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:41,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:41,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:41,459 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 04:54:41,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:54:41,470 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:54:41,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:54:41,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:41,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 04:54:41,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 04:54:41,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:41,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 04:54:41,812 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:41,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:54:41,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:54:41,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:54:41,813 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 9 states. [2018-11-07 04:54:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:42,140 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-07 04:54:42,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 04:54:42,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-07 04:54:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:42,142 INFO L225 Difference]: With dead ends: 70 [2018-11-07 04:54:42,143 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 04:54:42,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:54:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 04:54:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-07 04:54:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 04:54:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-11-07 04:54:42,152 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 67 [2018-11-07 04:54:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:42,153 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-11-07 04:54:42,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:54:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-07 04:54:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-07 04:54:42,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:42,155 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:42,155 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:42,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash -259908319, now seen corresponding path program 7 times [2018-11-07 04:54:42,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:42,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:42,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:54:42,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:42,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:42,396 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 04:54:42,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:42,396 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:42,396 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:42,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:42,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:42,397 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 04:54:42,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:42,407 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:54:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:42,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 04:54:42,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 04:54:42,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:42,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 04:54:42,836 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:42,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 04:54:42,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 04:54:42,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:54:42,840 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 10 states. [2018-11-07 04:54:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:43,111 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-11-07 04:54:43,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 04:54:43,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2018-11-07 04:54:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:43,114 INFO L225 Difference]: With dead ends: 75 [2018-11-07 04:54:43,115 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 04:54:43,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:54:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 04:54:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-07 04:54:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 04:54:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-11-07 04:54:43,124 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 76 [2018-11-07 04:54:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:43,125 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-11-07 04:54:43,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 04:54:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-07 04:54:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-07 04:54:43,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:43,127 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:43,127 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:43,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:43,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2013053603, now seen corresponding path program 8 times [2018-11-07 04:54:43,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:43,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:43,129 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 04:54:43,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:43,396 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:43,396 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:43,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:43,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:43,396 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 04:54:43,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:54:43,407 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:54:45,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 04:54:45,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:45,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 04:54:45,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 04:54:47,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:47,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 12] total 28 [2018-11-07 04:54:47,032 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:47,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 04:54:47,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 04:54:47,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2018-11-07 04:54:47,034 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 18 states. [2018-11-07 04:54:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:47,413 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-07 04:54:47,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 04:54:47,413 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 85 [2018-11-07 04:54:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:47,415 INFO L225 Difference]: With dead ends: 80 [2018-11-07 04:54:47,416 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 04:54:47,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2018-11-07 04:54:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 04:54:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-07 04:54:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 04:54:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-11-07 04:54:47,428 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 85 [2018-11-07 04:54:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:47,429 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-11-07 04:54:47,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 04:54:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-11-07 04:54:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-07 04:54:47,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:47,431 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:47,431 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:47,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:47,432 INFO L82 PathProgramCache]: Analyzing trace with hash 485961569, now seen corresponding path program 9 times [2018-11-07 04:54:47,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:47,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:47,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:54:47,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:47,433 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 04:54:47,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:47,906 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:47,906 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:47,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:47,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:47,907 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:54:47,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:54:47,917 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:54:47,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:54:47,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:47,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 04:54:48,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-07 04:54:48,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:48,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 04:54:48,415 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:48,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 04:54:48,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 04:54:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-11-07 04:54:48,416 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 12 states. [2018-11-07 04:54:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:48,697 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2018-11-07 04:54:48,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 04:54:48,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-07 04:54:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:48,699 INFO L225 Difference]: With dead ends: 85 [2018-11-07 04:54:48,699 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 04:54:48,700 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-11-07 04:54:48,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 04:54:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-07 04:54:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-07 04:54:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2018-11-07 04:54:48,709 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 94 [2018-11-07 04:54:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:48,710 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2018-11-07 04:54:48,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 04:54:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2018-11-07 04:54:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 04:54:48,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:48,712 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:48,712 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:48,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:48,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1149749149, now seen corresponding path program 10 times [2018-11-07 04:54:48,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:48,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:48,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:54:48,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:48,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 04:54:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 04:54:48,813 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 04:54:48,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:54:48 BoogieIcfgContainer [2018-11-07 04:54:48,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 04:54:48,863 INFO L168 Benchmark]: Toolchain (without parser) took 14860.19 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 876.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -704.3 MB). Peak memory consumption was 172.3 MB. Max. memory is 7.1 GB. [2018-11-07 04:54:48,868 INFO L168 Benchmark]: CDTParser took 0.50 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 04:54:48,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.94 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 04:54:48,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.71 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 04:54:48,870 INFO L168 Benchmark]: Boogie Preprocessor took 30.16 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 04:54:48,871 INFO L168 Benchmark]: RCFGBuilder took 435.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 04:54:48,871 INFO L168 Benchmark]: TraceAbstraction took 14077.64 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 163.1 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 220.5 MB. Max. memory is 7.1 GB. [2018-11-07 04:54:48,878 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.50 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. * CACSL2BoogieTranslator took 286.94 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 25.71 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 30.16 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 435.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14077.64 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 163.1 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 57.5 MB). Peak memory consumption was 220.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; VAL [loop1=2, n1=3, sn=0, x=0] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=0, x=0] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=2, x=0] [L17] x++ VAL [loop1=2, n1=3, sn=2, x=1] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=2, x=1] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=2, x=1] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=4, x=1] [L17] x++ VAL [loop1=2, n1=3, sn=4, x=2] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=4, x=2] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=4, x=2] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=6, x=2] [L17] x++ VAL [loop1=2, n1=3, sn=6, x=3] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=6, x=3] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=6, x=3] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=8, x=3] [L17] x++ VAL [loop1=2, n1=3, sn=8, x=4] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=8, x=4] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=8, x=4] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=10, x=4] [L17] x++ VAL [loop1=2, n1=3, sn=10, x=5] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=10, x=5] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=10, x=5] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=12, x=5] [L17] x++ VAL [loop1=2, n1=3, sn=12, x=6] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=12, x=6] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=12, x=6] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=14, x=6] [L17] x++ VAL [loop1=2, n1=3, sn=14, x=7] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=14, x=7] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=14, x=7] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=16, x=7] [L17] x++ VAL [loop1=2, n1=3, sn=16, x=8] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=16, x=8] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=16, x=8] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=18, x=8] [L17] x++ VAL [loop1=2, n1=3, sn=18, x=9] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=18, x=9] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=18, x=9] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=20, x=9] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=10] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=20, x=10] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=20, x=10] [L14] COND FALSE !(x<10) VAL [loop1=2, n1=3, sn=20, x=10] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=11] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 13.9s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 337 SDtfs, 20 SDslu, 1764 SDs, 0 SdLazy, 1322 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1130 GetRequests, 986 SyntacticMatches, 19 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1563 ConstructedInterpolants, 0 QuantifiedInterpolants, 431367 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1008 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 1980/4185 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...