java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b6335f6 [2018-10-23 09:59:31,020 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 09:59:31,022 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 09:59:31,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 09:59:31,037 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 09:59:31,038 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 09:59:31,041 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 09:59:31,043 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 09:59:31,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 09:59:31,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 09:59:31,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 09:59:31,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 09:59:31,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 09:59:31,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 09:59:31,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 09:59:31,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 09:59:31,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 09:59:31,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 09:59:31,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 09:59:31,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 09:59:31,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 09:59:31,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 09:59:31,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 09:59:31,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 09:59:31,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 09:59:31,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 09:59:31,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 09:59:31,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 09:59:31,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 09:59:31,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 09:59:31,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 09:59:31,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 09:59:31,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 09:59:31,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 09:59:31,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 09:59:31,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 09:59:31,071 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-23 09:59:31,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 09:59:31,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 09:59:31,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 09:59:31,090 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-23 09:59:31,090 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-23 09:59:31,090 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-23 09:59:31,090 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-23 09:59:31,090 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-23 09:59:31,091 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-23 09:59:31,092 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-23 09:59:31,092 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-23 09:59:31,092 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-23 09:59:31,093 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 09:59:31,093 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 09:59:31,093 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 09:59:31,093 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 09:59:31,093 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 09:59:31,095 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 09:59:31,095 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 09:59:31,095 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 09:59:31,095 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 09:59:31,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 09:59:31,096 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 09:59:31,096 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 09:59:31,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 09:59:31,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 09:59:31,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 09:59:31,097 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 09:59:31,097 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-23 09:59:31,098 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 09:59:31,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 09:59:31,098 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 09:59:31,098 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 09:59:31,098 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-23 09:59:31,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 09:59:31,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 09:59:31,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 09:59:31,165 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 09:59:31,166 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 09:59:31,167 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-23 09:59:31,228 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/08450cce7/8884467445a9422a87aacb03b315155d/FLAG8174a881d [2018-10-23 09:59:31,719 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 09:59:31,720 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-10-23 09:59:31,727 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/08450cce7/8884467445a9422a87aacb03b315155d/FLAG8174a881d [2018-10-23 09:59:31,743 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/08450cce7/8884467445a9422a87aacb03b315155d [2018-10-23 09:59:31,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 09:59:31,758 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 09:59:31,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 09:59:31,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 09:59:31,766 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 09:59:31,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:59:31" (1/1) ... [2018-10-23 09:59:31,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@783591fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:31, skipping insertion in model container [2018-10-23 09:59:31,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:59:31" (1/1) ... [2018-10-23 09:59:31,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 09:59:31,807 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 09:59:32,007 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 09:59:32,011 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 09:59:32,046 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 09:59:32,074 INFO L193 MainTranslator]: Completed translation [2018-10-23 09:59:32,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32 WrapperNode [2018-10-23 09:59:32,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 09:59:32,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 09:59:32,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 09:59:32,076 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 09:59:32,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (1/1) ... [2018-10-23 09:59:32,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (1/1) ... [2018-10-23 09:59:32,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 09:59:32,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 09:59:32,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 09:59:32,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 09:59:32,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (1/1) ... [2018-10-23 09:59:32,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (1/1) ... [2018-10-23 09:59:32,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (1/1) ... [2018-10-23 09:59:32,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (1/1) ... [2018-10-23 09:59:32,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (1/1) ... [2018-10-23 09:59:32,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (1/1) ... [2018-10-23 09:59:32,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (1/1) ... [2018-10-23 09:59:32,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 09:59:32,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 09:59:32,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 09:59:32,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 09:59:32,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 09:59:32,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-23 09:59:32,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-23 09:59:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 09:59:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 09:59:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-23 09:59:32,335 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-23 09:59:32,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-23 09:59:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-23 09:59:32,827 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 09:59:32,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:59:32 BoogieIcfgContainer [2018-10-23 09:59:32,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 09:59:32,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 09:59:32,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 09:59:32,832 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 09:59:32,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:59:31" (1/3) ... [2018-10-23 09:59:32,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583df0ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:59:32, skipping insertion in model container [2018-10-23 09:59:32,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:59:32" (2/3) ... [2018-10-23 09:59:32,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583df0ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:59:32, skipping insertion in model container [2018-10-23 09:59:32,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:59:32" (3/3) ... [2018-10-23 09:59:32,837 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-10-23 09:59:32,847 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 09:59:32,856 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 09:59:32,875 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 09:59:32,910 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 09:59:32,910 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 09:59:32,910 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 09:59:32,911 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 09:59:32,911 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 09:59:32,911 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 09:59:32,911 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 09:59:32,911 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 09:59:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-10-23 09:59:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-23 09:59:32,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:59:32,937 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:59:32,940 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:59:32,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:59:32,947 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-10-23 09:59:32,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 09:59:33,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:33,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:59:33,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:33,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 09:59:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:59:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:59:33,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:59:33,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 09:59:33,066 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 09:59:33,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-23 09:59:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-23 09:59:33,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-23 09:59:33,091 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-23 09:59:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:59:33,135 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-10-23 09:59:33,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-23 09:59:33,137 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-10-23 09:59:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:59:33,149 INFO L225 Difference]: With dead ends: 39 [2018-10-23 09:59:33,149 INFO L226 Difference]: Without dead ends: 22 [2018-10-23 09:59:33,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-23 09:59:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-23 09:59:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-23 09:59:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-23 09:59:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-10-23 09:59:33,196 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-10-23 09:59:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:59:33,197 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-10-23 09:59:33,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-23 09:59:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-10-23 09:59:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-23 09:59:33,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:59:33,198 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:59:33,199 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:59:33,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:59:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-10-23 09:59:33,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 09:59:33,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:33,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:59:33,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:33,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 09:59:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:59:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:59:33,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:59:33,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 09:59:33,373 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 09:59:33,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 09:59:33,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 09:59:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 09:59:33,376 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-10-23 09:59:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:59:33,580 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-10-23 09:59:33,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 09:59:33,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-23 09:59:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:59:33,583 INFO L225 Difference]: With dead ends: 30 [2018-10-23 09:59:33,583 INFO L226 Difference]: Without dead ends: 25 [2018-10-23 09:59:33,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 09:59:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-23 09:59:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-10-23 09:59:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-23 09:59:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-23 09:59:33,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-10-23 09:59:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:59:33,592 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-23 09:59:33,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 09:59:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-23 09:59:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-23 09:59:33,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:59:33,593 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:59:33,594 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:59:33,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:59:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-10-23 09:59:33,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 09:59:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:33,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:59:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:33,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 09:59:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:59:35,756 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-10-23 09:59:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:59:35,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:59:35,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 09:59:35,762 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 09:59:35,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 09:59:35,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 09:59:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 09:59:35,763 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-10-23 09:59:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:59:36,125 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-10-23 09:59:36,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 09:59:36,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-23 09:59:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:59:36,128 INFO L225 Difference]: With dead ends: 54 [2018-10-23 09:59:36,128 INFO L226 Difference]: Without dead ends: 37 [2018-10-23 09:59:36,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 09:59:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-23 09:59:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-23 09:59:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-23 09:59:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-10-23 09:59:36,136 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-10-23 09:59:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:59:36,136 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-10-23 09:59:36,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 09:59:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-10-23 09:59:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-23 09:59:36,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:59:36,138 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:59:36,138 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:59:36,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:59:36,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-10-23 09:59:36,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 09:59:36,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:36,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:59:36,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:36,140 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 09:59:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:59:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:59:36,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 09:59:36,761 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 09:59:36,763 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-23 09:59:36,765 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [23], [29], [35], [41], [47], [53], [59], [65], [71], [80], [83], [85], [91], [92], [93], [95] [2018-10-23 09:59:36,817 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-23 09:59:36,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-23 09:59:36,930 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-23 09:59:37,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-23 09:59:37,822 INFO L272 AbstractInterpreter]: Visited 22 different actions 133 times. Merged at 13 different actions 89 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-10-23 09:59:37,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:59:37,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-23 09:59:37,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 09:59:37,868 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 09:59:37,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:59:37,885 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-23 09:59:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:59:37,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 09:59:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:59:37,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 09:59:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:59:40,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 09:59:40,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-10-23 09:59:40,685 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 09:59:40,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-23 09:59:40,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-23 09:59:40,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-23 09:59:40,689 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-10-23 09:59:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:59:41,128 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-10-23 09:59:41,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-23 09:59:41,131 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-10-23 09:59:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:59:41,132 INFO L225 Difference]: With dead ends: 54 [2018-10-23 09:59:41,132 INFO L226 Difference]: Without dead ends: 49 [2018-10-23 09:59:41,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-10-23 09:59:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-23 09:59:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-23 09:59:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-23 09:59:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-10-23 09:59:41,140 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-10-23 09:59:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:59:41,141 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-10-23 09:59:41,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-23 09:59:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-10-23 09:59:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-23 09:59:41,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:59:41,142 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:59:41,143 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:59:41,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:59:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-10-23 09:59:41,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 09:59:41,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:41,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:59:41,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:41,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 09:59:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:59:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:59:41,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:59:41,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 09:59:41,204 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 09:59:41,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 09:59:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 09:59:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 09:59:41,207 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-10-23 09:59:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:59:41,326 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-10-23 09:59:41,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 09:59:41,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-23 09:59:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:59:41,329 INFO L225 Difference]: With dead ends: 66 [2018-10-23 09:59:41,329 INFO L226 Difference]: Without dead ends: 49 [2018-10-23 09:59:41,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 09:59:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-23 09:59:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-23 09:59:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-23 09:59:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-10-23 09:59:41,339 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-10-23 09:59:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:59:41,339 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-10-23 09:59:41,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 09:59:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-10-23 09:59:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-23 09:59:41,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:59:41,343 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:59:41,343 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:59:41,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:59:41,344 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-10-23 09:59:41,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 09:59:41,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:41,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:59:41,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:59:41,345 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 09:59:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:59:43,582 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-10-23 09:59:57,786 WARN L179 SmtUtils]: Spent 14.13 s on a formula simplification. DAG size of input: 54 DAG size of output: 17 [2018-10-23 10:00:10,074 WARN L179 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2018-10-23 10:00:16,187 WARN L179 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 19 [2018-10-23 10:00:18,200 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-10-23 10:00:20,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (< (* 4294967296 (div c_main_~x~0 4294967296)) (+ c_main_~x~0 1)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-10-23 10:00:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-10-23 10:00:20,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:20,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:00:20,241 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-23 10:00:20,241 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [25], [31], [37], [43], [49], [55], [61], [67], [73], [80], [83], [85], [91], [92], [93], [95] [2018-10-23 10:00:20,244 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-23 10:00:20,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-23 10:00:20,254 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-23 10:00:20,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-23 10:00:20,338 INFO L272 AbstractInterpreter]: Visited 22 different actions 25 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-10-23 10:00:20,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:20,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-23 10:00:20,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:20,383 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:00:20,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:20,399 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-23 10:00:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:20,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:00:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:21,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:00:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:21,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:00:21,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6] total 19 [2018-10-23 10:00:21,409 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:00:21,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-23 10:00:21,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-23 10:00:21,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=202, Unknown=5, NotChecked=90, Total=342 [2018-10-23 10:00:21,410 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 15 states. [2018-10-23 10:00:23,647 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse15 (div c_main_~y~0 2))) (let ((.cse13 (* (- 2) .cse15)) (.cse9 (* 2 .cse15))) (let ((.cse14 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse11 (div (+ c_main_~y~0 .cse13) 4294967296))) (let ((.cse12 (* 4294967296 .cse11)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse14)) (.cse5 (<= .cse14 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse13 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 .cse12))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))) (<= (+ .cse9 .cse12 1) c_main_~y~0))))))) is different from false [2018-10-23 10:00:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:00:31,861 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-10-23 10:00:31,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-23 10:00:31,862 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-10-23 10:00:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:00:31,863 INFO L225 Difference]: With dead ends: 67 [2018-10-23 10:00:31,863 INFO L226 Difference]: Without dead ends: 36 [2018-10-23 10:00:31,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 49.7s TimeCoverageRelationStatistics Valid=53, Invalid=229, Unknown=6, NotChecked=132, Total=420 [2018-10-23 10:00:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-23 10:00:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-23 10:00:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-23 10:00:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-23 10:00:31,869 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2018-10-23 10:00:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:00:31,870 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-23 10:00:31,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-23 10:00:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-23 10:00:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-23 10:00:31,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:31,871 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:31,872 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:31,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:31,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1929479972, now seen corresponding path program 2 times [2018-10-23 10:00:31,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:31,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:31,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:31,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:31,874 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:32,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:32,665 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:00:32,665 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-23 10:00:32,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-23 10:00:32,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:32,666 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:00:32,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 10:00:32,675 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-23 10:00:32,711 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 10:00:32,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 10:00:32,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:00:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:32,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:00:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:44,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:00:44,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-10-23 10:00:44,741 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:00:44,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-23 10:00:44,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-23 10:00:44,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-10-23 10:00:44,743 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2018-10-23 10:00:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:00:45,604 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-23 10:00:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-23 10:00:45,604 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-10-23 10:00:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:00:45,605 INFO L225 Difference]: With dead ends: 54 [2018-10-23 10:00:45,605 INFO L226 Difference]: Without dead ends: 49 [2018-10-23 10:00:45,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-10-23 10:00:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-23 10:00:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-23 10:00:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-23 10:00:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-23 10:00:45,612 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 35 [2018-10-23 10:00:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:00:45,613 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-23 10:00:45,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-23 10:00:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-23 10:00:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-23 10:00:45,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:45,614 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:45,615 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:45,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:45,615 INFO L82 PathProgramCache]: Analyzing trace with hash 2033787552, now seen corresponding path program 3 times [2018-10-23 10:00:45,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:45,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:45,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 10:00:45,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:45,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:47,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:47,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:00:47,083 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-23 10:00:47,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-23 10:00:47,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:47,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:00:47,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 10:00:47,093 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-23 10:00:47,134 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 10:00:47,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 10:00:47,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:00:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:47,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:01:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:06,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:01:06,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-10-23 10:01:06,631 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:01:06,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-23 10:01:06,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-23 10:01:06,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-10-23 10:01:06,634 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2018-10-23 10:01:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:01:07,747 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-23 10:01:07,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-23 10:01:07,748 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-10-23 10:01:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:01:07,749 INFO L225 Difference]: With dead ends: 66 [2018-10-23 10:01:07,749 INFO L226 Difference]: Without dead ends: 61 [2018-10-23 10:01:07,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-10-23 10:01:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-23 10:01:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-23 10:01:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-23 10:01:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-23 10:01:07,757 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 47 [2018-10-23 10:01:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:01:07,757 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-23 10:01:07,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-23 10:01:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-23 10:01:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-23 10:01:07,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:01:07,759 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:01:07,760 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:01:07,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:01:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash -99662236, now seen corresponding path program 4 times [2018-10-23 10:01:07,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:01:07,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:07,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 10:01:07,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:07,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:01:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:01:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:08,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:01:08,892 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:01:08,893 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-23 10:01:08,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-23 10:01:08,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:01:08,893 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:01:08,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:01:08,901 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-23 10:01:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:01:08,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:01:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:09,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:01:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:34,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:01:34,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-10-23 10:01:34,367 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:01:34,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-23 10:01:34,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-23 10:01:34,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-10-23 10:01:34,370 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 43 states. [2018-10-23 10:01:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:01:36,193 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-23 10:01:36,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-23 10:01:36,193 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-10-23 10:01:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:01:36,195 INFO L225 Difference]: With dead ends: 78 [2018-10-23 10:01:36,195 INFO L226 Difference]: Without dead ends: 73 [2018-10-23 10:01:36,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-10-23 10:01:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-23 10:01:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-23 10:01:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-23 10:01:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-23 10:01:36,204 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2018-10-23 10:01:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:01:36,205 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-23 10:01:36,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-23 10:01:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-23 10:01:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-23 10:01:36,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:01:36,207 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:01:36,207 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:01:36,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:01:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1880745000, now seen corresponding path program 5 times [2018-10-23 10:01:36,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:01:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:01:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:36,208 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:01:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:01:38,691 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2018-10-23 10:01:40,844 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:01:43,017 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:01:49,109 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:01:51,323 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:01:55,470 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:01:57,655 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:01,748 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:05,836 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:07,927 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:12,034 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:14,151 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:16,252 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:18,361 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:20,610 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:22,725 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:24,859 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:27,100 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:31,234 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:33,510 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:35,663 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:37,810 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:41,946 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:44,244 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:46,425 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:50,562 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:52,705 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:56,995 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:02:59,149 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:03:01,305 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:03:05,611 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:03:08,096 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:03:12,264 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:03:14,443 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:03:16,608 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:03:21,006 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-10-23 10:03:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:03:21,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:03:21,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:03:21,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-23 10:03:21,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-23 10:03:21,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:03:21,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:03:21,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 10:03:21,478 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-23 10:03:21,525 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 10:03:21,525 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 10:03:21,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:03:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:03:21,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:03:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-23 10:03:22,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:03:22,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6] total 59 [2018-10-23 10:03:22,337 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:03:22,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-23 10:03:22,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-23 10:03:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3204, Unknown=0, NotChecked=0, Total=3422 [2018-10-23 10:03:22,340 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 55 states. [2018-10-23 10:03:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:03:25,552 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-10-23 10:03:25,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-23 10:03:25,553 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 71 [2018-10-23 10:03:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:03:25,554 INFO L225 Difference]: With dead ends: 87 [2018-10-23 10:03:25,554 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 10:03:25,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 105.8s TimeCoverageRelationStatistics Valid=224, Invalid=3316, Unknown=0, NotChecked=0, Total=3540 [2018-10-23 10:03:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 10:03:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 10:03:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 10:03:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 10:03:25,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-10-23 10:03:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:03:25,557 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 10:03:25,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-23 10:03:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 10:03:25,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 10:03:25,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 10:03:25,896 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-10-23 10:03:25,920 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-23 10:03:25,920 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-23 10:03:25,920 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 10:03:25,920 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-23 10:03:25,920 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-23 10:03:25,920 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 10:03:25,921 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse1 (+ .cse3 main_~x~0 .cse4)) (.cse0 (= (+ .cse3 .cse4) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse0 (<= main_~x~0 20)) (and (<= .cse1 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (and (<= .cse1 (+ main_~y~0 40)) .cse0 (<= 40 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse3 .cse4 1) main_~y~0))) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0))))) [2018-10-23 10:03:25,921 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-10-23 10:03:25,921 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-10-23 10:03:25,921 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-10-23 10:03:25,921 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-10-23 10:03:25,921 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-10-23 10:03:25,921 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-10-23 10:03:25,921 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 33) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse0 (* 2 .cse3)) (.cse1 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (or (and (<= main_~y~0 (+ .cse0 .cse1)) (<= (+ .cse0 main_~x~0 .cse1) (+ main_~y~0 100)) (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse0 .cse1 1) main_~y~0)))))) [2018-10-23 10:03:25,921 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-10-23 10:03:25,921 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-10-23 10:03:25,921 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-10-23 10:03:25,922 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-10-23 10:03:25,922 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-10-23 10:03:25,922 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-10-23 10:03:25,922 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-10-23 10:03:25,922 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-10-23 10:03:25,922 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-23 10:03:25,922 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-23 10:03:25,922 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-23 10:03:25,922 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-23 10:03:25,922 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-23 10:03:25,922 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-23 10:03:25,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:03:25 BoogieIcfgContainer [2018-10-23 10:03:25,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 10:03:25,938 INFO L168 Benchmark]: Toolchain (without parser) took 234181.40 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 946.9 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -942.5 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2018-10-23 10:03:25,939 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:03:25,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.50 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-10-23 10:03:25,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:03:25,941 INFO L168 Benchmark]: Boogie Preprocessor took 53.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:03:25,941 INFO L168 Benchmark]: RCFGBuilder took 657.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-10-23 10:03:25,942 INFO L168 Benchmark]: TraceAbstraction took 233108.41 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 190.3 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -146.4 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2018-10-23 10:03:25,947 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 315.50 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 657.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 233108.41 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 190.3 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -146.4 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((x <= 0 && 0 <= x) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) + 1 <= y)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 233.0s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 211 SDtfs, 27 SDslu, 1948 SDs, 0 SdLazy, 7252 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 715 GetRequests, 408 SyntacticMatches, 19 SemanticMatches, 288 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 220.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 289 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 184 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 211.6s InterpolantComputationTime, 583 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 819 ConstructedInterpolants, 6 QuantifiedInterpolants, 587163 SizeOfPredicates, 10 NumberOfNonLiveVariables, 812 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 120/820 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...