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/simple_false-unreach-call4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:59:54,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:59:54,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:59:54,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:59:54,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:59:54,324 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:59:54,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:59:54,329 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:59:54,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:59:54,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:59:54,333 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:59:54,334 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:59:54,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:59:54,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:59:54,340 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:59:54,341 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:59:54,342 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:59:54,345 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:59:54,346 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:59:54,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:59:54,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:59:54,350 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:59:54,353 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:59:54,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:59:54,353 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:59:54,354 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:59:54,355 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:59:54,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:59:54,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:59:54,358 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:59:54,358 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:59:54,359 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:59:54,359 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:59:54,359 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:59:54,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:59:54,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:59:54,361 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:59:54,384 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:59:54,384 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:59:54,385 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:59:54,385 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:59:54,386 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:59:54,386 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:59:54,386 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:59:54,386 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:59:54,386 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:59:54,387 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:59:54,387 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:59:54,387 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:59:54,389 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:59:54,389 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:59:54,389 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:59:54,389 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:59:54,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:59:54,390 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:59:54,390 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:59:54,390 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:59:54,390 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:59:54,390 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:59:54,392 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:59:54,392 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:59:54,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:59:54,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:59:54,393 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:59:54,393 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:59:54,393 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:59:54,393 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:59:54,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:59:54,394 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:59:54,394 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:59:54,394 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:59:54,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:59:54,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:59:54,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:59:54,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:59:54,465 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:59:54,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call4.i [2018-11-07 04:59:54,531 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b6597dc/892201a1e5a443458dfe60d692b437a7/FLAG376d4912c [2018-11-07 04:59:55,054 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:59:55,055 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call4.i [2018-11-07 04:59:55,064 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b6597dc/892201a1e5a443458dfe60d692b437a7/FLAG376d4912c [2018-11-07 04:59:55,084 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b6597dc/892201a1e5a443458dfe60d692b437a7 [2018-11-07 04:59:55,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:59:55,101 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:59:55,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:59:55,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:59:55,109 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:59:55,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1012a27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55, skipping insertion in model container [2018-11-07 04:59:55,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:59:55,150 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:59:55,378 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:59:55,385 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:59:55,401 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:59:55,416 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:59:55,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55 WrapperNode [2018-11-07 04:59:55,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:59:55,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:59:55,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:59:55,418 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:59:55,428 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:59:55" (1/1) ... [2018-11-07 04:59:55,435 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:59:55" (1/1) ... [2018-11-07 04:59:55,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:59:55,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:59:55,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:59:55,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:59:55,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55" (1/1) ... [2018-11-07 04:59:55,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:59:55,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:59:55,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:59:55,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:59:55,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:59:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:59:55,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:59:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:59:55,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:59:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:59:55,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:59:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:59:55,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:59:55,790 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:59:55,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:59:55 BoogieIcfgContainer [2018-11-07 04:59:55,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:59:55,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:59:55,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:59:55,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:59:55,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:59:55" (1/3) ... [2018-11-07 04:59:55,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dd69d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:59:55, skipping insertion in model container [2018-11-07 04:59:55,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:59:55" (2/3) ... [2018-11-07 04:59:55,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dd69d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:59:55, skipping insertion in model container [2018-11-07 04:59:55,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:59:55" (3/3) ... [2018-11-07 04:59:55,799 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call4.i [2018-11-07 04:59:55,810 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:59:55,817 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:59:55,831 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:59:55,864 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:59:55,865 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:59:55,865 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:59:55,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:59:55,865 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:59:55,865 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:59:55,865 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:59:55,866 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:59:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-07 04:59:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 04:59:55,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:55,892 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:55,894 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:55,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:55,899 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-07 04:59:55,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:55,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:55,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:55,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:55,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:56,005 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:59:56,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:59:56,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:59:56,007 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:59:56,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:59:56,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:59:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:59:56,027 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-07 04:59:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:56,048 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-07 04:59:56,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:59:56,050 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 04:59:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:56,059 INFO L225 Difference]: With dead ends: 29 [2018-11-07 04:59:56,060 INFO L226 Difference]: Without dead ends: 12 [2018-11-07 04:59:56,063 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:59:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-07 04:59:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-07 04:59:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-07 04:59:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-07 04:59:56,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-07 04:59:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:56,107 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-07 04:59:56,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:59:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-07 04:59:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 04:59:56,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:56,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:56,108 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:56,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:56,109 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-07 04:59:56,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:56,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:56,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:56,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:56,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:56,362 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:59:56,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:59:56,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:59:56,363 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:59:56,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:59:56,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:59:56,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:59:56,369 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-07 04:59:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:56,483 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-07 04:59:56,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:59:56,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 04:59:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:56,485 INFO L225 Difference]: With dead ends: 19 [2018-11-07 04:59:56,486 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 04:59:56,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:59:56,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 04:59:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 04:59:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 04:59:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-07 04:59:56,494 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-07 04:59:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:56,495 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-07 04:59:56,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:59:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-07 04:59:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 04:59:56,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:56,498 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:56,498 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:56,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-07 04:59:56,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:56,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:56,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:56,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:56,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:56,654 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:59:56,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:56,655 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:56,656 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-07 04:59:56,659 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-11-07 04:59:56,713 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:59:56,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:59:56,837 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:59:57,217 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:59:57,219 INFO L272 AbstractInterpreter]: Visited 12 different actions 95 times. Merged at 3 different actions 37 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 04:59:57,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:57,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:59:57,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:57,254 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:59:57,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:57,270 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:57,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:57,380 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:59:57,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:57,471 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:59:57,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:57,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 04:59:57,494 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:57,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 04:59:57,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 04:59:57,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:59:57,496 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-11-07 04:59:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:57,539 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 04:59:57,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:59:57,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-07 04:59:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:57,540 INFO L225 Difference]: With dead ends: 21 [2018-11-07 04:59:57,541 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 04:59:57,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:59:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 04:59:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 04:59:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 04:59:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-07 04:59:57,546 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-07 04:59:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:57,546 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-07 04:59:57,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 04:59:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-07 04:59:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 04:59:57,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:57,547 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:57,548 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:57,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-07 04:59:57,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:57,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:57,550 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:57,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:57,726 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:57,726 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:57,727 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:57,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:57,727 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:59:57,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:57,737 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:57,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:59:57,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:57,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:57,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:58,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 04:59:58,084 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:58,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:59:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:59:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:59:58,085 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-11-07 04:59:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:58,131 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-07 04:59:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:59:58,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 04:59:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:58,133 INFO L225 Difference]: With dead ends: 23 [2018-11-07 04:59:58,133 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 04:59:58,134 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:59:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 04:59:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 04:59:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 04:59:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 04:59:58,139 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-07 04:59:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:58,139 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 04:59:58,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:59:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 04:59:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 04:59:58,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:58,141 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:58,141 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:58,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-07 04:59:58,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:58,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:58,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:58,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:58,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:58,259 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:58,260 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:58,260 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:58,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:58,261 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:59:58,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:59:58,270 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:59:58,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:59:58,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:58,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:58,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 04:59:58,562 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:58,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:59:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:59:58,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:59:58,563 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-07 04:59:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:58,619 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-07 04:59:58,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:59:58,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 04:59:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:58,621 INFO L225 Difference]: With dead ends: 25 [2018-11-07 04:59:58,621 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 04:59:58,622 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:59:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 04:59:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 04:59:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 04:59:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-07 04:59:58,627 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-07 04:59:58,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:58,627 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-07 04:59:58,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:59:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-07 04:59:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 04:59:58,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:58,628 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:58,629 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:58,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-07 04:59:58,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:58,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:58,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:58,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:58,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:58,842 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:58,842 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:58,842 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:58,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:58,843 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:59:58,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:58,855 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:59:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:58,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:58,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:59,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:59,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 04:59:59,396 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:59,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 04:59:59,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 04:59:59,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:59:59,398 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-11-07 04:59:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:59,439 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 04:59:59,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:59:59,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 04:59:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:59,440 INFO L225 Difference]: With dead ends: 27 [2018-11-07 04:59:59,440 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 04:59:59,441 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:59:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 04:59:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 04:59:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 04:59:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-07 04:59:59,446 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-07 04:59:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:59,446 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-07 04:59:59,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 04:59:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-07 04:59:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 04:59:59,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:59,447 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:59:59,447 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:59,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:59,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-07 04:59:59,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:59,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:59,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:59:59,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:59,449 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:59,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:59,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:59,648 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:59,648 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:59,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:59,648 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:59:59,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:59:59,657 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:59,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 04:59:59,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:59,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:59,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:59:59,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:59,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 04:59:59,940 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:59,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:59:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:59:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 04:59:59,942 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-11-07 05:00:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:00,019 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-07 05:00:00,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:00:00,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 05:00:00,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:00,023 INFO L225 Difference]: With dead ends: 29 [2018-11-07 05:00:00,023 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 05:00:00,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:00:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 05:00:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 05:00:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 05:00:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 05:00:00,028 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-07 05:00:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:00,029 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 05:00:00,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:00:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 05:00:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 05:00:00,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:00,030 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:00,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:00,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:00,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-07 05:00:00,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:00,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:00,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:00,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:00,032 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:00,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:00,616 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:00,616 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:00,617 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:00,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:00,617 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 05:00:00,626 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:00,626 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:00,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:00,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:00,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:00,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:00,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:00,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 05:00:00,919 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:00,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:00:00,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:00:00,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:00:00,921 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 9 states. [2018-11-07 05:00:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:00,985 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-07 05:00:00,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:00:00,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-07 05:00:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:00,988 INFO L225 Difference]: With dead ends: 31 [2018-11-07 05:00:00,988 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 05:00:00,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:00:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 05:00:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 05:00:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 05:00:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-07 05:00:00,994 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-07 05:00:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:00,994 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-07 05:00:00,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:00:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-07 05:00:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 05:00:00,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:00,995 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:00,996 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:00,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:00,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-11-07 05:00:00,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:00,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:00,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:00,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:00,998 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:01,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:01,178 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:01,178 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:01,178 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:01,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:01,179 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 05:00:01,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:01,187 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:01,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:01,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:01,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:01,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 05:00:01,514 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:01,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 05:00:01,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 05:00:01,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:00:01,516 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-11-07 05:00:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:01,660 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-07 05:00:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:00:01,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-07 05:00:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:01,664 INFO L225 Difference]: With dead ends: 33 [2018-11-07 05:00:01,664 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 05:00:01,665 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:00:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 05:00:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-07 05:00:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 05:00:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-07 05:00:01,670 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-07 05:00:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:01,670 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-07 05:00:01,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 05:00:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-07 05:00:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 05:00:01,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:01,671 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:01,672 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:01,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:01,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1579855560, now seen corresponding path program 8 times [2018-11-07 05:00:01,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:01,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:01,674 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:01,882 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 05:00:01,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:01,882 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:01,883 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:01,883 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:01,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:01,883 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 05:00:01,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:01,894 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:01,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 05:00:01,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:01,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:01,947 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 05:00:01,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:02,200 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 05:00:02,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:02,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 05:00:02,221 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:02,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 05:00:02,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 05:00:02,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:00:02,223 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 11 states. [2018-11-07 05:00:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:02,312 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-07 05:00:02,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:00:02,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-07 05:00:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:02,314 INFO L225 Difference]: With dead ends: 35 [2018-11-07 05:00:02,314 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 05:00:02,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:00:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 05:00:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-07 05:00:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 05:00:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-07 05:00:02,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-11-07 05:00:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:02,321 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-07 05:00:02,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 05:00:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-07 05:00:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 05:00:02,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:02,322 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:02,322 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:02,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1182244082, now seen corresponding path program 9 times [2018-11-07 05:00:02,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:02,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:02,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:02,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:02,324 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:02,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:02,522 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:02,523 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:02,523 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:02,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:02,523 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 05:00:02,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:02,532 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:02,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:02,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:02,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:02,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:02,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:02,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 05:00:02,873 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:02,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 05:00:02,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 05:00:02,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:00:02,875 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 12 states. [2018-11-07 05:00:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:03,042 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-07 05:00:03,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 05:00:03,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-07 05:00:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:03,045 INFO L225 Difference]: With dead ends: 37 [2018-11-07 05:00:03,045 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 05:00:03,046 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:00:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 05:00:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 05:00:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 05:00:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-07 05:00:03,050 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-11-07 05:00:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:03,051 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-07 05:00:03,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 05:00:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-07 05:00:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 05:00:03,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:03,052 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:03,052 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:03,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:03,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1270211116, now seen corresponding path program 10 times [2018-11-07 05:00:03,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:03,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:03,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:03,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:03,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:03,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:03,333 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:03,333 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:03,333 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:03,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:03,333 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 05:00:03,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:03,343 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:03,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:03,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:03,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:03,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 05:00:03,877 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:03,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 05:00:03,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 05:00:03,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:00:03,878 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 13 states. [2018-11-07 05:00:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:04,020 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 05:00:04,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:00:04,020 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-07 05:00:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:04,021 INFO L225 Difference]: With dead ends: 39 [2018-11-07 05:00:04,021 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 05:00:04,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:00:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 05:00:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-07 05:00:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 05:00:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-07 05:00:04,027 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-11-07 05:00:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:04,028 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-07 05:00:04,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 05:00:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-07 05:00:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 05:00:04,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:04,029 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:04,029 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:04,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash 92815130, now seen corresponding path program 11 times [2018-11-07 05:00:04,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:04,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:04,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:04,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:04,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:04,402 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:04,403 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:04,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:04,403 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 05:00:04,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:04,415 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:04,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 05:00:04,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:04,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:04,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:05,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:05,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 05:00:05,289 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:05,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:00:05,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:00:05,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:00:05,291 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 14 states. [2018-11-07 05:00:05,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:05,559 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-07 05:00:05,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 05:00:05,561 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-07 05:00:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:05,562 INFO L225 Difference]: With dead ends: 41 [2018-11-07 05:00:05,562 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 05:00:05,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:00:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 05:00:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-07 05:00:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 05:00:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-07 05:00:05,568 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-11-07 05:00:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:05,568 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-07 05:00:05,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:00:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-07 05:00:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 05:00:05,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:05,569 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:05,570 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:05,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:05,570 INFO L82 PathProgramCache]: Analyzing trace with hash -3987744, now seen corresponding path program 12 times [2018-11-07 05:00:05,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:05,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:05,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:05,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:05,571 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:05,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:05,882 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:05,883 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:05,883 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:05,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:05,883 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 05:00:05,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:05,892 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:05,904 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:05,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:05,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:05,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:06,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:06,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 05:00:06,520 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:06,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 05:00:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 05:00:06,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:00:06,521 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 15 states. [2018-11-07 05:00:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:06,666 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-07 05:00:06,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 05:00:06,667 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-07 05:00:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:06,668 INFO L225 Difference]: With dead ends: 43 [2018-11-07 05:00:06,668 INFO L226 Difference]: Without dead ends: 38 [2018-11-07 05:00:06,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:00:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-07 05:00:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-07 05:00:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 05:00:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-07 05:00:06,674 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-11-07 05:00:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:06,675 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-07 05:00:06,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 05:00:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-07 05:00:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 05:00:06,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:06,676 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:06,676 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:06,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1457730854, now seen corresponding path program 13 times [2018-11-07 05:00:06,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:06,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:06,678 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:07,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:07,098 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:07,098 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:07,098 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:07,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:07,098 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 05:00:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:07,107 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:07,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:07,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:07,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:07,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 05:00:07,690 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:07,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:00:07,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:00:07,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 05:00:07,691 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 16 states. [2018-11-07 05:00:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:08,027 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-07 05:00:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:00:08,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-07 05:00:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:08,028 INFO L225 Difference]: With dead ends: 45 [2018-11-07 05:00:08,029 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 05:00:08,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 05:00:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 05:00:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-07 05:00:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 05:00:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-07 05:00:08,036 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-11-07 05:00:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:08,036 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-07 05:00:08,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:00:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-07 05:00:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 05:00:08,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:08,037 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:08,037 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:08,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:08,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1714997740, now seen corresponding path program 14 times [2018-11-07 05:00:08,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:08,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:08,039 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:08,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:08,808 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:08,808 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:08,809 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:08,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:08,809 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 05:00:08,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:08,821 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:08,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 05:00:08,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:08,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:08,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:09,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:09,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 05:00:09,509 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:09,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 05:00:09,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 05:00:09,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-07 05:00:09,510 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 17 states. [2018-11-07 05:00:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:09,687 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-07 05:00:09,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 05:00:09,688 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-07 05:00:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:09,689 INFO L225 Difference]: With dead ends: 47 [2018-11-07 05:00:09,689 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 05:00:09,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-07 05:00:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 05:00:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-07 05:00:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 05:00:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-07 05:00:09,696 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-11-07 05:00:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:09,696 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-07 05:00:09,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 05:00:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-07 05:00:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 05:00:09,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:09,697 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:09,697 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:09,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:09,698 INFO L82 PathProgramCache]: Analyzing trace with hash -159627982, now seen corresponding path program 15 times [2018-11-07 05:00:09,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:09,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:09,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:09,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:09,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:10,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:10,099 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:10,100 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:10,100 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:10,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:10,100 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 05:00:10,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:10,108 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:10,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:10,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:10,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:10,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:10,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:10,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 05:00:10,752 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:10,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 05:00:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 05:00:10,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:00:10,754 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 18 states. [2018-11-07 05:00:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:10,967 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-07 05:00:10,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 05:00:10,967 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-07 05:00:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:10,968 INFO L225 Difference]: With dead ends: 49 [2018-11-07 05:00:10,968 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 05:00:10,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:00:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 05:00:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-07 05:00:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 05:00:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-07 05:00:10,975 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-11-07 05:00:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:10,975 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-07 05:00:10,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 05:00:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-07 05:00:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 05:00:10,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:10,976 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:10,976 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:10,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2083649800, now seen corresponding path program 16 times [2018-11-07 05:00:10,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:10,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:10,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:10,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:10,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:11,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:11,329 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:11,329 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:11,330 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:11,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:11,330 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 05:00:11,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:11,339 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:11,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:11,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:12,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:12,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 05:00:12,075 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:12,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:00:12,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:00:12,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:00:12,077 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-11-07 05:00:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:12,439 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 05:00:12,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 05:00:12,440 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-07 05:00:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:12,441 INFO L225 Difference]: With dead ends: 51 [2018-11-07 05:00:12,441 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 05:00:12,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:00:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 05:00:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-07 05:00:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 05:00:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-07 05:00:12,449 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-11-07 05:00:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:12,449 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-07 05:00:12,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:00:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-07 05:00:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 05:00:12,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:12,450 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:12,451 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:12,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:12,451 INFO L82 PathProgramCache]: Analyzing trace with hash 62287678, now seen corresponding path program 17 times [2018-11-07 05:00:12,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:12,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:12,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:13,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:13,423 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:13,423 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:13,423 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:13,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:13,423 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 05:00:13,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:13,433 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:13,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 05:00:13,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:13,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:13,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:14,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:14,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-07 05:00:14,497 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:14,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 05:00:14,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 05:00:14,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 05:00:14,499 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 20 states. [2018-11-07 05:00:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:15,116 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-07 05:00:15,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 05:00:15,116 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-07 05:00:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:15,117 INFO L225 Difference]: With dead ends: 53 [2018-11-07 05:00:15,118 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 05:00:15,118 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 05:00:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 05:00:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 05:00:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 05:00:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 05:00:15,122 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-11-07 05:00:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:15,122 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 05:00:15,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 05:00:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 05:00:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 05:00:15,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:15,123 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:15,123 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:15,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:15,124 INFO L82 PathProgramCache]: Analyzing trace with hash 723901956, now seen corresponding path program 18 times [2018-11-07 05:00:15,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:15,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:15,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:15,125 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:15,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:15,488 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:15,488 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:15,488 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:15,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:15,488 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 05:00:15,500 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:15,501 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:15,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:15,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:15,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:15,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:16,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:16,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2018-11-07 05:00:16,739 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:16,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 05:00:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 05:00:16,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 05:00:16,741 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 21 states. [2018-11-07 05:00:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:17,147 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-07 05:00:17,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 05:00:17,148 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-11-07 05:00:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:17,149 INFO L225 Difference]: With dead ends: 55 [2018-11-07 05:00:17,149 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 05:00:17,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 05:00:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 05:00:17,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-07 05:00:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 05:00:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-07 05:00:17,155 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-11-07 05:00:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:17,155 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-07 05:00:17,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 05:00:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-07 05:00:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 05:00:17,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:17,156 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:17,157 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:17,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash 880063306, now seen corresponding path program 19 times [2018-11-07 05:00:17,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:17,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:17,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:17,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:17,158 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:17,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:17,514 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:17,514 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:17,514 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:17,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:17,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 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 05:00:17,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:17,524 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:17,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:17,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:19,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:19,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2018-11-07 05:00:19,025 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:19,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 05:00:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 05:00:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 05:00:19,027 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 22 states. [2018-11-07 05:00:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:19,587 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-07 05:00:19,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 05:00:19,588 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-07 05:00:19,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:19,589 INFO L225 Difference]: With dead ends: 57 [2018-11-07 05:00:19,589 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 05:00:19,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 05:00:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 05:00:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-07 05:00:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 05:00:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-11-07 05:00:19,596 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-11-07 05:00:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:19,596 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-11-07 05:00:19,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 05:00:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-07 05:00:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 05:00:19,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:19,597 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:19,597 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:19,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:19,598 INFO L82 PathProgramCache]: Analyzing trace with hash 627265296, now seen corresponding path program 20 times [2018-11-07 05:00:19,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:19,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:19,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:19,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:19,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:21,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:21,431 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:21,431 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:21,431 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:21,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:21,431 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 05:00:21,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:21,439 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:21,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 05:00:21,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:21,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:21,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:23,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:23,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 05:00:23,225 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:23,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 05:00:23,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 05:00:23,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 05:00:23,227 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 23 states. [2018-11-07 05:00:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:23,574 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-07 05:00:23,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 05:00:23,579 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-11-07 05:00:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:23,580 INFO L225 Difference]: With dead ends: 59 [2018-11-07 05:00:23,580 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 05:00:23,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 05:00:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 05:00:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-07 05:00:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 05:00:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-07 05:00:23,587 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-11-07 05:00:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:23,587 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-07 05:00:23,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 05:00:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-07 05:00:23,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 05:00:23,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:23,588 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:23,589 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:23,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:23,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1793453738, now seen corresponding path program 21 times [2018-11-07 05:00:23,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:23,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:23,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:23,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:23,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:23,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:23,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:23,976 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:23,976 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:23,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:23,976 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 05:00:23,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:23,985 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:24,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:24,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:24,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:24,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:25,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:25,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2018-11-07 05:00:25,157 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:25,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 05:00:25,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 05:00:25,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 05:00:25,159 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 24 states. [2018-11-07 05:00:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:25,495 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-07 05:00:25,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 05:00:25,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-11-07 05:00:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:25,496 INFO L225 Difference]: With dead ends: 61 [2018-11-07 05:00:25,496 INFO L226 Difference]: Without dead ends: 56 [2018-11-07 05:00:25,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2018-11-07 05:00:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-07 05:00:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-07 05:00:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 05:00:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-07 05:00:25,501 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-11-07 05:00:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:25,502 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-07 05:00:25,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 05:00:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-07 05:00:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 05:00:25,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:25,503 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:25,503 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:25,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:25,503 INFO L82 PathProgramCache]: Analyzing trace with hash -232170980, now seen corresponding path program 22 times [2018-11-07 05:00:25,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:25,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:25,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:26,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:26,479 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:26,479 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:26,479 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:26,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:26,479 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 05:00:26,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:26,487 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:26,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:26,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:27,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:27,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2018-11-07 05:00:27,556 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:27,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 05:00:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 05:00:27,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 05:00:27,557 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 25 states. [2018-11-07 05:00:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:27,925 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-07 05:00:27,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 05:00:27,926 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-11-07 05:00:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:27,927 INFO L225 Difference]: With dead ends: 63 [2018-11-07 05:00:27,927 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 05:00:27,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 05:00:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 05:00:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-07 05:00:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 05:00:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-07 05:00:27,932 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-11-07 05:00:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:27,932 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-07 05:00:27,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 05:00:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-07 05:00:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 05:00:27,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:27,933 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:27,933 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:27,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1216973154, now seen corresponding path program 23 times [2018-11-07 05:00:27,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:27,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:28,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:28,838 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:28,838 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:28,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 05:00:28,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:28,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 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 05:00:28,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:28,847 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:28,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 05:00:28,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:28,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:28,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:30,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:30,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 50 [2018-11-07 05:00:30,350 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:30,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 05:00:30,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 05:00:30,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 05:00:30,352 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 26 states. [2018-11-07 05:00:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:30,760 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-11-07 05:00:30,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 05:00:30,761 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-07 05:00:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:30,762 INFO L225 Difference]: With dead ends: 65 [2018-11-07 05:00:30,762 INFO L226 Difference]: Without dead ends: 60 [2018-11-07 05:00:30,763 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-07 05:00:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-07 05:00:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-07 05:00:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 05:00:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-07 05:00:30,768 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-11-07 05:00:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:30,768 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-07 05:00:30,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 05:00:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-07 05:00:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 05:00:30,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:30,769 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:30,769 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:30,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:30,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2019885272, now seen corresponding path program 24 times [2018-11-07 05:00:30,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:30,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:30,771 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:31,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:31,259 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:31,259 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:31,259 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:31,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:31,259 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 05:00:31,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:31,268 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:31,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:31,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:31,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:31,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:32,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:32,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2018-11-07 05:00:32,618 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:32,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 05:00:32,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 05:00:32,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 05:00:32,620 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 27 states. [2018-11-07 05:00:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:33,082 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-07 05:00:33,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 05:00:33,083 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-11-07 05:00:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:33,084 INFO L225 Difference]: With dead ends: 67 [2018-11-07 05:00:33,084 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 05:00:33,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 05:00:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 05:00:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-07 05:00:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-07 05:00:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-07 05:00:33,090 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-11-07 05:00:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:33,090 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-07 05:00:33,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 05:00:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-07 05:00:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 05:00:33,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:33,091 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:33,092 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:33,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:33,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1210456942, now seen corresponding path program 25 times [2018-11-07 05:00:33,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:33,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:33,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:33,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:33,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:33,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:33,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:33,918 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:33,918 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:33,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:33,918 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 05:00:33,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:33,928 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:33,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:33,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:35,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:35,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 54 [2018-11-07 05:00:35,790 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:35,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 05:00:35,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 05:00:35,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=781, Invalid=2081, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 05:00:35,792 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2018-11-07 05:00:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:36,257 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-07 05:00:36,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 05:00:36,264 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-11-07 05:00:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:36,265 INFO L225 Difference]: With dead ends: 69 [2018-11-07 05:00:36,265 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 05:00:36,266 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=781, Invalid=2081, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 05:00:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 05:00:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-07 05:00:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 05:00:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-11-07 05:00:36,269 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-11-07 05:00:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:36,270 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-11-07 05:00:36,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 05:00:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-07 05:00:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 05:00:36,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:36,271 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:36,271 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:36,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:36,271 INFO L82 PathProgramCache]: Analyzing trace with hash 307969588, now seen corresponding path program 26 times [2018-11-07 05:00:36,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:36,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:36,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:36,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:36,272 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:36,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:36,952 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:36,953 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:36,953 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,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:36,953 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 05:00:36,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:36,970 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:37,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 05:00:37,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:37,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:37,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:38,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:38,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2018-11-07 05:00:38,607 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:38,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 05:00:38,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 05:00:38,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=2242, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 05:00:38,609 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 29 states. [2018-11-07 05:00:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:39,100 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-11-07 05:00:39,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 05:00:39,100 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2018-11-07 05:00:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:39,101 INFO L225 Difference]: With dead ends: 71 [2018-11-07 05:00:39,102 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 05:00:39,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=838, Invalid=2242, Unknown=0, NotChecked=0, Total=3080 [2018-11-07 05:00:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 05:00:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-07 05:00:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 05:00:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-07 05:00:39,106 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-11-07 05:00:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:39,106 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-07 05:00:39,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 05:00:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-07 05:00:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 05:00:39,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:39,107 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:39,107 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:39,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:39,107 INFO L82 PathProgramCache]: Analyzing trace with hash 601016186, now seen corresponding path program 27 times [2018-11-07 05:00:39,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:39,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:39,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:40,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:40,204 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:40,204 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:40,204 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:40,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:40,204 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 05:00:40,216 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:40,216 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:40,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:40,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:40,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:40,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:41,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:41,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2018-11-07 05:00:41,756 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:41,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 05:00:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 05:00:41,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=897, Invalid=2409, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 05:00:41,758 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2018-11-07 05:00:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:42,291 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-11-07 05:00:42,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 05:00:42,291 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-11-07 05:00:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:42,292 INFO L225 Difference]: With dead ends: 73 [2018-11-07 05:00:42,292 INFO L226 Difference]: Without dead ends: 68 [2018-11-07 05:00:42,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=897, Invalid=2409, Unknown=0, NotChecked=0, Total=3306 [2018-11-07 05:00:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-07 05:00:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-07 05:00:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 05:00:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-11-07 05:00:42,299 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-11-07 05:00:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:42,299 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-11-07 05:00:42,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 05:00:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-07 05:00:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-07 05:00:42,300 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:42,300 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:42,300 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:42,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:42,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1249044672, now seen corresponding path program 28 times [2018-11-07 05:00:42,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:42,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:42,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:42,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:42,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:42,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:42,868 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:42,868 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:42,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:00:42,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:42,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 05:00:42,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:42,878 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:42,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:42,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:44,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:44,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 60 [2018-11-07 05:00:44,715 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:44,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 05:00:44,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 05:00:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=958, Invalid=2582, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 05:00:44,716 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 31 states. [2018-11-07 05:00:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:45,393 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-07 05:00:45,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 05:00:45,393 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2018-11-07 05:00:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:45,394 INFO L225 Difference]: With dead ends: 75 [2018-11-07 05:00:45,394 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 05:00:45,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=958, Invalid=2582, Unknown=0, NotChecked=0, Total=3540 [2018-11-07 05:00:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 05:00:45,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-07 05:00:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 05:00:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-11-07 05:00:45,400 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-11-07 05:00:45,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:45,400 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-11-07 05:00:45,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 05:00:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-07 05:00:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 05:00:45,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:45,401 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:45,401 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:45,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:45,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1041068666, now seen corresponding path program 29 times [2018-11-07 05:00:45,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:45,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:45,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:45,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:45,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:46,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:46,374 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:46,374 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:46,374 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:46,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:46,374 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 05:00:46,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:46,383 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:46,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 05:00:46,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:46,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:46,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:48,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:48,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 62 [2018-11-07 05:00:48,209 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:48,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 05:00:48,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 05:00:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1021, Invalid=2761, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 05:00:48,210 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 32 states. [2018-11-07 05:00:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:48,807 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-11-07 05:00:48,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 05:00:48,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-11-07 05:00:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:48,810 INFO L225 Difference]: With dead ends: 77 [2018-11-07 05:00:48,810 INFO L226 Difference]: Without dead ends: 72 [2018-11-07 05:00:48,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1021, Invalid=2761, Unknown=0, NotChecked=0, Total=3782 [2018-11-07 05:00:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-07 05:00:48,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-07 05:00:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 05:00:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-07 05:00:48,815 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-11-07 05:00:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:48,815 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-07 05:00:48,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 05:00:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-07 05:00:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 05:00:48,816 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:48,816 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:48,816 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:48,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1255377484, now seen corresponding path program 30 times [2018-11-07 05:00:48,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:48,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:48,817 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:49,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:49,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:49,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:49,471 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:49,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:49,471 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 05:00:49,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:00:49,479 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:00:49,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:00:49,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:49,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:49,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:51,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:51,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-07 05:00:51,484 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:51,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 05:00:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 05:00:51,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2946, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 05:00:51,486 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 33 states. [2018-11-07 05:00:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:52,181 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-11-07 05:00:52,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 05:00:52,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 71 [2018-11-07 05:00:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:52,183 INFO L225 Difference]: With dead ends: 79 [2018-11-07 05:00:52,183 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 05:00:52,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1086, Invalid=2946, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 05:00:52,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 05:00:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-07 05:00:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-07 05:00:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-11-07 05:00:52,189 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-11-07 05:00:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:52,189 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-11-07 05:00:52,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 05:00:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-07 05:00:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-07 05:00:52,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:52,190 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:52,191 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:52,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash 526937490, now seen corresponding path program 31 times [2018-11-07 05:00:52,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:52,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:52,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:52,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:52,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:52,871 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:52,871 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:52,872 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:52,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:52,872 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 05:00:52,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:52,880 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:00:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:52,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:52,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:55,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:55,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 66 [2018-11-07 05:00:55,117 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:55,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 05:00:55,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 05:00:55,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 05:00:55,118 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 34 states. [2018-11-07 05:00:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:55,824 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-07 05:00:55,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 05:00:55,825 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-11-07 05:00:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:55,826 INFO L225 Difference]: With dead ends: 81 [2018-11-07 05:00:55,826 INFO L226 Difference]: Without dead ends: 76 [2018-11-07 05:00:55,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2018-11-07 05:00:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-07 05:00:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-07 05:00:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-07 05:00:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-11-07 05:00:55,831 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-11-07 05:00:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:55,831 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-11-07 05:00:55,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 05:00:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-07 05:00:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-07 05:00:55,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:55,832 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:55,832 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:55,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:55,833 INFO L82 PathProgramCache]: Analyzing trace with hash 575772504, now seen corresponding path program 32 times [2018-11-07 05:00:55,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:55,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:00:55,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:55,834 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:00:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:56,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:56,736 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:00:56,736 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:00:56,736 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:56,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:00:56,736 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 05:00:56,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:00:56,744 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:00:56,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-07 05:00:56,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:00:56,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:00:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:56,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:00:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:00:58,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:00:58,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 68 [2018-11-07 05:00:58,942 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:00:58,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 05:00:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 05:00:58,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1222, Invalid=3334, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 05:00:58,944 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 35 states. [2018-11-07 05:00:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:00:59,768 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-11-07 05:00:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 05:00:59,769 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2018-11-07 05:00:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:00:59,770 INFO L225 Difference]: With dead ends: 83 [2018-11-07 05:00:59,770 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 05:00:59,771 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1222, Invalid=3334, Unknown=0, NotChecked=0, Total=4556 [2018-11-07 05:00:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 05:00:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-07 05:00:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 05:00:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-11-07 05:00:59,774 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-11-07 05:00:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:00:59,775 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-11-07 05:00:59,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 05:00:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-07 05:00:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 05:00:59,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:00:59,775 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:00:59,775 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:00:59,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:00:59,776 INFO L82 PathProgramCache]: Analyzing trace with hash 261580702, now seen corresponding path program 33 times [2018-11-07 05:00:59,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:00:59,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:59,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:00:59,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:00:59,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:00:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:01,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:01,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:01,904 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:01,905 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:01:01,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:01,905 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 05:01:01,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:01:01,912 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:01:01,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:01:01,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:01,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:01,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:04,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:04,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 70 [2018-11-07 05:01:04,193 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:04,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 05:01:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 05:01:04,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1293, Invalid=3537, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 05:01:04,195 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 36 states. [2018-11-07 05:01:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:05,034 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-11-07 05:01:05,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 05:01:05,034 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 77 [2018-11-07 05:01:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:05,035 INFO L225 Difference]: With dead ends: 85 [2018-11-07 05:01:05,036 INFO L226 Difference]: Without dead ends: 80 [2018-11-07 05:01:05,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1293, Invalid=3537, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 05:01:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-07 05:01:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-07 05:01:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-07 05:01:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-11-07 05:01:05,040 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-11-07 05:01:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:05,040 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-11-07 05:01:05,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 05:01:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-11-07 05:01:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 05:01:05,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:05,040 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:05,041 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:05,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:05,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1029030300, now seen corresponding path program 34 times [2018-11-07 05:01:05,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:05,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:05,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:05,042 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:05,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:05,963 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:05,963 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:05,963 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:01:05,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:05,963 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 05:01:05,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:01:05,972 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:01:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:05,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:06,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:08,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:08,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 72 [2018-11-07 05:01:08,431 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:08,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 05:01:08,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 05:01:08,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1366, Invalid=3746, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 05:01:08,432 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 37 states. [2018-11-07 05:01:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:09,272 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-07 05:01:09,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 05:01:09,272 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 79 [2018-11-07 05:01:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:09,273 INFO L225 Difference]: With dead ends: 87 [2018-11-07 05:01:09,273 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 05:01:09,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1366, Invalid=3746, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 05:01:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 05:01:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-07 05:01:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-07 05:01:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-11-07 05:01:09,278 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-11-07 05:01:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:09,279 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-11-07 05:01:09,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 05:01:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-11-07 05:01:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-07 05:01:09,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:09,280 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:09,280 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:09,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash -60654678, now seen corresponding path program 35 times [2018-11-07 05:01:09,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:09,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:09,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:01:09,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:09,281 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:10,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:10,619 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:10,619 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:10,619 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:01:10,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:10,620 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 05:01:10,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:01:10,628 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:01:10,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 05:01:10,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:10,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:10,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:13,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:13,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 74 [2018-11-07 05:01:13,206 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:13,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 05:01:13,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 05:01:13,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=3961, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 05:01:13,207 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 38 states. [2018-11-07 05:01:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:14,064 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-11-07 05:01:14,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 05:01:14,065 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 81 [2018-11-07 05:01:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:14,066 INFO L225 Difference]: With dead ends: 89 [2018-11-07 05:01:14,066 INFO L226 Difference]: Without dead ends: 84 [2018-11-07 05:01:14,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1441, Invalid=3961, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 05:01:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-07 05:01:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-07 05:01:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-07 05:01:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-11-07 05:01:14,071 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-11-07 05:01:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:14,071 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-11-07 05:01:14,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 05:01:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-07 05:01:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 05:01:14,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:14,072 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:14,073 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:14,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1459585168, now seen corresponding path program 36 times [2018-11-07 05:01:14,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:14,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:14,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:14,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:14,074 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:15,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:15,078 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:15,078 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:15,079 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:01:15,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:15,079 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 05:01:15,086 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:01:15,086 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:01:15,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:01:15,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:15,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:15,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:17,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:17,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 76 [2018-11-07 05:01:17,980 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:17,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 05:01:17,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 05:01:17,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1518, Invalid=4182, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 05:01:17,982 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 39 states. [2018-11-07 05:01:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:18,894 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-11-07 05:01:18,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 05:01:18,895 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 83 [2018-11-07 05:01:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:18,896 INFO L225 Difference]: With dead ends: 91 [2018-11-07 05:01:18,896 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 05:01:18,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1518, Invalid=4182, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 05:01:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 05:01:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-07 05:01:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-07 05:01:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-11-07 05:01:18,901 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-11-07 05:01:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:18,902 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-11-07 05:01:18,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 05:01:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-07 05:01:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-07 05:01:18,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:18,903 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:18,903 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:18,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1507022410, now seen corresponding path program 37 times [2018-11-07 05:01:18,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:18,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:18,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:18,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:18,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:20,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:20,133 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:20,133 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:20,133 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:01:20,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:20,133 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 05:01:20,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:01:20,142 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:01:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:20,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:20,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:23,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:23,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 78 [2018-11-07 05:01:23,249 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:23,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 05:01:23,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 05:01:23,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1597, Invalid=4409, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 05:01:23,250 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 40 states. [2018-11-07 05:01:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:24,215 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-07 05:01:24,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 05:01:24,215 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 85 [2018-11-07 05:01:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:24,216 INFO L225 Difference]: With dead ends: 93 [2018-11-07 05:01:24,216 INFO L226 Difference]: Without dead ends: 88 [2018-11-07 05:01:24,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1597, Invalid=4409, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 05:01:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-07 05:01:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-07 05:01:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-07 05:01:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-11-07 05:01:24,222 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-11-07 05:01:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:24,222 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-11-07 05:01:24,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 05:01:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-11-07 05:01:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 05:01:24,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:24,223 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:24,223 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:24,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash 150428284, now seen corresponding path program 38 times [2018-11-07 05:01:24,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:24,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:24,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:01:24,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:24,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:25,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:25,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:25,975 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:25,975 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:01:25,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:25,976 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 05:01:25,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:01:25,984 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:01:26,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-07 05:01:26,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:26,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:26,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:29,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:29,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 80 [2018-11-07 05:01:29,019 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:29,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 05:01:29,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 05:01:29,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1678, Invalid=4642, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 05:01:29,020 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 41 states. [2018-11-07 05:01:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:30,061 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-11-07 05:01:30,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 05:01:30,062 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2018-11-07 05:01:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:30,063 INFO L225 Difference]: With dead ends: 95 [2018-11-07 05:01:30,063 INFO L226 Difference]: Without dead ends: 90 [2018-11-07 05:01:30,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1678, Invalid=4642, Unknown=0, NotChecked=0, Total=6320 [2018-11-07 05:01:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-07 05:01:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-07 05:01:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-07 05:01:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-11-07 05:01:30,069 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-11-07 05:01:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:30,069 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-11-07 05:01:30,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 05:01:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-07 05:01:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 05:01:30,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:30,070 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:30,070 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:30,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash -472321598, now seen corresponding path program 39 times [2018-11-07 05:01:30,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:30,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:30,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:30,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:30,072 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:31,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:31,512 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:31,512 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:31,512 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:01:31,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:31,513 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 05:01:31,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:01:31,526 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:01:31,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:01:31,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:31,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:31,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:34,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:34,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 82 [2018-11-07 05:01:34,754 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:34,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 05:01:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 05:01:34,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1761, Invalid=4881, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 05:01:34,756 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 42 states. [2018-11-07 05:01:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:35,869 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-11-07 05:01:35,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 05:01:35,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 89 [2018-11-07 05:01:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:35,870 INFO L225 Difference]: With dead ends: 97 [2018-11-07 05:01:35,870 INFO L226 Difference]: Without dead ends: 92 [2018-11-07 05:01:35,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1761, Invalid=4881, Unknown=0, NotChecked=0, Total=6642 [2018-11-07 05:01:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-07 05:01:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-07 05:01:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-07 05:01:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-11-07 05:01:35,876 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-11-07 05:01:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:35,876 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-11-07 05:01:35,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 05:01:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-11-07 05:01:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 05:01:35,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:35,877 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:35,877 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:35,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1934504056, now seen corresponding path program 40 times [2018-11-07 05:01:35,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:35,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:35,878 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:36,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:36,991 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:36,991 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:36,991 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:01:36,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:36,991 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 05:01:37,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:01:37,000 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:01:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:37,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:37,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:40,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:40,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-07 05:01:40,709 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:40,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 05:01:40,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 05:01:40,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1846, Invalid=5126, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 05:01:40,711 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 43 states. [2018-11-07 05:01:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:41,952 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-07 05:01:41,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 05:01:41,953 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 91 [2018-11-07 05:01:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:41,954 INFO L225 Difference]: With dead ends: 99 [2018-11-07 05:01:41,954 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 05:01:41,955 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1846, Invalid=5126, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 05:01:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 05:01:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-07 05:01:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-07 05:01:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-11-07 05:01:41,959 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-11-07 05:01:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:41,959 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-11-07 05:01:41,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 05:01:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-11-07 05:01:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 05:01:41,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:41,960 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:41,960 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:41,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:41,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1657426894, now seen corresponding path program 41 times [2018-11-07 05:01:41,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:41,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:41,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:01:41,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:41,962 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:43,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:43,316 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:43,316 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:43,317 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:01:43,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:43,317 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 05:01:43,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:01:43,325 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:01:43,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-07 05:01:43,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:43,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:43,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:47,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:47,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 86 [2018-11-07 05:01:47,018 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:47,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 05:01:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 05:01:47,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1933, Invalid=5377, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 05:01:47,019 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 44 states. [2018-11-07 05:01:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:48,178 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-11-07 05:01:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 05:01:48,179 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2018-11-07 05:01:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:48,180 INFO L225 Difference]: With dead ends: 101 [2018-11-07 05:01:48,180 INFO L226 Difference]: Without dead ends: 96 [2018-11-07 05:01:48,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1933, Invalid=5377, Unknown=0, NotChecked=0, Total=7310 [2018-11-07 05:01:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-07 05:01:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-07 05:01:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-07 05:01:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-11-07 05:01:48,185 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-11-07 05:01:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:48,185 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-11-07 05:01:48,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 05:01:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-11-07 05:01:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 05:01:48,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:48,186 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:48,187 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:48,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash 349363860, now seen corresponding path program 42 times [2018-11-07 05:01:48,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:48,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:48,188 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:49,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:49,334 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:49,334 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:49,334 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:01:49,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:49,334 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 05:01:49,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:01:49,346 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:01:49,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:01:49,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:01:49,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:49,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:52,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:52,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 88 [2018-11-07 05:01:52,951 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:52,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 05:01:52,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 05:01:52,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2022, Invalid=5634, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 05:01:52,952 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 45 states. [2018-11-07 05:01:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:01:54,182 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-11-07 05:01:54,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 05:01:54,183 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 95 [2018-11-07 05:01:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:01:54,184 INFO L225 Difference]: With dead ends: 103 [2018-11-07 05:01:54,184 INFO L226 Difference]: Without dead ends: 98 [2018-11-07 05:01:54,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2022, Invalid=5634, Unknown=0, NotChecked=0, Total=7656 [2018-11-07 05:01:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-07 05:01:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-11-07 05:01:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-07 05:01:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-11-07 05:01:54,190 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-11-07 05:01:54,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:01:54,190 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-11-07 05:01:54,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 05:01:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-11-07 05:01:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-07 05:01:54,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:01:54,191 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:01:54,191 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:01:54,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:01:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1726205914, now seen corresponding path program 43 times [2018-11-07 05:01:54,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:01:54,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:54,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:01:54,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:01:54,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:01:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:55,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:55,366 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:01:55,366 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:01:55,366 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:01:55,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:01:55,366 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 05:01:55,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:01:55,377 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:01:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:01:55,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:01:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:55,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:01:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:01:59,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:01:59,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 90 [2018-11-07 05:01:59,247 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:01:59,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 05:01:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 05:01:59,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2113, Invalid=5897, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 05:01:59,248 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 46 states. [2018-11-07 05:02:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:00,508 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-07 05:02:00,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 05:02:00,509 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 97 [2018-11-07 05:02:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:00,510 INFO L225 Difference]: With dead ends: 105 [2018-11-07 05:02:00,510 INFO L226 Difference]: Without dead ends: 100 [2018-11-07 05:02:00,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2113, Invalid=5897, Unknown=0, NotChecked=0, Total=8010 [2018-11-07 05:02:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-07 05:02:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-07 05:02:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 05:02:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-11-07 05:02:00,514 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-11-07 05:02:00,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:00,515 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-11-07 05:02:00,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 05:02:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-11-07 05:02:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 05:02:00,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:00,515 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:00,515 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:00,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2021492640, now seen corresponding path program 44 times [2018-11-07 05:02:00,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:00,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:00,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:00,517 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:01,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:01,921 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:01,921 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:01,921 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:02:01,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:01,921 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 05:02:01,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:02:01,933 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:02:02,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-07 05:02:02,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:02:02,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:02,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:06,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:06,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 92 [2018-11-07 05:02:06,176 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:06,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 05:02:06,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 05:02:06,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2206, Invalid=6166, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 05:02:06,177 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 47 states. [2018-11-07 05:02:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:07,627 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-11-07 05:02:07,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 05:02:07,627 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 99 [2018-11-07 05:02:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:07,628 INFO L225 Difference]: With dead ends: 107 [2018-11-07 05:02:07,628 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 05:02:07,629 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2206, Invalid=6166, Unknown=0, NotChecked=0, Total=8372 [2018-11-07 05:02:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 05:02:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-07 05:02:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-07 05:02:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-11-07 05:02:07,633 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-11-07 05:02:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:07,634 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-11-07 05:02:07,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 05:02:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-11-07 05:02:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 05:02:07,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:07,634 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:07,634 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:07,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:07,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1970772506, now seen corresponding path program 45 times [2018-11-07 05:02:07,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:07,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:07,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:02:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:07,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:09,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:09,149 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:09,149 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:09,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:02:09,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:09,149 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:02:09,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:02:09,158 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:02:09,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:02:09,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:02:09,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:09,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:13,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:13,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 94 [2018-11-07 05:02:13,390 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:13,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 05:02:13,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 05:02:13,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2301, Invalid=6441, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 05:02:13,392 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 48 states. [2018-11-07 05:02:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:16,409 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-11-07 05:02:16,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 05:02:16,410 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 101 [2018-11-07 05:02:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:16,411 INFO L225 Difference]: With dead ends: 109 [2018-11-07 05:02:16,411 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 05:02:16,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2301, Invalid=6441, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 05:02:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 05:02:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-07 05:02:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-07 05:02:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-11-07 05:02:16,417 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-11-07 05:02:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:16,418 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-11-07 05:02:16,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 05:02:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-11-07 05:02:16,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 05:02:16,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:16,419 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:16,419 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:16,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:16,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1163184812, now seen corresponding path program 46 times [2018-11-07 05:02:16,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:16,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:16,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:02:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:16,421 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:17,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:17,735 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:17,735 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:17,735 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:02:17,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:17,736 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:02:17,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:17,745 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:02:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:17,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:17,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:22,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:22,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2018-11-07 05:02:22,154 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:22,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 05:02:22,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 05:02:22,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 05:02:22,155 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 49 states. [2018-11-07 05:02:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:23,662 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-07 05:02:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 05:02:23,668 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 103 [2018-11-07 05:02:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:23,669 INFO L225 Difference]: With dead ends: 111 [2018-11-07 05:02:23,669 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 05:02:23,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2018-11-07 05:02:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 05:02:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-07 05:02:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-07 05:02:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-11-07 05:02:23,677 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-11-07 05:02:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:23,678 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-11-07 05:02:23,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 05:02:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-11-07 05:02:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-07 05:02:23,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:23,679 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:23,679 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:23,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2124092914, now seen corresponding path program 47 times [2018-11-07 05:02:23,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:23,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:23,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:23,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:23,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:24,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:24,906 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:24,906 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:24,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:02:24,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:24,906 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:02:24,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:02:24,916 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:02:25,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-11-07 05:02:25,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:02:25,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:25,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:29,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:29,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 98 [2018-11-07 05:02:29,618 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:29,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 05:02:29,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 05:02:29,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2497, Invalid=7009, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 05:02:29,619 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 50 states. [2018-11-07 05:02:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:31,298 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-11-07 05:02:31,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 05:02:31,298 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 105 [2018-11-07 05:02:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:31,300 INFO L225 Difference]: With dead ends: 113 [2018-11-07 05:02:31,300 INFO L226 Difference]: Without dead ends: 108 [2018-11-07 05:02:31,301 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2497, Invalid=7009, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 05:02:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-07 05:02:31,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-11-07 05:02:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 05:02:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-11-07 05:02:31,306 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-11-07 05:02:31,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:31,306 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-11-07 05:02:31,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 05:02:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-11-07 05:02:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 05:02:31,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:31,307 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:31,307 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:31,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2138810296, now seen corresponding path program 48 times [2018-11-07 05:02:31,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:31,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:31,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:02:31,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:31,309 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:32,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:32,914 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:32,914 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:32,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 05:02:32,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:32,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:02:32,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:02:32,923 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:02:32,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:02:32,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:02:32,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:33,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:37,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:37,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2018-11-07 05:02:37,747 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:37,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 05:02:37,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 05:02:37,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2598, Invalid=7302, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 05:02:37,749 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 51 states. [2018-11-07 05:02:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:39,303 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-11-07 05:02:39,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 05:02:39,304 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 107 [2018-11-07 05:02:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:39,305 INFO L225 Difference]: With dead ends: 115 [2018-11-07 05:02:39,305 INFO L226 Difference]: Without dead ends: 110 [2018-11-07 05:02:39,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2598, Invalid=7302, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 05:02:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-07 05:02:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-07 05:02:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-07 05:02:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-11-07 05:02:39,311 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-11-07 05:02:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:39,312 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-11-07 05:02:39,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 05:02:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-11-07 05:02:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-07 05:02:39,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:39,313 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:39,313 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:39,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash -897654786, now seen corresponding path program 49 times [2018-11-07 05:02:39,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:39,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:02:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:39,314 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:40,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 05:02:40,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:40,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:40,605 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:40,606 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:02:40,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:40,606 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:02:40,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:40,617 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:02:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:40,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:40,684 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 05:02:40,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:45,455 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 05:02:45,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:45,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 102 [2018-11-07 05:02:45,475 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:45,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-07 05:02:45,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-07 05:02:45,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 05:02:45,476 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 52 states. [2018-11-07 05:02:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:47,181 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-11-07 05:02:47,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-07 05:02:47,181 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 109 [2018-11-07 05:02:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:47,183 INFO L225 Difference]: With dead ends: 117 [2018-11-07 05:02:47,183 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 05:02:47,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2018-11-07 05:02:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 05:02:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-07 05:02:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-07 05:02:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-11-07 05:02:47,188 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-11-07 05:02:47,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:47,189 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-11-07 05:02:47,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-07 05:02:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-11-07 05:02:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-07 05:02:47,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:47,190 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:47,190 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:47,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1637162692, now seen corresponding path program 50 times [2018-11-07 05:02:47,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:47,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:02:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:47,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:48,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:48,772 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:48,772 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:48,772 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:02:48,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:48,772 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:02:48,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:02:48,784 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:02:48,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-11-07 05:02:48,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:02:48,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:49,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:02:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:54,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:02:54,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 104 [2018-11-07 05:02:54,853 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:02:54,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-07 05:02:54,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-07 05:02:54,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2806, Invalid=7906, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 05:02:54,855 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 53 states. [2018-11-07 05:02:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:02:56,592 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-11-07 05:02:56,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 05:02:56,592 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 111 [2018-11-07 05:02:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:02:56,594 INFO L225 Difference]: With dead ends: 119 [2018-11-07 05:02:56,594 INFO L226 Difference]: Without dead ends: 114 [2018-11-07 05:02:56,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2806, Invalid=7906, Unknown=0, NotChecked=0, Total=10712 [2018-11-07 05:02:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-07 05:02:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-07 05:02:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-07 05:02:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-11-07 05:02:56,600 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-11-07 05:02:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:02:56,600 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-11-07 05:02:56,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-07 05:02:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-11-07 05:02:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 05:02:56,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:02:56,601 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:02:56,602 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:02:56,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:02:56,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1944665078, now seen corresponding path program 51 times [2018-11-07 05:02:56,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:02:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:56,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:02:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:02:56,603 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:02:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:02:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:58,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:58,512 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:02:58,513 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:02:58,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:02:58,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:02:58,513 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:02:58,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:02:58,522 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:02:58,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:02:58,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:02:58,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:02:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:02:58,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:03,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:03,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 106 [2018-11-07 05:03:03,857 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:03,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 05:03:03,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 05:03:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2913, Invalid=8217, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 05:03:03,859 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 54 states. [2018-11-07 05:03:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:05,660 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-11-07 05:03:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 05:03:05,661 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 113 [2018-11-07 05:03:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:05,662 INFO L225 Difference]: With dead ends: 121 [2018-11-07 05:03:05,662 INFO L226 Difference]: Without dead ends: 116 [2018-11-07 05:03:05,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2913, Invalid=8217, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 05:03:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-07 05:03:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-11-07 05:03:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-07 05:03:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-11-07 05:03:05,667 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-11-07 05:03:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:05,667 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-11-07 05:03:05,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 05:03:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-11-07 05:03:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-07 05:03:05,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:05,668 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:05,668 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:05,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash 482619344, now seen corresponding path program 52 times [2018-11-07 05:03:05,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:05,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:03:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:05,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:07,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:07,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:07,435 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:07,435 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:03:07,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:07,435 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:07,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:07,443 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:03:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:07,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:07,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:12,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:12,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 108 [2018-11-07 05:03:12,922 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:12,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-07 05:03:12,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-07 05:03:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3022, Invalid=8534, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 05:03:12,923 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 55 states. [2018-11-07 05:03:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:14,866 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-11-07 05:03:14,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 05:03:14,866 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 115 [2018-11-07 05:03:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:14,867 INFO L225 Difference]: With dead ends: 123 [2018-11-07 05:03:14,868 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 05:03:14,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3022, Invalid=8534, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 05:03:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 05:03:14,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-07 05:03:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-07 05:03:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-11-07 05:03:14,873 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-11-07 05:03:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:14,874 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-11-07 05:03:14,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-07 05:03:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-11-07 05:03:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 05:03:14,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:14,875 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:14,875 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:14,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash 935707158, now seen corresponding path program 53 times [2018-11-07 05:03:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:14,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:14,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:16,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:16,398 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:16,399 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:16,399 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:03:16,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:16,399 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:16,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:03:16,408 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:03:16,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-11-07 05:03:16,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:16,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:16,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:22,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:22,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 110 [2018-11-07 05:03:22,120 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:22,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 05:03:22,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 05:03:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3133, Invalid=8857, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 05:03:22,122 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 56 states. [2018-11-07 05:03:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:24,202 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-11-07 05:03:24,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 05:03:24,203 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 117 [2018-11-07 05:03:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:24,204 INFO L225 Difference]: With dead ends: 125 [2018-11-07 05:03:24,204 INFO L226 Difference]: Without dead ends: 120 [2018-11-07 05:03:24,205 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3133, Invalid=8857, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 05:03:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-07 05:03:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-07 05:03:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 05:03:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-11-07 05:03:24,209 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-11-07 05:03:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:24,210 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-11-07 05:03:24,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 05:03:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-11-07 05:03:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 05:03:24,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:24,211 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:24,211 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:24,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:24,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1733567780, now seen corresponding path program 54 times [2018-11-07 05:03:24,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:24,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:24,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:03:24,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:24,212 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:25,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:25,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:25,721 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:25,721 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:03:25,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:25,722 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:25,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:03:25,733 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:03:25,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:03:25,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:25,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:25,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:31,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:31,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 112 [2018-11-07 05:03:31,551 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:31,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-07 05:03:31,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-07 05:03:31,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3246, Invalid=9186, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 05:03:31,552 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 57 states. [2018-11-07 05:03:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:33,512 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-11-07 05:03:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-07 05:03:33,512 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 119 [2018-11-07 05:03:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:33,513 INFO L225 Difference]: With dead ends: 127 [2018-11-07 05:03:33,513 INFO L226 Difference]: Without dead ends: 122 [2018-11-07 05:03:33,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=3246, Invalid=9186, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 05:03:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-07 05:03:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-11-07 05:03:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-07 05:03:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-11-07 05:03:33,517 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-11-07 05:03:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:33,518 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-11-07 05:03:33,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-07 05:03:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-11-07 05:03:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 05:03:33,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:33,519 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:33,519 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:33,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1483659810, now seen corresponding path program 55 times [2018-11-07 05:03:33,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:33,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:33,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:03:33,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:33,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:36,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:36,011 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:36,012 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:36,012 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:03:36,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:36,012 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:36,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:36,020 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:03:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:36,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:36,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:42,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:42,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 114 [2018-11-07 05:03:42,463 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:42,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-07 05:03:42,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-07 05:03:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3361, Invalid=9521, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 05:03:42,465 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 58 states. [2018-11-07 05:03:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:44,703 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-11-07 05:03:44,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-07 05:03:44,704 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 121 [2018-11-07 05:03:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:44,705 INFO L225 Difference]: With dead ends: 129 [2018-11-07 05:03:44,705 INFO L226 Difference]: Without dead ends: 124 [2018-11-07 05:03:44,706 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3361, Invalid=9521, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 05:03:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-07 05:03:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-11-07 05:03:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-07 05:03:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-11-07 05:03:44,711 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-11-07 05:03:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:44,712 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-11-07 05:03:44,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-07 05:03:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-11-07 05:03:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 05:03:44,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:44,713 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:44,713 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:44,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash 862920680, now seen corresponding path program 56 times [2018-11-07 05:03:44,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:44,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:44,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:44,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:44,715 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:46,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:46,302 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:46,302 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:46,302 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:03:46,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:46,302 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:46,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:03:46,311 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:03:46,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-11-07 05:03:46,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:46,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:46,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:52,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:52,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 116 [2018-11-07 05:03:52,840 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:52,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-07 05:03:52,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-07 05:03:52,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3478, Invalid=9862, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 05:03:52,841 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 59 states. [2018-11-07 05:03:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:55,114 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-11-07 05:03:55,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 05:03:55,115 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 123 [2018-11-07 05:03:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:55,116 INFO L225 Difference]: With dead ends: 131 [2018-11-07 05:03:55,116 INFO L226 Difference]: Without dead ends: 126 [2018-11-07 05:03:55,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3478, Invalid=9862, Unknown=0, NotChecked=0, Total=13340 [2018-11-07 05:03:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-07 05:03:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-07 05:03:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 05:03:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-11-07 05:03:55,121 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-11-07 05:03:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:55,121 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-11-07 05:03:55,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-07 05:03:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-11-07 05:03:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 05:03:55,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:55,122 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:55,122 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:55,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:55,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1333070894, now seen corresponding path program 57 times [2018-11-07 05:03:55,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:55,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:55,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:03:55,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:55,123 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:56,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:56,976 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:56,976 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:56,976 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:03:56,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:56,976 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:56,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:03:56,984 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:03:57,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:03:57,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:57,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:57,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 05:03:57,622 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 05:03:57,823 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:57,823 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 05:03:57,829 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 05:03:57,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:03:57 BoogieIcfgContainer [2018-11-07 05:03:57,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:03:57,830 INFO L168 Benchmark]: Toolchain (without parser) took 242730.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -390.9 MB). Peak memory consumption was 350.4 MB. Max. memory is 7.1 GB. [2018-11-07 05:03:57,831 INFO L168 Benchmark]: CDTParser took 0.45 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:03:57,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.60 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:03:57,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.26 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:03:57,833 INFO L168 Benchmark]: Boogie Preprocessor took 22.36 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:03:57,833 INFO L168 Benchmark]: RCFGBuilder took 325.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 05:03:57,834 INFO L168 Benchmark]: TraceAbstraction took 242037.22 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 4.2 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 386.7 MB). Peak memory consumption was 390.9 MB. Max. memory is 7.1 GB. [2018-11-07 05:03:57,837 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.45 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 314.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 25.26 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 22.36 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 325.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242037.22 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 4.2 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 386.7 MB). Peak memory consumption was 390.9 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 126 with TraceHistMax 58,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. TIMEOUT Result, 241.9s OverallTime, 59 OverallIterations, 58 TraceHistogramMax, 47.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2241 SDtfs, 0 SDslu, 74937 SDs, 0 SdLazy, 66671 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9386 GetRequests, 5968 SyntacticMatches, 113 SemanticMatches, 3305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 180.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 58 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 184.6s InterpolantComputationTime, 7637 NumberOfCodeBlocks, 7637 NumberOfCodeBlocksAsserted, 683 NumberOfCheckSat, 11275 ConstructedInterpolants, 0 QuantifiedInterpolants, 5952989 SizeOfPredicates, 56 NumberOfNonLiveVariables, 7672 ConjunctsInSsa, 3360 ConjunctsInUnsatCore, 170 InterpolantComputations, 2 PerfectInterpolantSequences, 0/185136 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown