java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:02:57,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:02:57,119 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:02:57,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:02:57,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:02:57,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:02:57,138 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:02:57,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:02:57,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:02:57,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:02:57,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:02:57,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:02:57,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:02:57,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:02:57,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:02:57,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:02:57,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:02:57,162 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:02:57,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:02:57,165 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:02:57,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:02:57,167 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:02:57,169 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:02:57,170 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:02:57,170 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:02:57,171 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:02:57,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:02:57,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:02:57,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:02:57,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:02:57,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:02:57,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:02:57,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:02:57,181 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:02:57,184 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:02:57,185 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:02:57,186 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:02:57,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:02:57,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:02:57,213 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:02:57,213 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:02:57,218 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:02:57,219 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:02:57,219 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:02:57,219 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:02:57,219 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:02:57,219 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:02:57,220 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:02:57,220 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:02:57,220 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:02:57,221 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:02:57,221 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:02:57,222 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:02:57,222 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:02:57,222 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:02:57,222 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:02:57,222 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:02:57,222 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:02:57,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:02:57,224 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:02:57,224 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:02:57,224 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:02:57,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:02:57,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:02:57,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:02:57,225 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:02:57,225 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:02:57,225 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:02:57,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:02:57,227 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:02:57,227 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:02:57,227 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:02:57,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:02:57,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:02:57,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:02:57,311 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:02:57,312 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:02:57,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call1_true-termination.i [2018-11-07 22:02:57,372 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2898ccbd6/739d9f576ba54de08d9269c989ad7a7e/FLAG9fe347ae8 [2018-11-07 22:02:57,794 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:02:57,794 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call1_true-termination.i [2018-11-07 22:02:57,801 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2898ccbd6/739d9f576ba54de08d9269c989ad7a7e/FLAG9fe347ae8 [2018-11-07 22:02:57,820 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2898ccbd6/739d9f576ba54de08d9269c989ad7a7e [2018-11-07 22:02:57,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:02:57,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:02:57,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:02:57,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:02:57,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:02:57,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:57" (1/1) ... [2018-11-07 22:02:57,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7101a57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:57, skipping insertion in model container [2018-11-07 22:02:57,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:02:57" (1/1) ... [2018-11-07 22:02:57,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:02:57,879 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:02:58,129 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:02:58,133 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:02:58,158 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:02:58,178 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:02:58,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58 WrapperNode [2018-11-07 22:02:58,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:02:58,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:02:58,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:02:58,181 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:02:58,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:02:58,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:02:58,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:02:58,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:02:58,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (1/1) ... [2018-11-07 22:02:58,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:02:58,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:02:58,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:02:58,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:02:58,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (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 22:02:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 22:02:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:02:58,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:02:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 22:02:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:02:58,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:02:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:02:58,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:02:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 22:02:58,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:02:58,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:02:58,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 22:02:58,806 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:02:58,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:58 BoogieIcfgContainer [2018-11-07 22:02:58,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:02:58,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:02:58,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:02:58,812 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:02:58,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:02:57" (1/3) ... [2018-11-07 22:02:58,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3d210d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:58, skipping insertion in model container [2018-11-07 22:02:58,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:02:58" (2/3) ... [2018-11-07 22:02:58,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3d210d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:02:58, skipping insertion in model container [2018-11-07 22:02:58,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:02:58" (3/3) ... [2018-11-07 22:02:58,815 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call1_true-termination.i [2018-11-07 22:02:58,826 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:02:58,834 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:02:58,852 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:02:58,887 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:02:58,888 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:02:58,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:02:58,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:02:58,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:02:58,888 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:02:58,889 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:02:58,889 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:02:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-07 22:02:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 22:02:58,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:58,916 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:58,918 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:58,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:58,927 INFO L82 PathProgramCache]: Analyzing trace with hash 526261342, now seen corresponding path program 1 times [2018-11-07 22:02:58,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:58,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:58,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:58,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:58,985 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:59,070 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 22:02:59,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:02:59,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:02:59,073 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:02:59,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:02:59,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:02:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:02:59,095 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-07 22:02:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:59,116 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-07 22:02:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:02:59,118 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-07 22:02:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:59,127 INFO L225 Difference]: With dead ends: 41 [2018-11-07 22:02:59,128 INFO L226 Difference]: Without dead ends: 17 [2018-11-07 22:02:59,132 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 22:02:59,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-07 22:02:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-07 22:02:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-07 22:02:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-07 22:02:59,168 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-11-07 22:02:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:59,169 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-07 22:02:59,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:02:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-07 22:02:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 22:02:59,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:59,170 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:59,170 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:59,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:59,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1427482147, now seen corresponding path program 1 times [2018-11-07 22:02:59,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:59,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:59,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:59,250 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 22:02:59,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:02:59,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:02:59,251 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:02:59,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:02:59,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:02:59,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:02:59,254 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2018-11-07 22:02:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:59,345 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 22:02:59,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:02:59,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-07 22:02:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:59,346 INFO L225 Difference]: With dead ends: 27 [2018-11-07 22:02:59,347 INFO L226 Difference]: Without dead ends: 21 [2018-11-07 22:02:59,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:02:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-07 22:02:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-07 22:02:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 22:02:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-07 22:02:59,353 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2018-11-07 22:02:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:59,353 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-07 22:02:59,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:02:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-07 22:02:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 22:02:59,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:59,354 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:59,355 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:59,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1966302602, now seen corresponding path program 1 times [2018-11-07 22:02:59,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:59,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:59,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:59,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 22:02:59,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:59,471 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:02:59,472 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-11-07 22:02:59,474 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [18], [22], [28], [31], [33], [39], [40], [41], [43] [2018-11-07 22:02:59,506 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:02:59,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:02:59,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:02:59,716 INFO L272 AbstractInterpreter]: Visited 17 different actions 45 times. Merged at 4 different actions 22 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-07 22:02:59,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:59,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:02:59,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:59,732 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 22:02:59,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:59,745 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:02:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:59,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:02:59,853 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 22:02:59,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:02:59,919 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 22:02:59,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:02:59,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 22:02:59,941 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:02:59,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 22:02:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 22:02:59,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:02:59,942 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 5 states. [2018-11-07 22:02:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:59,979 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-07 22:02:59,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:02:59,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-07 22:02:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:59,981 INFO L225 Difference]: With dead ends: 31 [2018-11-07 22:02:59,981 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 22:02:59,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 22:02:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 22:02:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-07 22:02:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-07 22:02:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-07 22:02:59,987 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2018-11-07 22:02:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:59,988 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-07 22:02:59,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 22:02:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-07 22:02:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 22:02:59,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:59,989 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:59,990 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:59,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:59,990 INFO L82 PathProgramCache]: Analyzing trace with hash 939189903, now seen corresponding path program 2 times [2018-11-07 22:02:59,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:59,992 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:00,118 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:00,118 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:00,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:00,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:00,119 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 22:03:00,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:00,139 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:00,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:03:00,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:00,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:00,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 22:03:00,516 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:00,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:03:00,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:03:00,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:03:00,517 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 6 states. [2018-11-07 22:03:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:00,576 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-07 22:03:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 22:03:00,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-07 22:03:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:00,580 INFO L225 Difference]: With dead ends: 35 [2018-11-07 22:03:00,580 INFO L226 Difference]: Without dead ends: 29 [2018-11-07 22:03:00,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-07 22:03:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-07 22:03:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-07 22:03:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-07 22:03:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-07 22:03:00,588 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-11-07 22:03:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:00,588 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-07 22:03:00,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:03:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-07 22:03:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 22:03:00,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:00,590 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:00,590 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:00,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:00,590 INFO L82 PathProgramCache]: Analyzing trace with hash -830243288, now seen corresponding path program 3 times [2018-11-07 22:03:00,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:00,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:00,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:00,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:00,592 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:00,739 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:00,739 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:00,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:00,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:00,739 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 22:03:00,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:00,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:00,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:00,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:00,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:00,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:01,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-07 22:03:01,009 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:01,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:03:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:03:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:03:01,010 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-11-07 22:03:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:01,065 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-07 22:03:01,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:03:01,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-07 22:03:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:01,067 INFO L225 Difference]: With dead ends: 39 [2018-11-07 22:03:01,067 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 22:03:01,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:03:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 22:03:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-07 22:03:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 22:03:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-07 22:03:01,073 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 26 [2018-11-07 22:03:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:01,074 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-07 22:03:01,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:03:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-07 22:03:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 22:03:01,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:01,075 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:01,075 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:01,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash 961847617, now seen corresponding path program 4 times [2018-11-07 22:03:01,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:01,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:01,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,078 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:01,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:01,185 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:01,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:01,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:01,185 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 22:03:01,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:01,194 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:01,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:01,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-07 22:03:01,656 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:01,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:03:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:03:01,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:03:01,658 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 8 states. [2018-11-07 22:03:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:01,719 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-07 22:03:01,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:03:01,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-07 22:03:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:01,722 INFO L225 Difference]: With dead ends: 43 [2018-11-07 22:03:01,722 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 22:03:01,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-07 22:03:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 22:03:01,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-07 22:03:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 22:03:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-07 22:03:01,728 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 30 [2018-11-07 22:03:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:01,729 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-07 22:03:01,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:03:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-07 22:03:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 22:03:01,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:01,730 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:01,730 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:01,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1036218406, now seen corresponding path program 5 times [2018-11-07 22:03:01,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:01,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:01,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:01,848 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:01,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:01,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:01,849 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 22:03:01,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:01,859 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:01,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:03:01,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:01,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:01,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:02,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-07 22:03:02,082 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:02,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:03:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:03:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:03:02,083 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 9 states. [2018-11-07 22:03:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:02,192 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-07 22:03:02,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:03:02,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-07 22:03:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:02,196 INFO L225 Difference]: With dead ends: 47 [2018-11-07 22:03:02,196 INFO L226 Difference]: Without dead ends: 41 [2018-11-07 22:03:02,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:03:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-07 22:03:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-07 22:03:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 22:03:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-07 22:03:02,203 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 34 [2018-11-07 22:03:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:02,204 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-07 22:03:02,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:03:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-07 22:03:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 22:03:02,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:02,206 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:02,206 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:02,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1578530317, now seen corresponding path program 6 times [2018-11-07 22:03:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:02,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:02,208 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:02,364 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 22:03:02,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:02,364 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:02,365 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:02,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:02,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:02,365 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 22:03:02,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:02,375 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:02,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:02,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:02,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:02,452 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 22:03:02,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:02,650 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 22:03:02,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:02,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-07 22:03:02,670 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:02,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:03:02,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:03:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:03:02,672 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 10 states. [2018-11-07 22:03:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:02,741 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-07 22:03:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:03:02,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-11-07 22:03:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:02,744 INFO L225 Difference]: With dead ends: 51 [2018-11-07 22:03:02,745 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 22:03:02,745 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:03:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 22:03:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-07 22:03:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 22:03:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-07 22:03:02,751 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 38 [2018-11-07 22:03:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:02,751 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-07 22:03:02,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:03:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-07 22:03:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-07 22:03:02,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:02,753 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:02,753 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:02,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1880502388, now seen corresponding path program 7 times [2018-11-07 22:03:02,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:02,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:02,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:02,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:02,755 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:03,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:03,058 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:03,059 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:03,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:03,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:03,059 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 22:03:03,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:03,069 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:03,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:03,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:03,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:03,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-07 22:03:03,315 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:03,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:03:03,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:03:03,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:03:03,317 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 11 states. [2018-11-07 22:03:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:03,500 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-07 22:03:03,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:03:03,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-11-07 22:03:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:03,502 INFO L225 Difference]: With dead ends: 55 [2018-11-07 22:03:03,502 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 22:03:03,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:03:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 22:03:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-07 22:03:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 22:03:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-07 22:03:03,509 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 42 [2018-11-07 22:03:03,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:03,509 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-07 22:03:03,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:03:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-07 22:03:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 22:03:03,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:03,511 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:03,511 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:03,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1386979493, now seen corresponding path program 8 times [2018-11-07 22:03:03,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:03,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:03,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:03,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:03,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:03,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:03,644 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:03,644 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:03,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:03,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:03,645 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 22:03:03,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:03,656 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:03,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 22:03:03,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:03,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:03,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:04,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:04,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-07 22:03:04,342 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:04,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:03:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:03:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:03:04,343 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 12 states. [2018-11-07 22:03:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:04,401 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-07 22:03:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 22:03:04,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-07 22:03:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:04,405 INFO L225 Difference]: With dead ends: 59 [2018-11-07 22:03:04,405 INFO L226 Difference]: Without dead ends: 53 [2018-11-07 22:03:04,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-07 22:03:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-07 22:03:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-07 22:03:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 22:03:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-07 22:03:04,413 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2018-11-07 22:03:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:04,413 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-07 22:03:04,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:03:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-07 22:03:04,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 22:03:04,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:04,415 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:04,415 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:04,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:04,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1333607742, now seen corresponding path program 9 times [2018-11-07 22:03:04,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:04,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:04,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:04,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:04,417 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:04,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:04,592 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:04,592 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:04,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:04,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:04,592 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 22:03:04,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:04,606 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:04,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:04,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:04,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:04,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:04,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:04,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-07 22:03:04,908 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:04,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:03:04,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:03:04,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-07 22:03:04,910 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 13 states. [2018-11-07 22:03:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:04,974 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-07 22:03:04,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 22:03:04,975 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-11-07 22:03:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:04,976 INFO L225 Difference]: With dead ends: 63 [2018-11-07 22:03:04,977 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 22:03:04,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-07 22:03:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 22:03:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-07 22:03:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 22:03:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-07 22:03:04,984 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 50 [2018-11-07 22:03:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:04,984 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-07 22:03:04,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:03:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-07 22:03:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 22:03:04,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:04,986 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:04,986 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:04,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash 445441367, now seen corresponding path program 10 times [2018-11-07 22:03:04,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:04,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:04,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:04,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:05,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:05,161 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:05,162 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:05,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:05,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:05,162 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 22:03:05,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:05,171 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:05,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:05,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:05,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:05,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-07 22:03:05,695 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:05,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 22:03:05,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 22:03:05,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:03:05,697 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 14 states. [2018-11-07 22:03:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:05,761 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-11-07 22:03:05,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:03:05,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-11-07 22:03:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:05,764 INFO L225 Difference]: With dead ends: 67 [2018-11-07 22:03:05,764 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 22:03:05,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:03:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 22:03:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-07 22:03:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 22:03:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-07 22:03:05,771 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 54 [2018-11-07 22:03:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:05,771 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-07 22:03:05,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 22:03:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-07 22:03:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-07 22:03:05,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:05,773 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:05,773 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:05,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash 115923184, now seen corresponding path program 11 times [2018-11-07 22:03:05,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:05,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:05,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:05,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:05,777 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:05,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:05,995 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:05,995 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:05,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:05,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:05,996 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 22:03:06,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:06,008 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:06,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 22:03:06,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:06,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:06,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:06,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:06,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-07 22:03:06,554 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:06,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 22:03:06,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 22:03:06,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:03:06,556 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 15 states. [2018-11-07 22:03:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:06,694 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-11-07 22:03:06,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 22:03:06,694 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-11-07 22:03:06,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:06,695 INFO L225 Difference]: With dead ends: 71 [2018-11-07 22:03:06,695 INFO L226 Difference]: Without dead ends: 65 [2018-11-07 22:03:06,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-07 22:03:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-07 22:03:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-07 22:03:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 22:03:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-07 22:03:06,702 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 58 [2018-11-07 22:03:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:06,703 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-07 22:03:06,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 22:03:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-07 22:03:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-07 22:03:06,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:06,704 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:06,704 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:06,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:06,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1233168375, now seen corresponding path program 12 times [2018-11-07 22:03:06,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:06,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:06,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:06,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:06,706 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:06,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:06,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:06,997 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:06,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:06,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:06,997 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 22:03:07,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:07,007 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:07,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:07,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:07,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:07,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:07,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:07,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-07 22:03:07,448 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:07,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 22:03:07,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 22:03:07,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:03:07,450 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 16 states. [2018-11-07 22:03:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:07,614 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-07 22:03:07,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 22:03:07,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2018-11-07 22:03:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:07,615 INFO L225 Difference]: With dead ends: 75 [2018-11-07 22:03:07,616 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 22:03:07,616 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-07 22:03:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 22:03:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-07 22:03:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 22:03:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-11-07 22:03:07,623 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 62 [2018-11-07 22:03:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:07,623 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-11-07 22:03:07,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 22:03:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-11-07 22:03:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 22:03:07,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:07,625 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:07,625 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:07,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:07,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1440832862, now seen corresponding path program 13 times [2018-11-07 22:03:07,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:07,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:07,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:07,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:07,627 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:08,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:08,620 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:08,620 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:08,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:08,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:08,621 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 22:03:08,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:08,629 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:08,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:08,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:09,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:09,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-07 22:03:09,423 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:09,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:03:09,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:03:09,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:03:09,424 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 17 states. [2018-11-07 22:03:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:09,494 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-11-07 22:03:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 22:03:09,495 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2018-11-07 22:03:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:09,496 INFO L225 Difference]: With dead ends: 79 [2018-11-07 22:03:09,496 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 22:03:09,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-07 22:03:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 22:03:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-11-07 22:03:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 22:03:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-07 22:03:09,501 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 66 [2018-11-07 22:03:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:09,502 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-07 22:03:09,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:03:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-07 22:03:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-07 22:03:09,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:09,503 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:09,504 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:09,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash -780863301, now seen corresponding path program 14 times [2018-11-07 22:03:09,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:09,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:09,505 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:09,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:09,808 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:09,808 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:09,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:09,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:09,808 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 22:03:09,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:09,817 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:09,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 22:03:09,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:09,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:10,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:10,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:10,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-07 22:03:10,442 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:10,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:03:10,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:03:10,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:03:10,444 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 18 states. [2018-11-07 22:03:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:10,617 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-11-07 22:03:10,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 22:03:10,619 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-11-07 22:03:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:10,620 INFO L225 Difference]: With dead ends: 83 [2018-11-07 22:03:10,620 INFO L226 Difference]: Without dead ends: 77 [2018-11-07 22:03:10,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 22:03:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-07 22:03:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-07 22:03:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 22:03:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-07 22:03:10,633 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 70 [2018-11-07 22:03:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:10,634 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-07 22:03:10,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:03:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-07 22:03:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 22:03:10,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:10,638 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:10,638 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:10,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash 454072916, now seen corresponding path program 15 times [2018-11-07 22:03:10,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:10,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:10,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:10,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:10,640 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:10,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:10,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:10,925 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:10,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:10,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:10,926 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 22:03:10,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:10,940 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:11,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:11,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:11,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:11,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:11,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:11,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-11-07 22:03:11,721 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:11,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 22:03:11,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 22:03:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 22:03:11,723 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 19 states. [2018-11-07 22:03:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:11,800 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-07 22:03:11,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 22:03:11,800 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2018-11-07 22:03:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:11,802 INFO L225 Difference]: With dead ends: 87 [2018-11-07 22:03:11,802 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 22:03:11,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 22:03:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 22:03:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-07 22:03:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 22:03:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-11-07 22:03:11,807 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 74 [2018-11-07 22:03:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:11,808 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-11-07 22:03:11,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 22:03:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-11-07 22:03:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-07 22:03:11,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:11,809 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:11,809 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:11,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:11,810 INFO L82 PathProgramCache]: Analyzing trace with hash 73385837, now seen corresponding path program 16 times [2018-11-07 22:03:11,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:11,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:11,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:11,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:11,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:12,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:12,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:12,088 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:12,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:12,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:12,089 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 22:03:12,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:12,098 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:12,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:12,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:13,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:13,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-07 22:03:13,137 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:13,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:03:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:03:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:03:13,139 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 20 states. [2018-11-07 22:03:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:13,228 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-11-07 22:03:13,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 22:03:13,229 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2018-11-07 22:03:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:13,230 INFO L225 Difference]: With dead ends: 91 [2018-11-07 22:03:13,230 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 22:03:13,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:03:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 22:03:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-07 22:03:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-07 22:03:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-11-07 22:03:13,234 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 78 [2018-11-07 22:03:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:13,235 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-11-07 22:03:13,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:03:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-11-07 22:03:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-07 22:03:13,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:13,236 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:13,236 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:13,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash 699449350, now seen corresponding path program 17 times [2018-11-07 22:03:13,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:13,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:13,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:13,618 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:13,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:13,618 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:13,618 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:13,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:13,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:13,619 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 22:03:13,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:13,634 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:14,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-07 22:03:14,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:14,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:14,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:14,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:14,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-07 22:03:14,545 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:14,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 22:03:14,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 22:03:14,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:03:14,546 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 21 states. [2018-11-07 22:03:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:14,650 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-11-07 22:03:14,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 22:03:14,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-11-07 22:03:14,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:14,651 INFO L225 Difference]: With dead ends: 95 [2018-11-07 22:03:14,651 INFO L226 Difference]: Without dead ends: 89 [2018-11-07 22:03:14,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 22:03:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-07 22:03:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-11-07 22:03:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 22:03:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-07 22:03:14,656 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 82 [2018-11-07 22:03:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:14,657 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-07 22:03:14,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 22:03:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-07 22:03:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 22:03:14,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:14,658 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:14,658 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:14,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash -701381601, now seen corresponding path program 18 times [2018-11-07 22:03:14,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:14,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:14,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:14,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:14,978 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:14,978 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:14,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:14,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:14,979 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 22:03:14,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:14,988 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:15,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:15,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:15,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:15,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:15,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:15,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-11-07 22:03:15,554 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:15,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 22:03:15,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 22:03:15,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:03:15,556 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 22 states. [2018-11-07 22:03:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:15,648 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-07 22:03:15,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 22:03:15,649 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 86 [2018-11-07 22:03:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:15,650 INFO L225 Difference]: With dead ends: 99 [2018-11-07 22:03:15,650 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 22:03:15,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:03:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 22:03:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-07 22:03:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-07 22:03:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-11-07 22:03:15,655 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 86 [2018-11-07 22:03:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:15,655 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-11-07 22:03:15,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 22:03:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-11-07 22:03:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-07 22:03:15,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:15,656 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:15,657 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:15,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1812917320, now seen corresponding path program 19 times [2018-11-07 22:03:15,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:15,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:15,658 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:16,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:16,977 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:16,977 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:16,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:16,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:16,977 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 22:03:16,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:16,986 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:17,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:17,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:17,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:17,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-07 22:03:17,724 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:17,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:03:17,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:03:17,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:03:17,726 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 23 states. [2018-11-07 22:03:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:17,898 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-11-07 22:03:17,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 22:03:17,899 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 90 [2018-11-07 22:03:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:17,900 INFO L225 Difference]: With dead ends: 103 [2018-11-07 22:03:17,900 INFO L226 Difference]: Without dead ends: 97 [2018-11-07 22:03:17,901 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:03:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-07 22:03:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-11-07 22:03:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-07 22:03:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-11-07 22:03:17,904 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 90 [2018-11-07 22:03:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:17,904 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-11-07 22:03:17,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:03:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-11-07 22:03:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-07 22:03:17,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:17,906 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:17,906 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:17,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:17,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1143148847, now seen corresponding path program 20 times [2018-11-07 22:03:17,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:17,907 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:18,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:18,208 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:18,208 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:18,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:18,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:18,208 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 22:03:18,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:18,218 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:18,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-07 22:03:18,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:18,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:18,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:19,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:19,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-07 22:03:19,642 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:19,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 22:03:19,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 22:03:19,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:03:19,644 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 24 states. [2018-11-07 22:03:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:19,801 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-11-07 22:03:19,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:03:19,805 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 94 [2018-11-07 22:03:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:19,806 INFO L225 Difference]: With dead ends: 107 [2018-11-07 22:03:19,806 INFO L226 Difference]: Without dead ends: 101 [2018-11-07 22:03:19,807 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 22:03:19,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-07 22:03:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-07 22:03:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 22:03:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-11-07 22:03:19,825 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 94 [2018-11-07 22:03:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:19,825 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-11-07 22:03:19,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 22:03:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-11-07 22:03:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 22:03:19,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:19,827 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:19,827 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:19,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:19,827 INFO L82 PathProgramCache]: Analyzing trace with hash 96703850, now seen corresponding path program 21 times [2018-11-07 22:03:19,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:19,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:19,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:19,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:19,828 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:20,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:20,104 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:20,104 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:20,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:20,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:20,104 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 22:03:20,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:20,112 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:20,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:20,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:20,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:20,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:21,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:21,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-11-07 22:03:21,031 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:21,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 22:03:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 22:03:21,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 22:03:21,032 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 25 states. [2018-11-07 22:03:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:21,146 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-07 22:03:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 22:03:21,147 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 98 [2018-11-07 22:03:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:21,148 INFO L225 Difference]: With dead ends: 111 [2018-11-07 22:03:21,148 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 22:03:21,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 22:03:21,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 22:03:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-07 22:03:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-07 22:03:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-11-07 22:03:21,154 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 98 [2018-11-07 22:03:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:21,154 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-11-07 22:03:21,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 22:03:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-11-07 22:03:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-07 22:03:21,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:21,156 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:21,156 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:21,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash 408110979, now seen corresponding path program 22 times [2018-11-07 22:03:21,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:21,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:21,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:21,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:21,472 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:21,472 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:21,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:21,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:21,472 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 22:03:21,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:21,482 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:21,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:21,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:22,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:22,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-07 22:03:22,241 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:22,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 22:03:22,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 22:03:22,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:03:22,242 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 26 states. [2018-11-07 22:03:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:22,381 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-11-07 22:03:22,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 22:03:22,382 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2018-11-07 22:03:22,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:22,383 INFO L225 Difference]: With dead ends: 115 [2018-11-07 22:03:22,383 INFO L226 Difference]: Without dead ends: 109 [2018-11-07 22:03:22,384 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 22:03:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-07 22:03:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-07 22:03:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-07 22:03:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-11-07 22:03:22,387 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 102 [2018-11-07 22:03:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:22,388 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-11-07 22:03:22,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 22:03:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-11-07 22:03:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-07 22:03:22,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:22,389 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:22,389 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:22,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash 421152028, now seen corresponding path program 23 times [2018-11-07 22:03:22,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:22,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:22,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:22,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:22,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:23,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:23,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:23,076 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:23,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:23,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:23,077 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 22:03:23,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:23,086 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:24,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-07 22:03:24,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:24,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:24,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:25,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:25,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-07 22:03:25,607 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:25,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 22:03:25,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 22:03:25,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 22:03:25,608 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 27 states. [2018-11-07 22:03:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:25,731 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-11-07 22:03:25,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 22:03:25,732 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 106 [2018-11-07 22:03:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:25,733 INFO L225 Difference]: With dead ends: 119 [2018-11-07 22:03:25,734 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 22:03:25,736 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 22:03:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 22:03:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-07 22:03:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 22:03:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-11-07 22:03:25,739 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 106 [2018-11-07 22:03:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:25,740 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-11-07 22:03:25,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 22:03:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-11-07 22:03:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-07 22:03:25,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:25,741 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:25,741 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:25,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:25,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1015467573, now seen corresponding path program 24 times [2018-11-07 22:03:25,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:25,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:25,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:25,743 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:26,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:26,207 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:26,207 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:26,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:26,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:26,207 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 22:03:26,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:26,216 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:26,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:26,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:26,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:26,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:27,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:27,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-11-07 22:03:27,564 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:27,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 22:03:27,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 22:03:27,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 22:03:27,566 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 28 states. [2018-11-07 22:03:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:27,740 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-11-07 22:03:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 22:03:27,740 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 110 [2018-11-07 22:03:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:27,741 INFO L225 Difference]: With dead ends: 123 [2018-11-07 22:03:27,741 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 22:03:27,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 22:03:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 22:03:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-07 22:03:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-07 22:03:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-11-07 22:03:27,746 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 110 [2018-11-07 22:03:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:27,747 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-11-07 22:03:27,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 22:03:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-11-07 22:03:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-07 22:03:27,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:27,748 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:27,748 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:27,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1441211086, now seen corresponding path program 25 times [2018-11-07 22:03:27,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:27,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:27,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:27,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:27,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:28,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:28,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:28,273 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:28,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:28,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:28,273 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 22:03:28,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:28,282 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:28,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:28,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:30,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:30,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-07 22:03:30,121 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:30,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 22:03:30,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 22:03:30,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:03:30,123 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 29 states. [2018-11-07 22:03:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:30,249 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-11-07 22:03:30,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 22:03:30,249 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 114 [2018-11-07 22:03:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:30,251 INFO L225 Difference]: With dead ends: 127 [2018-11-07 22:03:30,251 INFO L226 Difference]: Without dead ends: 121 [2018-11-07 22:03:30,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-07 22:03:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-07 22:03:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-07 22:03:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-07 22:03:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-11-07 22:03:30,257 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 114 [2018-11-07 22:03:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:30,258 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-11-07 22:03:30,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 22:03:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-11-07 22:03:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 22:03:30,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:30,259 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:30,259 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:30,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1734968039, now seen corresponding path program 26 times [2018-11-07 22:03:30,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:30,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:30,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:30,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:30,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:30,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:30,612 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:30,612 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:30,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:30,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:30,612 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 22:03:30,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:30,620 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:33,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-07 22:03:33,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:33,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:33,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:34,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:34,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-07 22:03:34,241 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:34,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 22:03:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 22:03:34,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:03:34,243 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 30 states. [2018-11-07 22:03:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:34,471 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-11-07 22:03:34,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 22:03:34,471 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 118 [2018-11-07 22:03:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:34,473 INFO L225 Difference]: With dead ends: 131 [2018-11-07 22:03:34,473 INFO L226 Difference]: Without dead ends: 125 [2018-11-07 22:03:34,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 22:03:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-07 22:03:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-07 22:03:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-07 22:03:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-11-07 22:03:34,479 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 118 [2018-11-07 22:03:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:34,480 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-11-07 22:03:34,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 22:03:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-11-07 22:03:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 22:03:34,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:34,481 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:34,481 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:34,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:34,481 INFO L82 PathProgramCache]: Analyzing trace with hash 840707712, now seen corresponding path program 27 times [2018-11-07 22:03:34,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:34,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:34,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:34,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:34,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:34,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:34,921 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:34,921 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:34,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 22:03:34,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:34,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 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 22:03:34,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:34,931 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:35,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:35,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:35,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:35,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:36,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:36,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-11-07 22:03:36,360 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:36,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-07 22:03:36,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-07 22:03:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 22:03:36,361 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 31 states. [2018-11-07 22:03:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:36,513 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-11-07 22:03:36,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 22:03:36,516 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 122 [2018-11-07 22:03:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:36,517 INFO L225 Difference]: With dead ends: 135 [2018-11-07 22:03:36,517 INFO L226 Difference]: Without dead ends: 129 [2018-11-07 22:03:36,518 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-07 22:03:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-07 22:03:36,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-11-07 22:03:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-07 22:03:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-11-07 22:03:36,522 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 122 [2018-11-07 22:03:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:36,523 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-11-07 22:03:36,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-07 22:03:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-11-07 22:03:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 22:03:36,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:36,524 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:36,524 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:36,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:36,525 INFO L82 PathProgramCache]: Analyzing trace with hash -974297703, now seen corresponding path program 28 times [2018-11-07 22:03:36,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:36,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:36,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:36,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:37,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:37,309 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:37,310 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:37,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:37,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:37,310 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 22:03:37,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:37,319 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:37,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:37,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:38,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:38,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-07 22:03:38,584 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:38,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 22:03:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 22:03:38,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:03:38,586 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 32 states. [2018-11-07 22:03:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:38,736 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-11-07 22:03:38,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 22:03:38,738 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2018-11-07 22:03:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:38,739 INFO L225 Difference]: With dead ends: 139 [2018-11-07 22:03:38,739 INFO L226 Difference]: Without dead ends: 133 [2018-11-07 22:03:38,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 22:03:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-07 22:03:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-07 22:03:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-07 22:03:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-11-07 22:03:38,745 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 126 [2018-11-07 22:03:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:38,746 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-11-07 22:03:38,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 22:03:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-11-07 22:03:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 22:03:38,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:38,747 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:38,747 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:38,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:38,748 INFO L82 PathProgramCache]: Analyzing trace with hash 296446002, now seen corresponding path program 29 times [2018-11-07 22:03:38,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:38,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:38,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:38,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:38,749 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:39,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:39,182 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:39,182 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:39,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:39,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:39,182 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 22:03:39,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:39,203 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:42,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-07 22:03:42,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:42,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:42,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:43,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:43,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-07 22:03:43,884 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:43,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:03:43,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:03:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 22:03:43,885 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 33 states. [2018-11-07 22:03:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:44,012 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-11-07 22:03:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:03:44,013 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 130 [2018-11-07 22:03:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:44,014 INFO L225 Difference]: With dead ends: 143 [2018-11-07 22:03:44,014 INFO L226 Difference]: Without dead ends: 137 [2018-11-07 22:03:44,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-07 22:03:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-07 22:03:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-07 22:03:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-07 22:03:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-11-07 22:03:44,018 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 130 [2018-11-07 22:03:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:44,019 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-11-07 22:03:44,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 22:03:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-11-07 22:03:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 22:03:44,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:44,020 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:44,020 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:44,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1929672267, now seen corresponding path program 30 times [2018-11-07 22:03:44,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:44,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:44,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:44,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:44,021 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:44,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:44,811 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:44,811 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:44,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:44,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:44,811 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 22:03:44,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:44,819 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:46,018 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:46,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:46,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:46,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:47,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:47,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-11-07 22:03:47,114 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:47,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 22:03:47,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 22:03:47,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 22:03:47,115 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 34 states. [2018-11-07 22:03:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:47,283 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-11-07 22:03:47,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 22:03:47,283 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 134 [2018-11-07 22:03:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:47,285 INFO L225 Difference]: With dead ends: 147 [2018-11-07 22:03:47,285 INFO L226 Difference]: Without dead ends: 141 [2018-11-07 22:03:47,285 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 22:03:47,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-07 22:03:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-07 22:03:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-07 22:03:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-11-07 22:03:47,289 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 134 [2018-11-07 22:03:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:47,290 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-11-07 22:03:47,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 22:03:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-11-07 22:03:47,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-07 22:03:47,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:47,291 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:47,291 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:47,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:47,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1183240164, now seen corresponding path program 31 times [2018-11-07 22:03:47,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:47,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:47,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:47,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:47,292 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:48,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:48,331 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:48,331 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:48,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:48,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:48,332 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 22:03:48,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:48,342 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:48,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:48,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:49,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:49,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-07 22:03:49,888 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:49,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 22:03:49,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 22:03:49,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:03:49,890 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 35 states. [2018-11-07 22:03:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:50,030 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-11-07 22:03:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 22:03:50,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2018-11-07 22:03:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:50,032 INFO L225 Difference]: With dead ends: 151 [2018-11-07 22:03:50,032 INFO L226 Difference]: Without dead ends: 145 [2018-11-07 22:03:50,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 22:03:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-07 22:03:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-07 22:03:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-07 22:03:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-11-07 22:03:50,038 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 138 [2018-11-07 22:03:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:50,039 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-11-07 22:03:50,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 22:03:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-11-07 22:03:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 22:03:50,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:50,040 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:50,040 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:50,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:50,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2007020797, now seen corresponding path program 32 times [2018-11-07 22:03:50,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:50,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:50,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:52,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:52,386 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:52,387 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:52,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:52,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:52,387 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 22:03:52,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:52,395 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:57,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-07 22:03:57,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:57,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:57,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:03:59,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:59,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-07 22:03:59,439 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:59,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 22:03:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 22:03:59,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:03:59,441 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 36 states. [2018-11-07 22:03:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:59,857 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-11-07 22:03:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 22:03:59,858 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 142 [2018-11-07 22:03:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:59,859 INFO L225 Difference]: With dead ends: 155 [2018-11-07 22:03:59,860 INFO L226 Difference]: Without dead ends: 149 [2018-11-07 22:03:59,861 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 22:03:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-07 22:03:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-11-07 22:03:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-07 22:03:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-11-07 22:03:59,865 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 142 [2018-11-07 22:03:59,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:59,865 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-11-07 22:03:59,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 22:03:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-11-07 22:03:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 22:03:59,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:59,866 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:59,866 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:59,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash 278947222, now seen corresponding path program 33 times [2018-11-07 22:03:59,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:59,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:59,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:59,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:59,868 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:01,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:01,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:01,250 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:01,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:01,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:01,250 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 22:04:01,259 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:04:01,259 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:04:02,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:04:02,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:02,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:02,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:04,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:04,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-11-07 22:04:04,341 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:04,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 22:04:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 22:04:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 22:04:04,343 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 37 states. [2018-11-07 22:04:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:04,546 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-11-07 22:04:04,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 22:04:04,546 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 146 [2018-11-07 22:04:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:04,548 INFO L225 Difference]: With dead ends: 159 [2018-11-07 22:04:04,548 INFO L226 Difference]: Without dead ends: 153 [2018-11-07 22:04:04,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 22:04:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-07 22:04:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-07 22:04:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-07 22:04:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-11-07 22:04:04,555 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 146 [2018-11-07 22:04:04,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:04,555 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-11-07 22:04:04,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 22:04:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-11-07 22:04:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-07 22:04:04,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:04,557 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:04,557 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:04,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:04,557 INFO L82 PathProgramCache]: Analyzing trace with hash -894164561, now seen corresponding path program 34 times [2018-11-07 22:04:04,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:04,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:04,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:04,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:04,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:05,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:05,784 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:05,784 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:05,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:05,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:05,784 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 22:04:05,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:05,792 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:04:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:05,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:05,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:08,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:08,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-07 22:04:08,276 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:08,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 22:04:08,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 22:04:08,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:04:08,278 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 38 states. [2018-11-07 22:04:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:08,446 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-11-07 22:04:08,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 22:04:08,447 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 150 [2018-11-07 22:04:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:08,448 INFO L225 Difference]: With dead ends: 163 [2018-11-07 22:04:08,448 INFO L226 Difference]: Without dead ends: 157 [2018-11-07 22:04:08,449 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-07 22:04:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-07 22:04:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-11-07 22:04:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-07 22:04:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-11-07 22:04:08,455 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 150 [2018-11-07 22:04:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:08,455 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-11-07 22:04:08,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 22:04:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-11-07 22:04:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-07 22:04:08,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:08,456 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:08,457 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:08,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:08,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1645598392, now seen corresponding path program 35 times [2018-11-07 22:04:08,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:08,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:08,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:08,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:08,458 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:09,502 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 22:04:09,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:09,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:09,503 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:09,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:09,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:09,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 22:04:09,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:04:09,511 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:04:19,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-07 22:04:19,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:19,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:19,760 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 22:04:19,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:21,243 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 22:04:21,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:21,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-07 22:04:21,266 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:21,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 22:04:21,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 22:04:21,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 22:04:21,267 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 39 states. [2018-11-07 22:04:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:21,758 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-11-07 22:04:21,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 22:04:21,758 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2018-11-07 22:04:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:21,759 INFO L225 Difference]: With dead ends: 167 [2018-11-07 22:04:21,759 INFO L226 Difference]: Without dead ends: 161 [2018-11-07 22:04:21,759 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 22:04:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-07 22:04:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-11-07 22:04:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-07 22:04:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-11-07 22:04:21,765 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 154 [2018-11-07 22:04:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:21,765 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-11-07 22:04:21,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 22:04:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-11-07 22:04:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-07 22:04:21,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:21,767 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:21,768 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:21,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:21,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1362148449, now seen corresponding path program 36 times [2018-11-07 22:04:21,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:21,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:21,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:21,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:21,770 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:22,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:22,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:22,395 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:22,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:22,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:22,395 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 22:04:22,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:04:22,412 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:04:25,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:04:25,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:25,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:25,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:27,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:27,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-11-07 22:04:27,441 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:27,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 22:04:27,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 22:04:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 22:04:27,442 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 40 states. [2018-11-07 22:04:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:27,627 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-11-07 22:04:27,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 22:04:27,635 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 158 [2018-11-07 22:04:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:27,636 INFO L225 Difference]: With dead ends: 171 [2018-11-07 22:04:27,636 INFO L226 Difference]: Without dead ends: 165 [2018-11-07 22:04:27,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-07 22:04:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-07 22:04:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-11-07 22:04:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-07 22:04:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-11-07 22:04:27,641 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 158 [2018-11-07 22:04:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:27,641 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-11-07 22:04:27,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 22:04:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-11-07 22:04:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-07 22:04:27,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:27,643 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:27,643 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:27,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash 173415162, now seen corresponding path program 37 times [2018-11-07 22:04:27,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:27,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:27,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:27,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:27,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:28,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:28,324 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:28,324 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:28,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:28,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:28,325 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 22:04:28,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:28,342 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:04:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:28,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:28,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:30,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:30,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-07 22:04:30,438 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:30,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 22:04:30,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 22:04:30,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:04:30,440 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 41 states. [2018-11-07 22:04:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:30,697 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-11-07 22:04:30,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 22:04:30,698 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 162 [2018-11-07 22:04:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:30,700 INFO L225 Difference]: With dead ends: 175 [2018-11-07 22:04:30,700 INFO L226 Difference]: Without dead ends: 169 [2018-11-07 22:04:30,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:04:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-07 22:04:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2018-11-07 22:04:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-07 22:04:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-11-07 22:04:30,706 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 162 [2018-11-07 22:04:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:30,706 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-11-07 22:04:30,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 22:04:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-11-07 22:04:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 22:04:30,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:30,707 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:30,707 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:30,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:30,708 INFO L82 PathProgramCache]: Analyzing trace with hash -569866989, now seen corresponding path program 38 times [2018-11-07 22:04:30,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:30,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:30,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:30,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:30,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:31,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:31,464 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:31,464 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:31,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:31,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:31,465 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 22:04:31,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:04:31,480 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:04:43,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-07 22:04:43,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:43,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:43,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:45,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:45,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-07 22:04:45,989 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:45,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 22:04:45,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 22:04:45,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 22:04:45,990 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 42 states. [2018-11-07 22:04:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:46,581 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-11-07 22:04:46,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 22:04:46,581 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 166 [2018-11-07 22:04:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:46,583 INFO L225 Difference]: With dead ends: 179 [2018-11-07 22:04:46,583 INFO L226 Difference]: Without dead ends: 173 [2018-11-07 22:04:46,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-07 22:04:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-07 22:04:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-11-07 22:04:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-07 22:04:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-11-07 22:04:46,588 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 166 [2018-11-07 22:04:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:46,588 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-11-07 22:04:46,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 22:04:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-11-07 22:04:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 22:04:46,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:46,590 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:46,590 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:46,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1607875244, now seen corresponding path program 39 times [2018-11-07 22:04:46,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:46,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:46,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:47,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:47,312 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:47,312 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:47,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:47,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:47,312 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 22:04:47,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:04:47,320 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:04:48,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:04:48,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:48,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:48,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:50,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:50,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-11-07 22:04:50,982 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:50,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 22:04:50,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 22:04:50,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 22:04:50,984 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 43 states. [2018-11-07 22:04:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:51,164 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-11-07 22:04:51,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 22:04:51,165 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2018-11-07 22:04:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:51,167 INFO L225 Difference]: With dead ends: 183 [2018-11-07 22:04:51,167 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 22:04:51,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-07 22:04:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 22:04:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-07 22:04:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-07 22:04:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-11-07 22:04:51,172 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 170 [2018-11-07 22:04:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:51,172 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-11-07 22:04:51,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 22:04:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-11-07 22:04:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-07 22:04:51,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:51,174 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:51,174 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:51,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:51,174 INFO L82 PathProgramCache]: Analyzing trace with hash 841841605, now seen corresponding path program 40 times [2018-11-07 22:04:51,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:51,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:51,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:04:51,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:51,175 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:52,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:52,414 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:52,414 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:52,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:04:52,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:52,414 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 22:04:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:52,424 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:04:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:52,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:52,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:54,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:54,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-07 22:04:54,271 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:54,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 22:04:54,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 22:04:54,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:04:54,272 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 44 states. [2018-11-07 22:04:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:04:54,473 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-11-07 22:04:54,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 22:04:54,473 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 174 [2018-11-07 22:04:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:04:54,475 INFO L225 Difference]: With dead ends: 187 [2018-11-07 22:04:54,475 INFO L226 Difference]: Without dead ends: 181 [2018-11-07 22:04:54,476 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-07 22:04:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-07 22:04:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2018-11-07 22:04:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-07 22:04:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-11-07 22:04:54,481 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 174 [2018-11-07 22:04:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:04:54,481 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-11-07 22:04:54,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 22:04:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-11-07 22:04:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-07 22:04:54,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:04:54,482 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:04:54,482 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:04:54,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:04:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1772320674, now seen corresponding path program 41 times [2018-11-07 22:04:54,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:04:54,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:54,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:04:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:04:54,484 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:04:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:04:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:04:55,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:55,606 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:04:55,606 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:04:55,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 22:04:55,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:04:55,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 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 22:04:55,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:04:55,614 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:05:27,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-07 22:05:27,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:05:27,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:27,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:29,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:29,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-07 22:05:29,134 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:29,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-07 22:05:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-07 22:05:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 22:05:29,136 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 45 states. [2018-11-07 22:05:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:29,333 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-11-07 22:05:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 22:05:29,334 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 178 [2018-11-07 22:05:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:29,335 INFO L225 Difference]: With dead ends: 191 [2018-11-07 22:05:29,335 INFO L226 Difference]: Without dead ends: 185 [2018-11-07 22:05:29,336 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-07 22:05:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-07 22:05:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-11-07 22:05:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-07 22:05:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-11-07 22:05:29,339 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 178 [2018-11-07 22:05:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:29,340 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-11-07 22:05:29,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-07 22:05:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-11-07 22:05:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-07 22:05:29,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:29,341 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:29,341 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:29,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:29,341 INFO L82 PathProgramCache]: Analyzing trace with hash -57565065, now seen corresponding path program 42 times [2018-11-07 22:05:29,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:29,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:05:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:29,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:30,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:30,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:30,183 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:30,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:30,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:30,183 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 22:05:30,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:05:30,192 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:05:32,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:05:32,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:05:32,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:32,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:34,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:34,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-11-07 22:05:34,646 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:34,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-07 22:05:34,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-07 22:05:34,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 22:05:34,648 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 46 states. [2018-11-07 22:05:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:34,886 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-11-07 22:05:34,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-07 22:05:34,887 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 182 [2018-11-07 22:05:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:34,888 INFO L225 Difference]: With dead ends: 195 [2018-11-07 22:05:34,888 INFO L226 Difference]: Without dead ends: 189 [2018-11-07 22:05:34,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-07 22:05:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-07 22:05:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-11-07 22:05:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-07 22:05:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-11-07 22:05:34,893 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 182 [2018-11-07 22:05:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:34,894 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-11-07 22:05:34,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-07 22:05:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-11-07 22:05:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-07 22:05:34,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:34,895 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:34,895 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:34,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1814363120, now seen corresponding path program 43 times [2018-11-07 22:05:34,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:34,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:05:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:34,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:35,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:35,724 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:35,724 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:35,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:05:35,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:35,725 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 22:05:35,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:05:35,735 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:05:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:35,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:05:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:35,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:05:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:38,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:05:38,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-07 22:05:38,054 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:05:38,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-07 22:05:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-07 22:05:38,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 22:05:38,056 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 47 states. [2018-11-07 22:05:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:05:38,301 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-11-07 22:05:38,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-07 22:05:38,302 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 186 [2018-11-07 22:05:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:05:38,303 INFO L225 Difference]: With dead ends: 199 [2018-11-07 22:05:38,303 INFO L226 Difference]: Without dead ends: 193 [2018-11-07 22:05:38,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-07 22:05:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-07 22:05:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2018-11-07 22:05:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-07 22:05:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-11-07 22:05:38,307 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 186 [2018-11-07 22:05:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:05:38,307 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-11-07 22:05:38,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-07 22:05:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-11-07 22:05:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-07 22:05:38,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:05:38,308 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:05:38,308 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:05:38,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:05:38,309 INFO L82 PathProgramCache]: Analyzing trace with hash -634981591, now seen corresponding path program 44 times [2018-11-07 22:05:38,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:05:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:38,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:05:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:05:38,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:05:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:05:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:05:39,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:39,259 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:05:39,259 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:05:39,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 22:05:39,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:05:39,260 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 22:05:39,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:05:39,269 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:06:15,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-11-07 22:06:15,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:15,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:15,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:17,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:17,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-11-07 22:06:17,504 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:17,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 22:06:17,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 22:06:17,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 22:06:17,506 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 48 states. [2018-11-07 22:06:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:17,719 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-11-07 22:06:17,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-07 22:06:17,719 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 190 [2018-11-07 22:06:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:17,721 INFO L225 Difference]: With dead ends: 203 [2018-11-07 22:06:17,721 INFO L226 Difference]: Without dead ends: 197 [2018-11-07 22:06:17,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 22:06:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-07 22:06:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-11-07 22:06:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-07 22:06:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-11-07 22:06:17,725 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 190 [2018-11-07 22:06:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:17,725 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-11-07 22:06:17,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-07 22:06:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-11-07 22:06:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-07 22:06:17,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:17,727 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:17,727 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:17,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:17,727 INFO L82 PathProgramCache]: Analyzing trace with hash 742632898, now seen corresponding path program 45 times [2018-11-07 22:06:17,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:17,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:17,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:17,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:17,728 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:18,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:18,601 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:18,602 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:18,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:18,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:18,602 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 22:06:18,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:06:18,613 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:06:22,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:06:22,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:06:22,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:22,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:24,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:24,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-11-07 22:06:24,797 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:24,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-07 22:06:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-07 22:06:24,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 22:06:24,798 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 49 states. [2018-11-07 22:06:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:25,023 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-11-07 22:06:25,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-07 22:06:25,023 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 194 [2018-11-07 22:06:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:25,024 INFO L225 Difference]: With dead ends: 207 [2018-11-07 22:06:25,024 INFO L226 Difference]: Without dead ends: 201 [2018-11-07 22:06:25,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-11-07 22:06:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-07 22:06:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-11-07 22:06:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 22:06:25,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-11-07 22:06:25,029 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 194 [2018-11-07 22:06:25,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:25,029 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-11-07 22:06:25,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-07 22:06:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-11-07 22:06:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 22:06:25,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:25,030 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:25,030 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:25,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:25,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1440707547, now seen corresponding path program 46 times [2018-11-07 22:06:25,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:25,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:25,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:06:25,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:25,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:26,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:26,275 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:26,275 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:26,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:26,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:26,276 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 22:06:26,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:26,287 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:06:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:26,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:06:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:26,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:06:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:28,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:06:28,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-11-07 22:06:28,986 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:06:28,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 22:06:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 22:06:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 22:06:28,987 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 50 states. [2018-11-07 22:06:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:06:29,208 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-11-07 22:06:29,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-07 22:06:29,208 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 198 [2018-11-07 22:06:29,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:06:29,210 INFO L225 Difference]: With dead ends: 211 [2018-11-07 22:06:29,210 INFO L226 Difference]: Without dead ends: 205 [2018-11-07 22:06:29,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-11-07 22:06:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-07 22:06:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2018-11-07 22:06:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-07 22:06:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-11-07 22:06:29,216 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 198 [2018-11-07 22:06:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:06:29,216 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-11-07 22:06:29,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 22:06:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-11-07 22:06:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-07 22:06:29,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:06:29,217 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:06:29,217 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:06:29,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:06:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash 562595188, now seen corresponding path program 47 times [2018-11-07 22:06:29,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:06:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:29,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:06:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:06:29,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:06:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:06:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:06:30,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:30,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:06:30,258 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:06:30,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:06:30,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:06:30,258 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 22:06:30,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:06:30,266 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:07:10,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-11-07 22:07:10,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:10,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:10,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:13,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:13,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-11-07 22:07:13,061 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:13,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 22:07:13,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 22:07:13,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 22:07:13,062 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 51 states. [2018-11-07 22:07:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:13,395 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-11-07 22:07:13,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 22:07:13,395 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 202 [2018-11-07 22:07:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:13,397 INFO L225 Difference]: With dead ends: 215 [2018-11-07 22:07:13,397 INFO L226 Difference]: Without dead ends: 209 [2018-11-07 22:07:13,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-11-07 22:07:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-07 22:07:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-11-07 22:07:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-07 22:07:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-11-07 22:07:13,403 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 202 [2018-11-07 22:07:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:13,403 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-11-07 22:07:13,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 22:07:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-11-07 22:07:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 22:07:13,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:13,405 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:13,405 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:13,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:13,405 INFO L82 PathProgramCache]: Analyzing trace with hash -391306611, now seen corresponding path program 48 times [2018-11-07 22:07:13,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:13,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:13,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:13,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:13,406 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:14,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:14,429 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:14,429 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:14,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:07:14,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:14,430 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 22:07:14,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:07:14,438 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Received shutdown request... [2018-11-07 22:07:17,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:07:17,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:17,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:17,691 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 22:07:17,892 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:07:17,892 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:07:17,898 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:07:17,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:07:17 BoogieIcfgContainer [2018-11-07 22:07:17,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:07:17,899 INFO L168 Benchmark]: Toolchain (without parser) took 260066.85 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -273.2 MB). Peak memory consumption was 741.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:07:17,900 INFO L168 Benchmark]: CDTParser took 0.26 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 22:07:17,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.76 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 22:07:17,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.64 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 22:07:17,901 INFO L168 Benchmark]: Boogie Preprocessor took 28.39 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 22:07:17,902 INFO L168 Benchmark]: RCFGBuilder took 570.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-07 22:07:17,902 INFO L168 Benchmark]: TraceAbstraction took 259090.22 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 261.6 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 504.5 MB). Peak memory consumption was 766.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:07:17,906 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.26 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 345.76 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 27.64 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 28.39 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 570.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 259090.22 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 261.6 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 504.5 MB). Peak memory consumption was 766.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 207 with TraceHistMax 49,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 51 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. TIMEOUT Result, 259.0s OverallTime, 50 OverallIterations, 49 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 698 SDtfs, 2352 SDslu, 10207 SDs, 0 SdLazy, 4557 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11567 GetRequests, 9169 SyntacticMatches, 0 SemanticMatches, 2398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 78.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 49 MinimizatonAttempts, 96 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 160.6s SatisfiabilityAnalysisTime, 82.0s InterpolantComputationTime, 10367 NumberOfCodeBlocks, 10367 NumberOfCodeBlocksAsserted, 503 NumberOfCheckSat, 15394 ConstructedInterpolants, 0 QuantifiedInterpolants, 5933222 SizeOfPredicates, 47 NumberOfNonLiveVariables, 7943 ConjunctsInSsa, 1222 ConjunctsInUnsatCore, 143 InterpolantComputations, 2 PerfectInterpolantSequences, 0/214320 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown