java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:57:00,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:57:00,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:57:00,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:57:00,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:57:00,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:57:00,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:57:00,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:57:00,250 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:57:00,251 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:57:00,252 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:57:00,252 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:57:00,253 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:57:00,254 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:57:00,255 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:57:00,256 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:57:00,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:57:00,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:57:00,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:57:00,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:57:00,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:57:00,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:57:00,267 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:57:00,268 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:57:00,268 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:57:00,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:57:00,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:57:00,271 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:57:00,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:57:00,273 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:57:00,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:57:00,274 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:57:00,275 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:57:00,275 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:57:00,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:57:00,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:57:00,277 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:57:00,292 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:57:00,293 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:57:00,293 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:57:00,294 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:57:00,294 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:57:00,294 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:57:00,294 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:57:00,294 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:57:00,295 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:57:00,295 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:57:00,295 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:57:00,295 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:57:00,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:57:00,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:57:00,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:57:00,297 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:57:00,297 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:57:00,297 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:57:00,297 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:57:00,297 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:57:00,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:57:00,298 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:57:00,298 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:57:00,298 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:57:00,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:57:00,299 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:57:00,299 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:57:00,299 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:57:00,299 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:57:00,300 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:57:00,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:57:00,300 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:57:00,300 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:57:00,300 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:57:00,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:57:00,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:57:00,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:57:00,378 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:57:00,379 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:57:00,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call1_true-termination.i [2018-11-07 04:57:00,438 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e61dd018/741493b0c7194887bb8a9f6a1fb7e66c/FLAG3aec89790 [2018-11-07 04:57:00,863 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:57:00,864 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call1_true-termination.i [2018-11-07 04:57:00,871 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e61dd018/741493b0c7194887bb8a9f6a1fb7e66c/FLAG3aec89790 [2018-11-07 04:57:00,888 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e61dd018/741493b0c7194887bb8a9f6a1fb7e66c [2018-11-07 04:57:00,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:57:00,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:57:00,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:57:00,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:57:00,908 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:57:00,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:57:00" (1/1) ... [2018-11-07 04:57:00,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f02a909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:00, skipping insertion in model container [2018-11-07 04:57:00,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:57:00" (1/1) ... [2018-11-07 04:57:00,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:57:00,945 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:57:01,158 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:57:01,163 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:57:01,186 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:57:01,210 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:57:01,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:01 WrapperNode [2018-11-07 04:57:01,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:57:01,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:57:01,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:57:01,212 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:57:01,223 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:57:01" (1/1) ... [2018-11-07 04:57:01,234 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:57:01" (1/1) ... [2018-11-07 04:57:01,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:57:01,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:57:01,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:57:01,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:57:01,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:01" (1/1) ... [2018-11-07 04:57:01,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:01" (1/1) ... [2018-11-07 04:57:01,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:01" (1/1) ... [2018-11-07 04:57:01,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:01" (1/1) ... [2018-11-07 04:57:01,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:01" (1/1) ... [2018-11-07 04:57:01,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:01" (1/1) ... [2018-11-07 04:57:01,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:01" (1/1) ... [2018-11-07 04:57:01,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:57:01,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:57:01,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:57:01,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:57:01,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:57:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 04:57:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:57:01,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:57:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 04:57:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:57:01,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:57:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:57:01,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:57:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 04:57:01,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:57:01,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:57:01,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 04:57:01,744 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:57:01,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:57:01 BoogieIcfgContainer [2018-11-07 04:57:01,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:57:01,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:57:01,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:57:01,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:57:01,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:57:00" (1/3) ... [2018-11-07 04:57:01,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0bfa02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:57:01, skipping insertion in model container [2018-11-07 04:57:01,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:57:01" (2/3) ... [2018-11-07 04:57:01,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0bfa02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:57:01, skipping insertion in model container [2018-11-07 04:57:01,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:57:01" (3/3) ... [2018-11-07 04:57:01,754 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call1_true-termination.i [2018-11-07 04:57:01,764 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:57:01,771 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:57:01,787 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:57:01,826 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:57:01,826 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:57:01,826 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:57:01,827 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:57:01,827 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:57:01,827 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:57:01,827 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:57:01,827 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:57:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-07 04:57:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 04:57:01,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:01,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:01,859 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:01,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:01,866 INFO L82 PathProgramCache]: Analyzing trace with hash 526261342, now seen corresponding path program 1 times [2018-11-07 04:57:01,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:01,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:01,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:01,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:01,924 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:02,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:57:02,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:57:02,013 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:57:02,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:57:02,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:57:02,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:57:02,037 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-07 04:57:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:02,062 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-07 04:57:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:57:02,064 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-07 04:57:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:02,073 INFO L225 Difference]: With dead ends: 41 [2018-11-07 04:57:02,073 INFO L226 Difference]: Without dead ends: 17 [2018-11-07 04:57:02,077 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 04:57:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-07 04:57:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-07 04:57:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-07 04:57:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-07 04:57:02,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-11-07 04:57:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:02,115 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-07 04:57:02,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:57:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-07 04:57:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 04:57:02,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:02,116 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:02,116 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:02,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:02,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1427482147, now seen corresponding path program 1 times [2018-11-07 04:57:02,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:02,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:02,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:02,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:02,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:02,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:57:02,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:57:02,208 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:57:02,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:57:02,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:57:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:57:02,211 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2018-11-07 04:57:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:02,268 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 04:57:02,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:57:02,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-07 04:57:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:02,269 INFO L225 Difference]: With dead ends: 27 [2018-11-07 04:57:02,270 INFO L226 Difference]: Without dead ends: 21 [2018-11-07 04:57:02,271 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 04:57:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-07 04:57:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-07 04:57:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 04:57:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-07 04:57:02,276 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2018-11-07 04:57:02,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:02,277 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-07 04:57:02,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:57:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-07 04:57:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 04:57:02,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:02,278 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:02,280 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:02,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:02,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1966302602, now seen corresponding path program 1 times [2018-11-07 04:57:02,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:02,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:02,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:02,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:02,283 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:02,394 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 04:57:02,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:02,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:02,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-11-07 04:57:02,398 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [18], [22], [28], [31], [33], [39], [40], [41], [43] [2018-11-07 04:57:02,454 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:57:02,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:57:02,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:57:02,890 INFO L272 AbstractInterpreter]: Visited 17 different actions 55 times. Merged at 4 different actions 30 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-07 04:57:02,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:02,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:57:02,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:02,915 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:02,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:02,927 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:02,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:03,053 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 04:57:03,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:03,123 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 04:57:03,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:03,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 04:57:03,145 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:03,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:57:03,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:57:03,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:57:03,147 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 5 states. [2018-11-07 04:57:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:03,235 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-07 04:57:03,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:57:03,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-07 04:57:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:03,237 INFO L225 Difference]: With dead ends: 31 [2018-11-07 04:57:03,237 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 04:57:03,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:57:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 04:57:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-07 04:57:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-07 04:57:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-07 04:57:03,243 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2018-11-07 04:57:03,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:03,244 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-07 04:57:03,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:57:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-07 04:57:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 04:57:03,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:03,245 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:03,245 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:03,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:03,246 INFO L82 PathProgramCache]: Analyzing trace with hash 939189903, now seen corresponding path program 2 times [2018-11-07 04:57:03,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:03,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:03,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:03,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:03,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:03,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:03,415 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:03,416 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:03,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:03,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:03,416 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:03,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:03,427 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:03,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:57:03,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:03,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:03,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:03,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:03,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 04:57:03,799 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:03,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:57:03,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:57:03,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 04:57:03,800 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 6 states. [2018-11-07 04:57:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:03,859 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-07 04:57:03,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:57:03,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-07 04:57:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:03,861 INFO L225 Difference]: With dead ends: 35 [2018-11-07 04:57:03,861 INFO L226 Difference]: Without dead ends: 29 [2018-11-07 04:57:03,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 04:57:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-07 04:57:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-07 04:57:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 04:57:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-07 04:57:03,867 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-11-07 04:57:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:03,868 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-07 04:57:03,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:57:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-07 04:57:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 04:57:03,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:03,869 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:03,869 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:03,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash -830243288, now seen corresponding path program 3 times [2018-11-07 04:57:03,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:03,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:03,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:03,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:03,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:03,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:03,983 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:03,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:03,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:03,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:03,984 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:03,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:03,999 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:04,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:04,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:04,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:04,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:04,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:04,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-07 04:57:04,270 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:04,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 04:57:04,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 04:57:04,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-07 04:57:04,271 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-11-07 04:57:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:04,340 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 04:57:04,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:57:04,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-07 04:57:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:04,342 INFO L225 Difference]: With dead ends: 39 [2018-11-07 04:57:04,342 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 04:57:04,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-07 04:57:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 04:57:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-07 04:57:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 04:57:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-07 04:57:04,349 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 26 [2018-11-07 04:57:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:04,349 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-07 04:57:04,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 04:57:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-07 04:57:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 04:57:04,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:04,350 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:04,351 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:04,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash 961847617, now seen corresponding path program 4 times [2018-11-07 04:57:04,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:04,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:04,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:04,353 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:04,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:04,456 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:04,456 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:04,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:04,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:04,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:04,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:04,469 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:04,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:04,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:05,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:05,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 04:57:05,008 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:05,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:57:05,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:57:05,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:57:05,009 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 8 states. [2018-11-07 04:57:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:05,060 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-07 04:57:05,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:57:05,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-07 04:57:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:05,062 INFO L225 Difference]: With dead ends: 43 [2018-11-07 04:57:05,063 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 04:57:05,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:57:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 04:57:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-07 04:57:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 04:57:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-07 04:57:05,070 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 30 [2018-11-07 04:57:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:05,070 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-07 04:57:05,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:57:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-07 04:57:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 04:57:05,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:05,072 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:05,072 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:05,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1036218406, now seen corresponding path program 5 times [2018-11-07 04:57:05,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:05,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:05,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:05,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:05,074 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:05,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:05,213 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:05,213 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:05,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:05,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:05,214 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:05,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:05,223 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:05,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 04:57:05,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:05,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:05,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:05,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:05,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 04:57:05,442 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:05,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:57:05,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:57:05,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:57:05,443 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 9 states. [2018-11-07 04:57:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:05,561 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-07 04:57:05,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:57:05,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-07 04:57:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:05,564 INFO L225 Difference]: With dead ends: 47 [2018-11-07 04:57:05,564 INFO L226 Difference]: Without dead ends: 41 [2018-11-07 04:57:05,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:57:05,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-07 04:57:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-07 04:57:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 04:57:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-07 04:57:05,571 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 34 [2018-11-07 04:57:05,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:05,572 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-07 04:57:05,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:57:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-07 04:57:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 04:57:05,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:05,573 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:05,574 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:05,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1578530317, now seen corresponding path program 6 times [2018-11-07 04:57:05,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:05,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:05,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:05,728 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 04:57:05,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:05,729 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:05,729 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:05,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:05,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:05,729 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:05,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:05,738 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:05,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:05,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:05,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:05,815 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 04:57:05,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:06,041 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 04:57:06,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:06,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-07 04:57:06,063 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:06,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 04:57:06,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 04:57:06,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-07 04:57:06,065 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 10 states. [2018-11-07 04:57:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:06,124 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 04:57:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 04:57:06,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-11-07 04:57:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:06,128 INFO L225 Difference]: With dead ends: 51 [2018-11-07 04:57:06,128 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 04:57:06,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-07 04:57:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 04:57:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-07 04:57:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 04:57:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-07 04:57:06,134 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 38 [2018-11-07 04:57:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:06,135 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-07 04:57:06,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 04:57:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-07 04:57:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-07 04:57:06,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:06,136 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:06,137 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:06,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1880502388, now seen corresponding path program 7 times [2018-11-07 04:57:06,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:06,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:06,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:06,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:06,138 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:06,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:06,415 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:06,415 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:06,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:06,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:06,416 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:06,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:06,426 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:06,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:06,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:06,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:06,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 04:57:06,658 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:06,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:57:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:57:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:57:06,660 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 11 states. [2018-11-07 04:57:06,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:06,847 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-07 04:57:06,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 04:57:06,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-11-07 04:57:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:06,849 INFO L225 Difference]: With dead ends: 55 [2018-11-07 04:57:06,849 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 04:57:06,850 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:57:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 04:57:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-07 04:57:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 04:57:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-07 04:57:06,855 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 42 [2018-11-07 04:57:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:06,856 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-07 04:57:06,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:57:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-07 04:57:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 04:57:06,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:06,857 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:06,857 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:06,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1386979493, now seen corresponding path program 8 times [2018-11-07 04:57:06,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:06,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:06,859 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:07,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:07,000 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:07,000 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:07,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:07,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:07,001 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:07,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:07,012 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:07,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 04:57:07,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:07,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:07,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:07,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:07,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 04:57:07,665 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:07,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 04:57:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 04:57:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 04:57:07,667 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 12 states. [2018-11-07 04:57:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:07,722 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-07 04:57:07,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 04:57:07,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-07 04:57:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:07,726 INFO L225 Difference]: With dead ends: 59 [2018-11-07 04:57:07,727 INFO L226 Difference]: Without dead ends: 53 [2018-11-07 04:57:07,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 04:57:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-07 04:57:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-07 04:57:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 04:57:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-07 04:57:07,733 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2018-11-07 04:57:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:07,734 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-07 04:57:07,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 04:57:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-07 04:57:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 04:57:07,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:07,735 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:07,735 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:07,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1333607742, now seen corresponding path program 9 times [2018-11-07 04:57:07,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:07,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:07,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:07,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:07,737 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:07,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:07,916 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:07,917 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:07,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:07,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:07,917 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:07,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:07,931 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:07,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:07,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:07,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:07,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:08,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:08,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-07 04:57:08,241 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:08,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 04:57:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 04:57:08,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-07 04:57:08,242 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 13 states. [2018-11-07 04:57:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:08,313 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-07 04:57:08,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 04:57:08,314 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-11-07 04:57:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:08,315 INFO L225 Difference]: With dead ends: 63 [2018-11-07 04:57:08,315 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 04:57:08,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-07 04:57:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 04:57:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-07 04:57:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 04:57:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-07 04:57:08,322 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 50 [2018-11-07 04:57:08,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:08,323 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-07 04:57:08,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 04:57:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-07 04:57:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 04:57:08,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:08,324 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:08,324 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:08,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:08,325 INFO L82 PathProgramCache]: Analyzing trace with hash 445441367, now seen corresponding path program 10 times [2018-11-07 04:57:08,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:08,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:08,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:08,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:08,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:08,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:08,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:08,517 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:08,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:08,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:08,518 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 04:57:08,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:08,530 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:08,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:08,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:09,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:09,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 04:57:09,049 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:09,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 04:57:09,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 04:57:09,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 04:57:09,050 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 14 states. [2018-11-07 04:57:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:09,119 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-07 04:57:09,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 04:57:09,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-11-07 04:57:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:09,122 INFO L225 Difference]: With dead ends: 67 [2018-11-07 04:57:09,122 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 04:57:09,123 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 04:57:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 04:57:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-07 04:57:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 04:57:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-07 04:57:09,128 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 54 [2018-11-07 04:57:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:09,129 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-07 04:57:09,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 04:57:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-07 04:57:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 04:57:09,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:09,130 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:09,130 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:09,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:09,131 INFO L82 PathProgramCache]: Analyzing trace with hash 115923184, now seen corresponding path program 11 times [2018-11-07 04:57:09,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:09,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:09,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:09,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:09,914 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:09,914 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:09,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:09,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:09,914 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 04:57:09,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:09,923 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:10,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 04:57:10,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:10,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:10,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:10,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:10,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 04:57:10,334 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:10,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 04:57:10,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 04:57:10,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 04:57:10,335 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 15 states. [2018-11-07 04:57:10,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:10,495 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-11-07 04:57:10,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 04:57:10,496 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-11-07 04:57:10,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:10,497 INFO L225 Difference]: With dead ends: 71 [2018-11-07 04:57:10,497 INFO L226 Difference]: Without dead ends: 65 [2018-11-07 04:57:10,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 04:57:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-07 04:57:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-07 04:57:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 04:57:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-07 04:57:10,503 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 58 [2018-11-07 04:57:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:10,503 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-07 04:57:10,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 04:57:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-07 04:57:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 04:57:10,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:10,504 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:10,505 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:10,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1233168375, now seen corresponding path program 12 times [2018-11-07 04:57:10,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:10,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:10,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:10,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:10,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:11,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:11,450 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:11,450 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:11,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:11,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:11,451 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 04:57:11,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:11,461 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:11,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:11,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:11,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:11,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:11,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:11,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-07 04:57:11,843 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:11,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 04:57:11,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 04:57:11,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 04:57:11,844 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 16 states. [2018-11-07 04:57:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:12,028 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-07 04:57:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 04:57:12,028 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2018-11-07 04:57:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:12,029 INFO L225 Difference]: With dead ends: 75 [2018-11-07 04:57:12,030 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 04:57:12,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 04:57:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 04:57:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-07 04:57:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 04:57:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-11-07 04:57:12,036 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 62 [2018-11-07 04:57:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:12,036 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-11-07 04:57:12,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 04:57:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-11-07 04:57:12,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 04:57:12,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:12,038 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:12,038 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:12,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:12,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1440832862, now seen corresponding path program 13 times [2018-11-07 04:57:12,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:12,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:12,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:12,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:12,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:12,399 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:12,399 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:12,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:12,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:12,400 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 04:57:12,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:12,408 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:12,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:12,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:13,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:13,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 04:57:13,315 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:13,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 04:57:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 04:57:13,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 04:57:13,317 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 17 states. [2018-11-07 04:57:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:13,389 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-11-07 04:57:13,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 04:57:13,390 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-11-07 04:57:13,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:13,391 INFO L225 Difference]: With dead ends: 79 [2018-11-07 04:57:13,391 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 04:57:13,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 04:57:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 04:57:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-11-07 04:57:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 04:57:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-07 04:57:13,397 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 66 [2018-11-07 04:57:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:13,397 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-07 04:57:13,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 04:57:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-07 04:57:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-07 04:57:13,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:13,399 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:13,399 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:13,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash -780863301, now seen corresponding path program 14 times [2018-11-07 04:57:13,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:13,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:13,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:13,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:13,401 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:13,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:13,669 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:13,669 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:13,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:13,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:13,669 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 04:57:13,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:13,679 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:13,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 04:57:13,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:13,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:13,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:14,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:14,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 04:57:14,325 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:14,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 04:57:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 04:57:14,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 04:57:14,326 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 18 states. [2018-11-07 04:57:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:14,471 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-11-07 04:57:14,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 04:57:14,473 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-11-07 04:57:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:14,474 INFO L225 Difference]: With dead ends: 83 [2018-11-07 04:57:14,474 INFO L226 Difference]: Without dead ends: 77 [2018-11-07 04:57:14,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 04:57:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-07 04:57:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-07 04:57:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 04:57:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-07 04:57:14,481 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 70 [2018-11-07 04:57:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:14,482 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-07 04:57:14,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 04:57:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-07 04:57:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 04:57:14,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:14,484 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:14,484 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:14,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:14,485 INFO L82 PathProgramCache]: Analyzing trace with hash 454072916, now seen corresponding path program 15 times [2018-11-07 04:57:14,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:14,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:14,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:14,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:14,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:14,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:14,914 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:14,914 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:14,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:14,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:14,914 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 04:57:14,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:14,926 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:15,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:15,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:15,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:15,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:15,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:15,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-11-07 04:57:15,773 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:15,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 04:57:15,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 04:57:15,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 04:57:15,774 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 19 states. [2018-11-07 04:57:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:15,911 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-07 04:57:15,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 04:57:15,912 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2018-11-07 04:57:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:15,913 INFO L225 Difference]: With dead ends: 87 [2018-11-07 04:57:15,913 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 04:57:15,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 04:57:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 04:57:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-07 04:57:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 04:57:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-11-07 04:57:15,919 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 74 [2018-11-07 04:57:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:15,920 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-11-07 04:57:15,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 04:57:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-11-07 04:57:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-07 04:57:15,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:15,921 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:15,921 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:15,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:15,921 INFO L82 PathProgramCache]: Analyzing trace with hash 73385837, now seen corresponding path program 16 times [2018-11-07 04:57:15,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:15,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:15,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:15,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:15,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:16,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:16,217 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:16,217 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:16,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:16,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:16,217 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 04:57:16,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:16,227 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:16,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:16,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:17,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:17,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 04:57:17,307 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:17,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 04:57:17,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 04:57:17,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 04:57:17,308 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 20 states. [2018-11-07 04:57:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:17,391 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-11-07 04:57:17,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 04:57:17,391 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2018-11-07 04:57:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:17,393 INFO L225 Difference]: With dead ends: 91 [2018-11-07 04:57:17,393 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 04:57:17,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 04:57:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 04:57:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-07 04:57:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-07 04:57:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-11-07 04:57:17,398 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 78 [2018-11-07 04:57:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:17,399 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-11-07 04:57:17,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 04:57:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-11-07 04:57:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-07 04:57:17,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:17,400 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:17,400 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:17,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash 699449350, now seen corresponding path program 17 times [2018-11-07 04:57:17,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:17,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:17,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:17,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:17,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:17,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:17,638 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:17,639 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:17,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:17,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:17,639 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 04:57:17,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:17,647 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:18,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 04:57:18,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:18,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:18,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:18,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:18,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 04:57:18,528 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:18,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 04:57:18,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 04:57:18,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 04:57:18,530 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 21 states. [2018-11-07 04:57:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:18,636 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-11-07 04:57:18,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 04:57:18,636 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-11-07 04:57:18,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:18,637 INFO L225 Difference]: With dead ends: 95 [2018-11-07 04:57:18,638 INFO L226 Difference]: Without dead ends: 89 [2018-11-07 04:57:18,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 04:57:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-07 04:57:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-11-07 04:57:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 04:57:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-07 04:57:18,642 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 82 [2018-11-07 04:57:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:18,644 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-07 04:57:18,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 04:57:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-07 04:57:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 04:57:18,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:18,645 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:18,646 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:18,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:18,646 INFO L82 PathProgramCache]: Analyzing trace with hash -701381601, now seen corresponding path program 18 times [2018-11-07 04:57:18,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:18,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:18,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:18,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:18,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:18,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:18,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:18,968 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:18,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:18,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:18,968 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 04:57:18,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:18,977 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:19,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:19,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:19,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:19,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:19,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:19,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-11-07 04:57:19,609 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:19,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 04:57:19,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 04:57:19,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 04:57:19,610 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 22 states. [2018-11-07 04:57:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:19,748 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-07 04:57:19,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 04:57:19,748 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2018-11-07 04:57:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:19,749 INFO L225 Difference]: With dead ends: 99 [2018-11-07 04:57:19,749 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 04:57:19,750 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 04:57:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 04:57:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-07 04:57:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 04:57:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-11-07 04:57:19,754 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 86 [2018-11-07 04:57:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:19,754 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-11-07 04:57:19,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 04:57:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-11-07 04:57:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-07 04:57:19,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:19,755 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:19,755 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:19,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:19,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1812917320, now seen corresponding path program 19 times [2018-11-07 04:57:19,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:19,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:19,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:19,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:19,756 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:20,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:20,200 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:20,200 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:20,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:20,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:20,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 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 04:57:20,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:20,217 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:20,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:20,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:20,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:20,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 04:57:20,755 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:20,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 04:57:20,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 04:57:20,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 04:57:20,757 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 23 states. [2018-11-07 04:57:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:20,905 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-11-07 04:57:20,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 04:57:20,906 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 90 [2018-11-07 04:57:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:20,907 INFO L225 Difference]: With dead ends: 103 [2018-11-07 04:57:20,907 INFO L226 Difference]: Without dead ends: 97 [2018-11-07 04:57:20,908 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 04:57:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-07 04:57:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-11-07 04:57:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-07 04:57:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-11-07 04:57:20,911 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 90 [2018-11-07 04:57:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:20,912 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-11-07 04:57:20,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 04:57:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-11-07 04:57:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-07 04:57:20,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:20,913 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:20,913 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:20,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:20,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1143148847, now seen corresponding path program 20 times [2018-11-07 04:57:20,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:20,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:20,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:20,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:20,915 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:21,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:21,344 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:21,344 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:21,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:21,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:21,344 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 04:57:21,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:21,353 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:22,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 04:57:22,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:22,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:22,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:22,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:22,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 04:57:22,787 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:22,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 04:57:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 04:57:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 04:57:22,789 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 24 states. [2018-11-07 04:57:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:22,926 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-11-07 04:57:22,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 04:57:22,929 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 94 [2018-11-07 04:57:22,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:22,930 INFO L225 Difference]: With dead ends: 107 [2018-11-07 04:57:22,930 INFO L226 Difference]: Without dead ends: 101 [2018-11-07 04:57:22,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 04:57:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-07 04:57:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-07 04:57:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 04:57:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-11-07 04:57:22,934 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 94 [2018-11-07 04:57:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:22,935 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-11-07 04:57:22,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 04:57:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-11-07 04:57:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 04:57:22,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:22,936 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:22,936 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:22,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash 96703850, now seen corresponding path program 21 times [2018-11-07 04:57:22,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:22,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:22,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:22,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:22,937 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:23,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:23,242 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:23,242 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:23,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:23,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:23,242 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 04:57:23,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:23,250 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:23,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:23,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:23,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:23,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:24,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:24,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-11-07 04:57:24,060 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:24,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 04:57:24,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 04:57:24,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 04:57:24,062 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 25 states. [2018-11-07 04:57:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:24,200 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-07 04:57:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 04:57:24,200 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 98 [2018-11-07 04:57:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:24,201 INFO L225 Difference]: With dead ends: 111 [2018-11-07 04:57:24,202 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 04:57:24,203 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 04:57:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 04:57:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-07 04:57:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-07 04:57:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-11-07 04:57:24,207 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 98 [2018-11-07 04:57:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:24,208 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-11-07 04:57:24,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 04:57:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-11-07 04:57:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-07 04:57:24,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:24,209 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:24,209 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:24,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:24,209 INFO L82 PathProgramCache]: Analyzing trace with hash 408110979, now seen corresponding path program 22 times [2018-11-07 04:57:24,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:24,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:24,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:24,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:24,210 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:24,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:24,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:24,690 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:24,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:24,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:24,690 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:24,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:24,701 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:24,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:24,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:25,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:25,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 04:57:25,706 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:25,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 04:57:25,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 04:57:25,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 04:57:25,707 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 26 states. [2018-11-07 04:57:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:25,822 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-11-07 04:57:25,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 04:57:25,823 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2018-11-07 04:57:25,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:25,824 INFO L225 Difference]: With dead ends: 115 [2018-11-07 04:57:25,824 INFO L226 Difference]: Without dead ends: 109 [2018-11-07 04:57:25,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 04:57:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-07 04:57:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-07 04:57:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-07 04:57:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-11-07 04:57:25,830 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 102 [2018-11-07 04:57:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:25,830 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-11-07 04:57:25,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 04:57:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-11-07 04:57:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-07 04:57:25,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:25,831 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:25,831 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:25,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:25,832 INFO L82 PathProgramCache]: Analyzing trace with hash 421152028, now seen corresponding path program 23 times [2018-11-07 04:57:25,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:25,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:25,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:25,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:25,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:26,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:26,201 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:26,201 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:26,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:26,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:26,201 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:26,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:26,209 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:28,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 04:57:28,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:28,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:28,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:28,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:28,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 04:57:28,758 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:28,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 04:57:28,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 04:57:28,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 04:57:28,761 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 27 states. [2018-11-07 04:57:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:28,878 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-11-07 04:57:28,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 04:57:28,878 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 106 [2018-11-07 04:57:28,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:28,880 INFO L225 Difference]: With dead ends: 119 [2018-11-07 04:57:28,880 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 04:57:28,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 04:57:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 04:57:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-07 04:57:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 04:57:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-11-07 04:57:28,885 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 106 [2018-11-07 04:57:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:28,886 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-11-07 04:57:28,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 04:57:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-11-07 04:57:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-07 04:57:28,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:28,887 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:28,887 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:28,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1015467573, now seen corresponding path program 24 times [2018-11-07 04:57:28,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:28,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:28,889 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:29,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:29,351 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:29,351 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:29,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:29,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:29,351 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:29,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:29,360 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:29,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:29,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:29,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:29,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:30,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:30,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-11-07 04:57:30,827 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:30,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 04:57:30,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 04:57:30,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 04:57:30,829 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 28 states. [2018-11-07 04:57:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:30,993 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-11-07 04:57:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 04:57:30,993 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 110 [2018-11-07 04:57:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:30,994 INFO L225 Difference]: With dead ends: 123 [2018-11-07 04:57:30,994 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 04:57:30,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 04:57:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 04:57:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-07 04:57:30,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 04:57:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-11-07 04:57:30,999 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 110 [2018-11-07 04:57:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:30,999 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-11-07 04:57:30,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 04:57:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-11-07 04:57:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-07 04:57:31,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:31,000 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:31,000 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:31,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1441211086, now seen corresponding path program 25 times [2018-11-07 04:57:31,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:31,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:31,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:31,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:31,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:31,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:31,343 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:31,343 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:31,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:31,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:31,344 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:31,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:31,351 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:31,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:31,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:33,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:33,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 04:57:33,251 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:33,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 04:57:33,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 04:57:33,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 04:57:33,254 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 29 states. [2018-11-07 04:57:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:33,400 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-11-07 04:57:33,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 04:57:33,401 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 114 [2018-11-07 04:57:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:33,402 INFO L225 Difference]: With dead ends: 127 [2018-11-07 04:57:33,402 INFO L226 Difference]: Without dead ends: 121 [2018-11-07 04:57:33,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 04:57:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-07 04:57:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-07 04:57:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-07 04:57:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-11-07 04:57:33,408 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 114 [2018-11-07 04:57:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:33,408 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-11-07 04:57:33,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 04:57:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-11-07 04:57:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 04:57:33,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:33,409 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:33,410 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:33,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:33,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1734968039, now seen corresponding path program 26 times [2018-11-07 04:57:33,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:33,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:33,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:33,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:33,411 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:33,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:33,790 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:33,790 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:33,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:33,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:33,791 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:33,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:33,799 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:36,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 04:57:36,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:36,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:36,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:37,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:37,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 04:57:37,159 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:37,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 04:57:37,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 04:57:37,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 04:57:37,161 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 30 states. [2018-11-07 04:57:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:37,369 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-11-07 04:57:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 04:57:37,370 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 118 [2018-11-07 04:57:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:37,371 INFO L225 Difference]: With dead ends: 131 [2018-11-07 04:57:37,372 INFO L226 Difference]: Without dead ends: 125 [2018-11-07 04:57:37,374 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 04:57:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-07 04:57:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-07 04:57:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-07 04:57:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-11-07 04:57:37,378 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 118 [2018-11-07 04:57:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:37,378 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-11-07 04:57:37,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 04:57:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-11-07 04:57:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 04:57:37,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:37,379 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:37,379 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:37,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash 840707712, now seen corresponding path program 27 times [2018-11-07 04:57:37,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:37,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:37,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:37,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:37,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:37,837 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:37,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:37,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:37,838 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:37,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:37,847 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:38,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:38,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:38,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:38,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:39,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:39,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-11-07 04:57:39,308 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:39,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 04:57:39,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 04:57:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 04:57:39,309 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 31 states. [2018-11-07 04:57:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:39,468 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-11-07 04:57:39,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 04:57:39,469 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 122 [2018-11-07 04:57:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:39,470 INFO L225 Difference]: With dead ends: 135 [2018-11-07 04:57:39,470 INFO L226 Difference]: Without dead ends: 129 [2018-11-07 04:57:39,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 04:57:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-07 04:57:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-11-07 04:57:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-07 04:57:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-11-07 04:57:39,475 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 122 [2018-11-07 04:57:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:39,476 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-11-07 04:57:39,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 04:57:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-11-07 04:57:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 04:57:39,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:39,477 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:39,477 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:39,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash -974297703, now seen corresponding path program 28 times [2018-11-07 04:57:39,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:39,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:39,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:40,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:40,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:40,088 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:40,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:40,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:40,088 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:40,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:40,097 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:40,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:40,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:41,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:41,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 04:57:41,426 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:41,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 04:57:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 04:57:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 04:57:41,428 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 32 states. [2018-11-07 04:57:41,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:41,664 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-11-07 04:57:41,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 04:57:41,665 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-11-07 04:57:41,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:41,666 INFO L225 Difference]: With dead ends: 139 [2018-11-07 04:57:41,666 INFO L226 Difference]: Without dead ends: 133 [2018-11-07 04:57:41,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 04:57:41,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-07 04:57:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-07 04:57:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 04:57:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-11-07 04:57:41,671 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 126 [2018-11-07 04:57:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:41,672 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-11-07 04:57:41,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 04:57:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-11-07 04:57:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 04:57:41,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:41,673 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:41,673 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:41,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:41,673 INFO L82 PathProgramCache]: Analyzing trace with hash 296446002, now seen corresponding path program 29 times [2018-11-07 04:57:41,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:41,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:41,674 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:42,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:42,116 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:42,116 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:42,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:42,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:42,117 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:42,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:42,138 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:45,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 04:57:45,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:45,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:45,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:46,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:46,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 04:57:46,791 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:46,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 04:57:46,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 04:57:46,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 04:57:46,792 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 33 states. [2018-11-07 04:57:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:46,918 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-11-07 04:57:46,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 04:57:46,918 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 130 [2018-11-07 04:57:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:46,920 INFO L225 Difference]: With dead ends: 143 [2018-11-07 04:57:46,920 INFO L226 Difference]: Without dead ends: 137 [2018-11-07 04:57:46,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 04:57:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-07 04:57:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-07 04:57:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 04:57:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-11-07 04:57:46,925 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 130 [2018-11-07 04:57:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:46,926 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-11-07 04:57:46,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 04:57:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-11-07 04:57:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 04:57:46,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:46,927 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:46,927 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:46,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1929672267, now seen corresponding path program 30 times [2018-11-07 04:57:46,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:46,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:46,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:46,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:46,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:47,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:47,580 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:47,581 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:47,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:47,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:47,581 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:47,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:57:47,590 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:57:48,753 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:57:48,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:48,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:48,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:49,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:49,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-11-07 04:57:49,908 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:49,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 04:57:49,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 04:57:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 04:57:49,910 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 34 states. [2018-11-07 04:57:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:50,075 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-11-07 04:57:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 04:57:50,075 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 134 [2018-11-07 04:57:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:50,076 INFO L225 Difference]: With dead ends: 147 [2018-11-07 04:57:50,076 INFO L226 Difference]: Without dead ends: 141 [2018-11-07 04:57:50,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 04:57:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-07 04:57:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-07 04:57:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-07 04:57:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-11-07 04:57:50,081 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 134 [2018-11-07 04:57:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:50,082 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-11-07 04:57:50,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 04:57:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-11-07 04:57:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-07 04:57:50,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:50,083 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:50,083 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:50,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:50,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1183240164, now seen corresponding path program 31 times [2018-11-07 04:57:50,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:50,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:50,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:50,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:50,084 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:51,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:51,046 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:51,046 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:51,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:51,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:51,047 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:51,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:51,056 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:51,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:51,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:52,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:52,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-07 04:57:52,462 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:52,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 04:57:52,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 04:57:52,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 04:57:52,464 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 35 states. [2018-11-07 04:57:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:52,596 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-11-07 04:57:52,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 04:57:52,597 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2018-11-07 04:57:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:52,598 INFO L225 Difference]: With dead ends: 151 [2018-11-07 04:57:52,598 INFO L226 Difference]: Without dead ends: 145 [2018-11-07 04:57:52,599 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 04:57:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-07 04:57:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-07 04:57:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-07 04:57:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-11-07 04:57:52,603 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 138 [2018-11-07 04:57:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:52,603 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-11-07 04:57:52,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 04:57:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-11-07 04:57:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 04:57:52,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:52,604 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:57:52,604 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:52,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:52,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2007020797, now seen corresponding path program 32 times [2018-11-07 04:57:52,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:52,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:52,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:52,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:52,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:54,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:54,113 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:54,113 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:54,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:54,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:54,113 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:54,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:54,122 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:57:59,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-07 04:57:59,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:57:59,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:57:59,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:01,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:01,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-07 04:58:01,301 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:01,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 04:58:01,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 04:58:01,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 04:58:01,303 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 36 states. [2018-11-07 04:58:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:02,067 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-11-07 04:58:02,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 04:58:02,067 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 142 [2018-11-07 04:58:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:02,069 INFO L225 Difference]: With dead ends: 155 [2018-11-07 04:58:02,069 INFO L226 Difference]: Without dead ends: 149 [2018-11-07 04:58:02,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 04:58:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-07 04:58:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-11-07 04:58:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 04:58:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-11-07 04:58:02,075 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 142 [2018-11-07 04:58:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:02,075 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-11-07 04:58:02,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 04:58:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-11-07 04:58:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 04:58:02,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:02,077 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:02,077 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:02,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:02,077 INFO L82 PathProgramCache]: Analyzing trace with hash 278947222, now seen corresponding path program 33 times [2018-11-07 04:58:02,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:02,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:02,078 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:02,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:02,681 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:02,681 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:02,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:02,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:02,682 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:02,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:58:02,691 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:58:04,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:58:04,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:04,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:04,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:05,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:05,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-11-07 04:58:05,448 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:05,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 04:58:05,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 04:58:05,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 04:58:05,450 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 37 states. [2018-11-07 04:58:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:05,707 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-11-07 04:58:05,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 04:58:05,708 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 146 [2018-11-07 04:58:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:05,710 INFO L225 Difference]: With dead ends: 159 [2018-11-07 04:58:05,710 INFO L226 Difference]: Without dead ends: 153 [2018-11-07 04:58:05,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 04:58:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-07 04:58:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-07 04:58:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-07 04:58:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-11-07 04:58:05,715 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 146 [2018-11-07 04:58:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:05,715 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-11-07 04:58:05,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 04:58:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-11-07 04:58:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-07 04:58:05,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:05,717 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:05,717 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:05,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash -894164561, now seen corresponding path program 34 times [2018-11-07 04:58:05,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:05,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:05,718 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:07,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:07,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:07,183 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:07,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:07,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:07,184 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:07,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:07,192 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:58:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:07,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:07,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:09,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:09,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-07 04:58:09,640 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:09,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 04:58:09,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 04:58:09,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 04:58:09,642 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 38 states. [2018-11-07 04:58:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:09,788 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-11-07 04:58:09,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 04:58:09,788 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 150 [2018-11-07 04:58:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:09,790 INFO L225 Difference]: With dead ends: 163 [2018-11-07 04:58:09,791 INFO L226 Difference]: Without dead ends: 157 [2018-11-07 04:58:09,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 04:58:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-07 04:58:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-11-07 04:58:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-07 04:58:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-11-07 04:58:09,797 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 150 [2018-11-07 04:58:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:09,797 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-11-07 04:58:09,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 04:58:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-11-07 04:58:09,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-07 04:58:09,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:09,798 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:09,799 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:09,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1645598392, now seen corresponding path program 35 times [2018-11-07 04:58:09,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:09,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:09,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:09,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:09,800 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:11,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:11,086 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:11,086 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:11,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:11,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:11,087 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:11,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:58:11,094 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:58:21,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 04:58:21,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:21,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:21,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:23,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:23,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-07 04:58:23,310 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:23,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 04:58:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 04:58:23,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 04:58:23,311 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 39 states. [2018-11-07 04:58:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:23,521 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-11-07 04:58:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 04:58:23,522 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2018-11-07 04:58:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:23,523 INFO L225 Difference]: With dead ends: 167 [2018-11-07 04:58:23,523 INFO L226 Difference]: Without dead ends: 161 [2018-11-07 04:58:23,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 04:58:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-07 04:58:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-11-07 04:58:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-07 04:58:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-11-07 04:58:23,528 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 154 [2018-11-07 04:58:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:23,529 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-11-07 04:58:23,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 04:58:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-11-07 04:58:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 04:58:23,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:23,530 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:23,530 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:23,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1362148449, now seen corresponding path program 36 times [2018-11-07 04:58:23,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:23,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:23,532 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:24,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:24,982 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:24,983 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:24,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:24,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:24,983 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:25,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:58:25,000 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:58:28,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:58:28,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:28,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:28,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:30,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:30,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-11-07 04:58:30,001 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:30,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 04:58:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 04:58:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 04:58:30,003 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 40 states. [2018-11-07 04:58:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:30,191 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-11-07 04:58:30,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 04:58:30,192 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 158 [2018-11-07 04:58:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:30,193 INFO L225 Difference]: With dead ends: 171 [2018-11-07 04:58:30,193 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 04:58:30,194 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 04:58:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 04:58:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-11-07 04:58:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-07 04:58:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-11-07 04:58:30,198 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 158 [2018-11-07 04:58:30,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:30,198 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-11-07 04:58:30,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 04:58:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-11-07 04:58:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-07 04:58:30,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:30,199 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:30,199 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:30,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:30,200 INFO L82 PathProgramCache]: Analyzing trace with hash 173415162, now seen corresponding path program 37 times [2018-11-07 04:58:30,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:30,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:30,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:30,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:30,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:30,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:30,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:30,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:30,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:30,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:30,874 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:30,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:30,890 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:58:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:30,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:31,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:33,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:33,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-07 04:58:33,013 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:33,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 04:58:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 04:58:33,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 04:58:33,015 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 41 states. [2018-11-07 04:58:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:33,183 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-11-07 04:58:33,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 04:58:33,184 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 162 [2018-11-07 04:58:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:33,186 INFO L225 Difference]: With dead ends: 175 [2018-11-07 04:58:33,186 INFO L226 Difference]: Without dead ends: 169 [2018-11-07 04:58:33,187 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 04:58:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-07 04:58:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2018-11-07 04:58:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 04:58:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-11-07 04:58:33,191 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 162 [2018-11-07 04:58:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:33,192 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-11-07 04:58:33,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 04:58:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-11-07 04:58:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 04:58:33,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:33,193 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:33,193 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:33,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:33,194 INFO L82 PathProgramCache]: Analyzing trace with hash -569866989, now seen corresponding path program 38 times [2018-11-07 04:58:33,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:33,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:33,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:34,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:34,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:34,718 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:34,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:34,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:34,718 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:34,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:58:34,728 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:58:47,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-07 04:58:47,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:47,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:47,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:49,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:49,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-07 04:58:49,588 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:49,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 04:58:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 04:58:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 04:58:49,590 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 42 states. [2018-11-07 04:58:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:49,819 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-11-07 04:58:49,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 04:58:49,819 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 166 [2018-11-07 04:58:49,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:49,820 INFO L225 Difference]: With dead ends: 179 [2018-11-07 04:58:49,820 INFO L226 Difference]: Without dead ends: 173 [2018-11-07 04:58:49,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 04:58:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-07 04:58:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-11-07 04:58:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 04:58:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-11-07 04:58:49,825 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 166 [2018-11-07 04:58:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:49,826 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-11-07 04:58:49,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 04:58:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-11-07 04:58:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 04:58:49,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:49,827 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:49,827 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:49,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:49,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1607875244, now seen corresponding path program 39 times [2018-11-07 04:58:49,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:49,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:49,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:49,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:49,829 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:52,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:52,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:52,755 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:52,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:52,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:52,756 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:52,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:58:52,764 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:58:54,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:58:54,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:54,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:54,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:56,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:56,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-11-07 04:58:56,177 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:56,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 04:58:56,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 04:58:56,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 04:58:56,179 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 43 states. [2018-11-07 04:58:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:56,362 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-11-07 04:58:56,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 04:58:56,363 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-11-07 04:58:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:56,364 INFO L225 Difference]: With dead ends: 183 [2018-11-07 04:58:56,364 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 04:58:56,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 04:58:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 04:58:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-07 04:58:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-07 04:58:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-11-07 04:58:56,368 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 170 [2018-11-07 04:58:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:56,369 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-11-07 04:58:56,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 04:58:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-11-07 04:58:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-07 04:58:56,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:56,370 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:56,370 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:56,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:56,370 INFO L82 PathProgramCache]: Analyzing trace with hash 841841605, now seen corresponding path program 40 times [2018-11-07 04:58:56,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:56,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:56,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:56,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:56,371 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:57,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:57,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:57,899 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:57,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:57,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:57,899 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:57,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:57,909 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:58:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:57,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:57,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:58:59,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:59,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-07 04:58:59,745 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:59,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 04:58:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 04:58:59,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 04:58:59,747 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 44 states. [2018-11-07 04:58:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:59,945 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-11-07 04:58:59,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 04:58:59,945 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 174 [2018-11-07 04:58:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:59,946 INFO L225 Difference]: With dead ends: 187 [2018-11-07 04:58:59,946 INFO L226 Difference]: Without dead ends: 181 [2018-11-07 04:58:59,947 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 04:58:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-07 04:58:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2018-11-07 04:58:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-07 04:58:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-11-07 04:58:59,952 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 174 [2018-11-07 04:58:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:59,952 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-11-07 04:58:59,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 04:58:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-11-07 04:58:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-07 04:58:59,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:59,954 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:58:59,954 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:59,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1772320674, now seen corresponding path program 41 times [2018-11-07 04:58:59,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:59,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:59,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:59,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:59,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:00,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:00,826 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:00,826 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:00,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:00,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:00,826 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:59:00,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:00,835 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:32,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-07 04:59:32,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:32,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:32,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:34,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:34,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-07 04:59:34,918 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:34,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 04:59:34,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 04:59:34,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 04:59:34,919 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 45 states. [2018-11-07 04:59:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:35,128 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-11-07 04:59:35,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 04:59:35,129 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 178 [2018-11-07 04:59:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:35,130 INFO L225 Difference]: With dead ends: 191 [2018-11-07 04:59:35,130 INFO L226 Difference]: Without dead ends: 185 [2018-11-07 04:59:35,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 04:59:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-07 04:59:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-11-07 04:59:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-07 04:59:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-11-07 04:59:35,134 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 178 [2018-11-07 04:59:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:35,135 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-11-07 04:59:35,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 04:59:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-11-07 04:59:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-07 04:59:35,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:35,136 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:35,136 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:35,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:35,136 INFO L82 PathProgramCache]: Analyzing trace with hash -57565065, now seen corresponding path program 42 times [2018-11-07 04:59:35,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:35,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:35,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:35,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:35,137 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:35,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:35,981 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:35,981 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:35,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:35,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:35,982 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:59:35,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:59:35,992 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:59:38,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:59:38,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:38,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:38,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:40,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:40,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-11-07 04:59:40,372 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:40,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 04:59:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 04:59:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 04:59:40,374 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 46 states. [2018-11-07 04:59:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:40,599 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-11-07 04:59:40,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 04:59:40,599 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 182 [2018-11-07 04:59:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:40,600 INFO L225 Difference]: With dead ends: 195 [2018-11-07 04:59:40,600 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 04:59:40,601 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 04:59:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 04:59:40,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-11-07 04:59:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-07 04:59:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-11-07 04:59:40,604 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 182 [2018-11-07 04:59:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:40,605 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-11-07 04:59:40,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 04:59:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-11-07 04:59:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-07 04:59:40,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:40,606 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:40,606 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:40,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1814363120, now seen corresponding path program 43 times [2018-11-07 04:59:40,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:40,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:40,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:40,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:40,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:41,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:41,444 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:41,445 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:41,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:41,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:41,445 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:59:41,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:41,455 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:41,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:41,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:43,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:43,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-07 04:59:43,906 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:43,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 04:59:43,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 04:59:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 04:59:43,908 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 47 states. [2018-11-07 04:59:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:44,158 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-11-07 04:59:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 04:59:44,158 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 186 [2018-11-07 04:59:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:44,159 INFO L225 Difference]: With dead ends: 199 [2018-11-07 04:59:44,159 INFO L226 Difference]: Without dead ends: 193 [2018-11-07 04:59:44,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 04:59:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-07 04:59:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2018-11-07 04:59:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-07 04:59:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-11-07 04:59:44,163 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 186 [2018-11-07 04:59:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:44,163 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-11-07 04:59:44,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 04:59:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-11-07 04:59:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 04:59:44,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:44,164 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:44,164 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:44,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash -634981591, now seen corresponding path program 44 times [2018-11-07 04:59:44,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:44,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:44,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:44,166 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:45,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:45,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:45,183 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:45,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:45,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:45,183 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:59:45,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:45,192 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:20,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-07 05:00:20,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:20,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:20,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:22,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:22,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-11-07 05:00:22,734 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:22,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 05:00:22,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 05:00:22,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 05:00:22,735 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 48 states. [2018-11-07 05:00:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:22,943 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-11-07 05:00:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 05:00:22,943 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 190 [2018-11-07 05:00:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:22,945 INFO L225 Difference]: With dead ends: 203 [2018-11-07 05:00:22,945 INFO L226 Difference]: Without dead ends: 197 [2018-11-07 05:00:22,946 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 05:00:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-07 05:00:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-11-07 05:00:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-07 05:00:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-11-07 05:00:22,949 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 190 [2018-11-07 05:00:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:22,950 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-11-07 05:00:22,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 05:00:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-11-07 05:00:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 05:00:22,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:22,951 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:22,951 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:22,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:22,952 INFO L82 PathProgramCache]: Analyzing trace with hash 742632898, now seen corresponding path program 45 times [2018-11-07 05:00:22,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:22,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:22,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:22,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:24,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:24,418 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:24,418 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:24,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:24,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:24,419 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:24,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:24,427 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:27,944 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:27,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:27,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:28,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:30,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:30,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-11-07 05:00:30,825 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:30,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 05:00:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 05:00:30,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 05:00:30,826 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 49 states. [2018-11-07 05:00:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:31,052 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-11-07 05:00:31,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 05:00:31,052 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 194 [2018-11-07 05:00:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:31,054 INFO L225 Difference]: With dead ends: 207 [2018-11-07 05:00:31,054 INFO L226 Difference]: Without dead ends: 201 [2018-11-07 05:00:31,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 05:00:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-07 05:00:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-11-07 05:00:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 05:00:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-11-07 05:00:31,058 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 194 [2018-11-07 05:00:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:31,059 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-11-07 05:00:31,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 05:00:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-11-07 05:00:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 05:00:31,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:31,060 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:31,061 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:31,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1440707547, now seen corresponding path program 46 times [2018-11-07 05:00:31,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:31,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:31,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:31,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:31,062 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:32,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:32,319 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:32,319 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:32,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:32,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:32,319 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:32,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:32,330 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:32,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:32,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:35,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:35,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-11-07 05:00:35,101 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:35,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 05:00:35,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 05:00:35,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 05:00:35,102 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 50 states. [2018-11-07 05:00:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:35,333 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-11-07 05:00:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 05:00:35,333 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 198 [2018-11-07 05:00:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:35,335 INFO L225 Difference]: With dead ends: 211 [2018-11-07 05:00:35,335 INFO L226 Difference]: Without dead ends: 205 [2018-11-07 05:00:35,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 05:00:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-07 05:00:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2018-11-07 05:00:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-07 05:00:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-11-07 05:00:35,341 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 198 [2018-11-07 05:00:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:35,342 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-11-07 05:00:35,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 05:00:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-11-07 05:00:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-07 05:00:35,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:35,343 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:35,343 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:35,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:35,343 INFO L82 PathProgramCache]: Analyzing trace with hash 562595188, now seen corresponding path program 47 times [2018-11-07 05:00:35,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:35,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:35,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:35,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:35,344 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:36,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:36,513 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:36,513 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:36,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:36,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:36,514 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:00:36,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:36,524 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:01:15,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-11-07 05:01:15,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:15,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:15,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 05:01:17,717 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 05:01:17,917 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:01:17,918 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 05:01:17,923 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 05:01:17,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:01:17 BoogieIcfgContainer [2018-11-07 05:01:17,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:01:17,924 INFO L168 Benchmark]: Toolchain (without parser) took 257023.57 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -706.4 MB). Peak memory consumption was 301.8 MB. Max. memory is 7.1 GB. [2018-11-07 05:01:17,926 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:01:17,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.34 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 05:01:17,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.56 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 05:01:17,927 INFO L168 Benchmark]: Boogie Preprocessor took 40.75 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 05:01:17,927 INFO L168 Benchmark]: RCFGBuilder took 461.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.4 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. [2018-11-07 05:01:17,928 INFO L168 Benchmark]: TraceAbstraction took 256177.54 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 265.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 72.5 MB). Peak memory consumption was 338.3 MB. Max. memory is 7.1 GB. [2018-11-07 05:01:17,931 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 307.34 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 30.56 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 40.75 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 461.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.4 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256177.54 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 265.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 72.5 MB). Peak memory consumption was 338.3 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 203 with TraceHistMax 48,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 94 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. TIMEOUT Result, 256.1s OverallTime, 49 OverallIterations, 48 TraceHistogramMax, 7.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 684 SDtfs, 2256 SDslu, 9630 SDs, 0 SdLazy, 4359 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11114 GetRequests, 8813 SyntacticMatches, 0 SemanticMatches, 2301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 77.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 48 MinimizatonAttempts, 94 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 120.6s SatisfiabilityAnalysisTime, 81.4s InterpolantComputationTime, 9963 NumberOfCodeBlocks, 9963 NumberOfCodeBlocksAsserted, 454 NumberOfCheckSat, 14791 ConstructedInterpolants, 0 QuantifiedInterpolants, 5582879 SizeOfPredicates, 46 NumberOfNonLiveVariables, 7659 ConjunctsInSsa, 1173 ConjunctsInUnsatCore, 140 InterpolantComputations, 2 PerfectInterpolantSequences, 0/201066 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown