java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/const_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:36:25,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:36:25,767 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:36:25,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:36:25,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:36:25,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:36:25,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:36:25,793 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:36:25,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:36:25,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:36:25,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:36:25,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:36:25,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:36:25,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:36:25,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:36:25,813 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:36:25,814 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:36:25,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:36:25,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:36:25,826 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:36:25,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:36:25,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:36:25,834 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:36:25,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:36:25,835 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:36:25,835 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:36:25,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:36:25,839 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:36:25,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:36:25,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:36:25,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:36:25,845 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:36:25,845 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:36:25,845 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:36:25,846 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:36:25,848 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:36:25,848 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:36:25,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:36:25,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:36:25,869 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:36:25,869 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:36:25,869 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:36:25,869 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:36:25,869 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:36:25,872 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:36:25,872 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:36:25,872 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:36:25,872 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:36:25,872 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:36:25,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:36:25,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:36:25,874 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:36:25,874 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:36:25,874 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:36:25,874 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:36:25,874 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:36:25,875 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:36:25,875 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:36:25,875 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:36:25,875 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:36:25,875 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:36:25,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:36:25,876 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:36:25,876 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:36:25,876 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:36:25,876 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:36:25,877 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:36:25,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:36:25,877 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:36:25,877 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:36:25,877 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:36:25,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:36:25,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:36:25,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:36:25,968 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:36:25,969 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:36:25,970 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_false-unreach-call1.i [2018-11-07 16:36:26,032 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611b83c6b/4737477a389f45f9b56628959c57b058/FLAGc7955d651 [2018-11-07 16:36:26,495 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:36:26,496 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_false-unreach-call1.i [2018-11-07 16:36:26,503 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611b83c6b/4737477a389f45f9b56628959c57b058/FLAGc7955d651 [2018-11-07 16:36:26,518 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611b83c6b/4737477a389f45f9b56628959c57b058 [2018-11-07 16:36:26,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:36:26,530 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:36:26,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:36:26,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:36:26,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:36:26,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c639f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26, skipping insertion in model container [2018-11-07 16:36:26,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:36:26,577 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:36:26,790 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:36:26,794 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:36:26,807 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:36:26,819 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:36:26,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26 WrapperNode [2018-11-07 16:36:26,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:36:26,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:36:26,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:36:26,820 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:36:26,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:36:26,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:36:26,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:36:26,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:36:26,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (1/1) ... [2018-11-07 16:36:26,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:36:26,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:36:26,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:36:26,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:36:26,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:36:26,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:36:26,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:36:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:36:26,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:36:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:36:26,976 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:36:26,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:36:26,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:36:27,165 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:36:27,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:36:27 BoogieIcfgContainer [2018-11-07 16:36:27,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:36:27,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:36:27,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:36:27,170 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:36:27,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:36:26" (1/3) ... [2018-11-07 16:36:27,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd1b9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:36:27, skipping insertion in model container [2018-11-07 16:36:27,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:36:26" (2/3) ... [2018-11-07 16:36:27,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd1b9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:36:27, skipping insertion in model container [2018-11-07 16:36:27,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:36:27" (3/3) ... [2018-11-07 16:36:27,174 INFO L112 eAbstractionObserver]: Analyzing ICFG const_false-unreach-call1.i [2018-11-07 16:36:27,184 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:36:27,192 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:36:27,210 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:36:27,239 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:36:27,240 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:36:27,240 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:36:27,240 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:36:27,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:36:27,240 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:36:27,240 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:36:27,241 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:36:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-07 16:36:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:36:27,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:27,265 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:27,267 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:27,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:27,274 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-07 16:36:27,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:27,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:27,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:27,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:27,330 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:27,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:36:27,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:36:27,386 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:36:27,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:36:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:36:27,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:36:27,410 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-07 16:36:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:27,433 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-07 16:36:27,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:36:27,435 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:36:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:27,443 INFO L225 Difference]: With dead ends: 29 [2018-11-07 16:36:27,443 INFO L226 Difference]: Without dead ends: 12 [2018-11-07 16:36:27,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:36:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-07 16:36:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-07 16:36:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-07 16:36:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-07 16:36:27,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-07 16:36:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:27,483 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-07 16:36:27,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:36:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-07 16:36:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 16:36:27,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:27,484 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:27,484 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:27,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:27,485 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-07 16:36:27,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:27,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:27,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:27,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:27,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:27,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:36:27,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:36:27,630 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:36:27,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:36:27,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:36:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:36:27,634 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-07 16:36:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:27,680 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-07 16:36:27,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:36:27,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 16:36:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:27,682 INFO L225 Difference]: With dead ends: 19 [2018-11-07 16:36:27,682 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 16:36:27,684 INFO L604 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-11-07 16:36:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 16:36:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 16:36:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 16:36:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-07 16:36:27,688 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-07 16:36:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:27,689 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-07 16:36:27,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:36:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-07 16:36:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 16:36:27,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:27,690 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:27,690 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:27,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:27,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-07 16:36:27,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:27,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:27,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:27,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:27,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:27,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:27,849 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:27,851 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-07 16:36:27,853 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-11-07 16:36:27,894 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:36:27,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:36:28,063 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:36:28,251 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:36:28,253 INFO L272 AbstractInterpreter]: Visited 12 different actions 53 times. Merged at 3 different actions 19 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-07 16:36:28,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:28,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:36:28,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:28,302 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:28,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:28,318 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:36:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:28,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:28,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:28,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:28,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 16:36:28,557 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:28,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:36:28,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:36:28,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:36:28,559 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-11-07 16:36:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:28,593 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 16:36:28,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:36:28,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-07 16:36:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:28,595 INFO L225 Difference]: With dead ends: 21 [2018-11-07 16:36:28,595 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 16:36:28,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:36:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 16:36:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 16:36:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 16:36:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-07 16:36:28,600 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-07 16:36:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:28,600 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-07 16:36:28,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:36:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-07 16:36:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 16:36:28,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:28,602 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:28,602 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:28,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-07 16:36:28,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:28,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:28,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:28,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:28,604 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:28,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:28,738 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:28,738 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:28,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:28,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:28,739 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:28,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:36:28,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:36:28,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:36:28,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:36:28,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:28,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:29,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:29,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 16:36:29,443 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:29,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:36:29,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:36:29,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:36:29,445 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-11-07 16:36:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:29,485 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-07 16:36:29,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:36:29,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 16:36:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:29,487 INFO L225 Difference]: With dead ends: 23 [2018-11-07 16:36:29,487 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 16:36:29,488 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:36:29,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 16:36:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 16:36:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 16:36:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 16:36:29,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-07 16:36:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:29,493 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 16:36:29,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:36:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 16:36:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:36:29,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:29,495 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:29,495 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:29,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:29,496 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-07 16:36:29,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:29,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:29,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:36:29,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:29,497 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:29,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:29,650 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:29,650 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:29,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:29,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:29,650 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:29,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:36:29,662 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:36:29,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:36:29,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:36:29,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:29,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:30,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:30,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 16:36:30,541 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:30,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:36:30,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:36:30,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:36:30,543 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-07 16:36:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:30,583 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-07 16:36:30,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:36:30,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 16:36:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:30,585 INFO L225 Difference]: With dead ends: 25 [2018-11-07 16:36:30,585 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 16:36:30,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:36:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 16:36:30,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 16:36:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 16:36:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-07 16:36:30,590 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-07 16:36:30,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:30,591 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-07 16:36:30,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:36:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-07 16:36:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:36:30,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:30,592 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:30,592 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:30,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:30,593 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-07 16:36:30,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:30,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:30,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:36:30,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:30,595 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:30,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:30,769 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:30,770 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:30,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:30,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:30,770 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:30,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:30,788 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:36:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:30,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:30,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:31,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:31,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 16:36:31,794 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:31,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:36:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:36:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:36:31,796 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-11-07 16:36:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:31,837 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 16:36:31,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:36:31,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 16:36:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:31,839 INFO L225 Difference]: With dead ends: 27 [2018-11-07 16:36:31,839 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 16:36:31,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:36:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 16:36:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 16:36:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 16:36:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-07 16:36:31,844 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-07 16:36:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:31,845 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-07 16:36:31,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:36:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-07 16:36:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 16:36:31,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:31,846 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:31,846 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:31,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-07 16:36:31,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:31,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:31,848 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:32,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:32,016 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:32,017 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:32,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:32,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:32,017 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:32,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:36:32,026 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:36:32,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:36:32,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:36:32,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:32,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:34,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:34,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 16:36:34,067 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:34,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:36:34,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:36:34,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:36:34,069 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-11-07 16:36:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:34,147 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-07 16:36:34,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:36:34,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 16:36:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:34,151 INFO L225 Difference]: With dead ends: 29 [2018-11-07 16:36:34,151 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 16:36:34,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:36:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 16:36:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 16:36:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 16:36:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 16:36:34,157 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-07 16:36:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:34,157 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 16:36:34,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:36:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 16:36:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:36:34,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:34,159 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:34,159 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:34,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-07 16:36:34,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:34,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:34,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:36:34,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:34,161 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:34,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:34,502 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:34,503 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:34,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:34,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:34,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:34,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:36:34,512 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:36:34,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:36:34,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:36:34,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:34,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:36,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:36,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 16:36:36,534 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:36,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:36:36,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:36:36,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:36:36,535 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-07 16:36:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:36,615 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-07 16:36:36,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:36:36,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-07 16:36:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:36,617 INFO L225 Difference]: With dead ends: 31 [2018-11-07 16:36:36,617 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 16:36:36,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:36:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 16:36:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 16:36:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 16:36:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-07 16:36:36,622 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-07 16:36:36,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:36,623 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-07 16:36:36,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:36:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-07 16:36:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 16:36:36,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:36,624 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:36,624 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:36,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:36,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-11-07 16:36:36,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:36,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:36,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:36:36,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:36,626 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:36,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:36,868 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:36,868 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:36,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:36,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:36,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:36,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:36,877 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:36:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:36,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:36,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:40,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:40,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 16:36:40,704 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:40,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:36:40,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:36:40,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:36:40,706 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-11-07 16:36:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:40,835 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-07 16:36:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:36:40,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-07 16:36:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:40,841 INFO L225 Difference]: With dead ends: 33 [2018-11-07 16:36:40,841 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 16:36:40,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:36:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 16:36:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-07 16:36:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 16:36:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-07 16:36:40,847 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-07 16:36:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:40,848 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-07 16:36:40,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:36:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-07 16:36:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 16:36:40,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:40,849 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:40,849 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:40,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:40,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1579855560, now seen corresponding path program 8 times [2018-11-07 16:36:40,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:40,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:40,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:40,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:40,851 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:41,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:41,009 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:41,009 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:41,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:41,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:41,010 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:41,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:36:41,021 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:36:41,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:36:41,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:36:41,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:41,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:44,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:44,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 16:36:44,833 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:44,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:36:44,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:36:44,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:36:44,834 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 11 states. [2018-11-07 16:36:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:44,930 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-07 16:36:44,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:36:44,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-07 16:36:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:44,932 INFO L225 Difference]: With dead ends: 35 [2018-11-07 16:36:44,932 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 16:36:44,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:36:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 16:36:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 16:36:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 16:36:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-07 16:36:44,938 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-11-07 16:36:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:44,939 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-07 16:36:44,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:36:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-07 16:36:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:36:44,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:44,940 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:44,940 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:44,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1182244082, now seen corresponding path program 9 times [2018-11-07 16:36:44,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:44,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:44,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:36:44,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:44,942 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:45,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:45,149 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:45,149 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:45,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:45,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:45,150 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:45,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:36:45,159 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:36:45,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:36:45,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:36:45,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:45,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:50,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:50,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 16:36:50,182 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:50,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:36:50,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:36:50,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:36:50,183 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 12 states. [2018-11-07 16:36:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:50,343 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-07 16:36:50,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:36:50,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-07 16:36:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:50,346 INFO L225 Difference]: With dead ends: 37 [2018-11-07 16:36:50,346 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 16:36:50,346 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:36:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 16:36:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 16:36:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 16:36:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-07 16:36:50,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-11-07 16:36:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:50,354 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-07 16:36:50,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:36:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-07 16:36:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 16:36:50,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:50,356 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:50,356 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:50,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:50,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1270211116, now seen corresponding path program 10 times [2018-11-07 16:36:50,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:50,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:50,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:36:50,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:50,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:50,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:50,704 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:50,704 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:50,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:50,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:50,705 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:50,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:50,715 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:36:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:50,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:50,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:36:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:57,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:36:57,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 16:36:57,025 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:36:57,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:36:57,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:36:57,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:36:57,027 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 13 states. [2018-11-07 16:36:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:36:57,204 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 16:36:57,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:36:57,205 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-07 16:36:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:36:57,207 INFO L225 Difference]: With dead ends: 39 [2018-11-07 16:36:57,207 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 16:36:57,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:36:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 16:36:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-07 16:36:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 16:36:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-07 16:36:57,213 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-11-07 16:36:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:36:57,213 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-07 16:36:57,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:36:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-07 16:36:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 16:36:57,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:36:57,214 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:36:57,215 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:36:57,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:36:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 92815130, now seen corresponding path program 11 times [2018-11-07 16:36:57,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:36:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:57,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:36:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:36:57,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:36:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:36:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:57,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:57,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:36:57,495 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:36:57,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:36:57,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:36:57,495 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:57,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:36:57,505 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:36:57,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 16:36:57,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:36:57,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:36:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:36:57,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:37:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:06,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:37:06,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 16:37:06,841 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:37:06,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:37:06,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:37:06,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:37:06,843 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 14 states. [2018-11-07 16:37:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:37:07,017 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-07 16:37:07,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:37:07,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-07 16:37:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:37:07,020 INFO L225 Difference]: With dead ends: 41 [2018-11-07 16:37:07,021 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 16:37:07,021 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:37:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 16:37:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-07 16:37:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 16:37:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 16:37:07,026 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-11-07 16:37:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:37:07,026 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 16:37:07,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:37:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 16:37:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 16:37:07,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:37:07,027 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:37:07,028 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:37:07,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:37:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash -3987744, now seen corresponding path program 12 times [2018-11-07 16:37:07,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:37:07,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:07,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:37:07,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:07,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:37:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:37:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:07,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:07,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:37:07,325 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:37:07,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:37:07,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:07,326 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:37:07,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:37:07,340 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:37:07,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:37:07,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:37:07,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:37:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:07,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:37:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:17,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:37:17,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 16:37:17,328 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:37:17,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:37:17,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:37:17,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:37:17,330 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 15 states. [2018-11-07 16:37:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:37:17,497 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-07 16:37:17,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:37:17,498 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-07 16:37:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:37:17,501 INFO L225 Difference]: With dead ends: 43 [2018-11-07 16:37:17,501 INFO L226 Difference]: Without dead ends: 38 [2018-11-07 16:37:17,502 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:37:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-07 16:37:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-07 16:37:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 16:37:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-07 16:37:17,507 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-11-07 16:37:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:37:17,507 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-07 16:37:17,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:37:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-07 16:37:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 16:37:17,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:37:17,508 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:37:17,509 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:37:17,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:37:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1457730854, now seen corresponding path program 13 times [2018-11-07 16:37:17,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:37:17,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:17,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:37:17,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:17,510 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:37:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:37:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:17,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:17,746 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:37:17,747 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:37:17,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:37:17,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:17,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:37:17,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:37:17,756 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:37:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:37:17,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:37:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:17,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:37:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:28,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:37:28,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 16:37:28,997 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:37:28,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:37:28,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:37:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:37:28,998 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 16 states. [2018-11-07 16:37:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:37:29,256 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-07 16:37:29,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:37:29,257 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-07 16:37:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:37:29,258 INFO L225 Difference]: With dead ends: 45 [2018-11-07 16:37:29,258 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:37:29,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:37:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:37:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-07 16:37:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 16:37:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-07 16:37:29,264 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-11-07 16:37:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:37:29,264 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-07 16:37:29,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:37:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-07 16:37:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 16:37:29,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:37:29,265 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:37:29,265 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:37:29,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:37:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1714997740, now seen corresponding path program 14 times [2018-11-07 16:37:29,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:37:29,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:29,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:37:29,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:29,267 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:37:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:37:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:29,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:29,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:37:29,741 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:37:29,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:37:29,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:29,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:37:29,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:37:29,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:37:30,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 16:37:30,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:37:30,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:37:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:30,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:37:32,016 WARN L179 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:35,315 WARN L179 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:36,071 WARN L179 SmtUtils]: Spent 681.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:39,154 WARN L179 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:42,832 WARN L179 SmtUtils]: Spent 890.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:43,390 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:44,818 WARN L179 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:51,619 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:53,341 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:54,215 WARN L179 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:55,614 WARN L179 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:37:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:55,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:37:55,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 16:37:55,665 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:37:55,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:37:55,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:37:55,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=701, Unknown=5, NotChecked=0, Total=992 [2018-11-07 16:37:55,667 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 17 states. [2018-11-07 16:37:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:37:55,849 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-07 16:37:55,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:37:55,856 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-07 16:37:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:37:55,857 INFO L225 Difference]: With dead ends: 47 [2018-11-07 16:37:55,857 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 16:37:55,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=286, Invalid=701, Unknown=5, NotChecked=0, Total=992 [2018-11-07 16:37:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 16:37:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-07 16:37:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 16:37:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-07 16:37:55,865 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-11-07 16:37:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:37:55,865 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-07 16:37:55,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:37:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-07 16:37:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 16:37:55,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:37:55,867 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:37:55,867 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:37:55,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:37:55,868 INFO L82 PathProgramCache]: Analyzing trace with hash -159627982, now seen corresponding path program 15 times [2018-11-07 16:37:55,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:37:55,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:55,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:37:55,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:37:55,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:37:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:37:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:56,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:56,193 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:37:56,193 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:37:56,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:37:56,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:37:56,193 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:37:56,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:37:56,202 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:37:56,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:37:56,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:37:56,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:37:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:37:56,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:12,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:12,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 16:38:12,177 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:12,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:38:12,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:38:12,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:38:12,178 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 18 states. [2018-11-07 16:38:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:12,453 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-07 16:38:12,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:38:12,454 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-07 16:38:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:12,455 INFO L225 Difference]: With dead ends: 49 [2018-11-07 16:38:12,455 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 16:38:12,455 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:38:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 16:38:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-07 16:38:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 16:38:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-07 16:38:12,461 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-11-07 16:38:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:12,461 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-07 16:38:12,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:38:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-07 16:38:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 16:38:12,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:12,462 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:12,463 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:12,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:12,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2083649800, now seen corresponding path program 16 times [2018-11-07 16:38:12,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:12,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:12,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:38:12,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:12,464 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:13,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:13,068 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:13,068 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:13,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:38:13,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:13,069 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:13,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:13,078 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:38:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:13,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:13,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:28,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:38:28,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 16:38:28,954 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:38:28,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:38:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:38:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:38:28,955 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-11-07 16:38:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:38:29,310 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 16:38:29,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:38:29,311 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-07 16:38:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:38:29,312 INFO L225 Difference]: With dead ends: 51 [2018-11-07 16:38:29,312 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 16:38:29,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:38:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 16:38:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-07 16:38:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 16:38:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-07 16:38:29,319 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-11-07 16:38:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:38:29,319 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-07 16:38:29,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:38:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-07 16:38:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 16:38:29,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:38:29,320 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:38:29,320 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:38:29,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:38:29,321 INFO L82 PathProgramCache]: Analyzing trace with hash 62287678, now seen corresponding path program 17 times [2018-11-07 16:38:29,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:38:29,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:29,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:38:29,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:38:29,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:38:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:38:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:29,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:29,926 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:38:29,927 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:38:29,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:38:29,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:38:29,927 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:38:29,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:38:29,938 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:38:32,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 16:38:32,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:38:32,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:38:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:38:32,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:38:33,466 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:34,769 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:36,177 WARN L179 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:37,190 WARN L179 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-07 16:38:40,146 WARN L179 SmtUtils]: Spent 892.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:42,101 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:43,716 WARN L179 SmtUtils]: Spent 893.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:45,148 WARN L179 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:46,125 WARN L179 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:47,315 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:51,616 WARN L179 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:52,894 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:56,074 WARN L179 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:38:58,633 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:39:02,104 WARN L179 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 16:39:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:02,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:39:02,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 16:39:02,133 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:39:02,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 16:39:02,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 16:39:02,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1005, Unknown=4, NotChecked=0, Total=1406 [2018-11-07 16:39:02,135 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 20 states. [2018-11-07 16:39:02,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:02,720 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-07 16:39:02,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:39:02,721 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-07 16:39:02,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:02,722 INFO L225 Difference]: With dead ends: 53 [2018-11-07 16:39:02,722 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 16:39:02,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=397, Invalid=1005, Unknown=4, NotChecked=0, Total=1406 [2018-11-07 16:39:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 16:39:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 16:39:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:39:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 16:39:02,727 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-11-07 16:39:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:02,728 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 16:39:02,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 16:39:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 16:39:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 16:39:02,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:02,728 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:02,729 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:02,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash 723901956, now seen corresponding path program 18 times [2018-11-07 16:39:02,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:02,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:39:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:02,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:04,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:04,166 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:39:04,166 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:39:04,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:39:04,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:04,166 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:39:04,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:39:04,176 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:39:04,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:39:04,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:39:04,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:39:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:04,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:39:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:29,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:39:29,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 16:39:29,134 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:39:29,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 16:39:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 16:39:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:39:29,136 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 21 states. [2018-11-07 16:39:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:29,523 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-07 16:39:29,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:39:29,523 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-11-07 16:39:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:29,524 INFO L225 Difference]: With dead ends: 55 [2018-11-07 16:39:29,524 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 16:39:29,525 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 16:39:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 16:39:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-07 16:39:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 16:39:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-07 16:39:29,529 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-11-07 16:39:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:29,530 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-07 16:39:29,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 16:39:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-07 16:39:29,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 16:39:29,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:29,531 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:29,531 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:29,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:29,531 INFO L82 PathProgramCache]: Analyzing trace with hash 880063306, now seen corresponding path program 19 times [2018-11-07 16:39:29,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:29,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:29,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:39:29,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:29,532 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:29,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:29,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:39:29,879 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:39:29,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:39:29,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:29,880 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:39:29,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:29,895 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:39:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:29,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:39:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:29,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:39:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:58,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:39:58,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 16:39:58,531 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:39:58,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 16:39:58,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 16:39:58,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:39:58,533 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 22 states. [2018-11-07 16:39:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:39:58,942 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-07 16:39:58,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:39:58,943 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-07 16:39:58,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:39:58,944 INFO L225 Difference]: With dead ends: 57 [2018-11-07 16:39:58,944 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 16:39:58,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 16:39:58,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 16:39:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-07 16:39:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 16:39:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-07 16:39:58,949 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-11-07 16:39:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:39:58,949 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-07 16:39:58,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 16:39:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-07 16:39:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 16:39:58,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:39:58,950 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:39:58,950 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:39:58,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:39:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash 627265296, now seen corresponding path program 20 times [2018-11-07 16:39:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:39:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:58,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:39:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:39:58,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:39:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:39:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:39:59,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:59,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:39:59,380 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:39:59,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:39:59,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:39:59,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:39:59,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:39:59,392 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:40:01,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 16:40:01,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:01,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:01,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:40:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:31,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:40:31,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 16:40:31,401 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:40:31,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 16:40:31,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 16:40:31,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:40:31,402 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 23 states. [2018-11-07 16:40:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:40:31,762 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-07 16:40:31,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:40:31,764 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-11-07 16:40:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:40:31,765 INFO L225 Difference]: With dead ends: 59 [2018-11-07 16:40:31,765 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 16:40:31,767 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:40:31,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 16:40:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-07 16:40:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 16:40:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-07 16:40:31,771 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-11-07 16:40:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:40:31,771 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-07 16:40:31,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 16:40:31,772 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-07 16:40:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 16:40:31,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:40:31,772 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:40:31,773 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:40:31,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:40:31,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1793453738, now seen corresponding path program 21 times [2018-11-07 16:40:31,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:40:31,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:31,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:40:31,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:40:31,774 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:40:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:40:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:32,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:32,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:40:32,199 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:40:32,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:40:32,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:40:32,200 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:40:32,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:40:32,209 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:40:32,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:40:32,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:40:32,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:40:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:40:32,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:41:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:41:06,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:41:06,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 16:41:06,679 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:41:06,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 16:41:06,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 16:41:06,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:41:06,681 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 24 states. [2018-11-07 16:41:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:41:07,017 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-07 16:41:07,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 16:41:07,018 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-11-07 16:41:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:41:07,019 INFO L225 Difference]: With dead ends: 61 [2018-11-07 16:41:07,019 INFO L226 Difference]: Without dead ends: 56 [2018-11-07 16:41:07,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 16:41:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-07 16:41:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-07 16:41:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 16:41:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-07 16:41:07,024 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-11-07 16:41:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:41:07,024 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-07 16:41:07,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 16:41:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-07 16:41:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 16:41:07,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:41:07,025 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:41:07,026 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:41:07,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:41:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash -232170980, now seen corresponding path program 22 times [2018-11-07 16:41:07,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:41:07,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:07,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:41:07,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:41:07,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:41:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-07 16:41:07,164 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:41:07,169 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:41:07,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:41:07 BoogieIcfgContainer [2018-11-07 16:41:07,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:41:07,170 INFO L168 Benchmark]: Toolchain (without parser) took 280640.73 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 958.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -651.0 MB). Peak memory consumption was 307.9 MB. Max. memory is 7.1 GB. [2018-11-07 16:41:07,171 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:41:07,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:41:07,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:41:07,172 INFO L168 Benchmark]: Boogie Preprocessor took 20.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:41:07,173 INFO L168 Benchmark]: RCFGBuilder took 308.54 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 16:41:07,173 INFO L168 Benchmark]: TraceAbstraction took 280002.12 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 246.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 100.1 MB). Peak memory consumption was 347.1 MB. Max. memory is 7.1 GB. [2018-11-07 16:41:07,181 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 16.83 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 20.52 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 308.54 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 280002.12 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 246.9 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 100.1 MB). Peak memory consumption was 347.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 23,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 54 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. TIMEOUT Result, 279.9s OverallTime, 24 OverallIterations, 23 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 491 SDtfs, 0 SDslu, 5567 SDs, 0 SdLazy, 4301 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1664 GetRequests, 1135 SyntacticMatches, 24 SemanticMatches, 505 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 266.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 268.2s InterpolantComputationTime, 1407 NumberOfCodeBlocks, 1407 NumberOfCodeBlocksAsserted, 128 NumberOfCheckSat, 2035 ConstructedInterpolants, 0 QuantifiedInterpolants, 437261 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1911 ConjunctsInSsa, 528 ConjunctsInUnsatCore, 65 InterpolantComputations, 2 PerfectInterpolantSequences, 0/10626 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown