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-EXP.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:44:38,223 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:44:38,226 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:44:38,245 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:44:38,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:44:38,247 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:44:38,248 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:44:38,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:44:38,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:44:38,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:44:38,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:44:38,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:44:38,258 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:44:38,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:44:38,261 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:44:38,264 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:44:38,265 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:44:38,267 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:44:38,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:44:38,281 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:44:38,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:44:38,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:44:38,290 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:44:38,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:44:38,291 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:44:38,292 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:44:38,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:44:38,296 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:44:38,297 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:44:38,300 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:44:38,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:44:38,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:44:38,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:44:38,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:44:38,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:44:38,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:44:38,306 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:44:38,335 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:44:38,335 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:44:38,336 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:44:38,336 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:44:38,336 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:44:38,336 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:44:38,337 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:44:38,340 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:44:38,340 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:44:38,341 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:44:38,341 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:44:38,341 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:44:38,341 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:44:38,341 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:44:38,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:44:38,342 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:44:38,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:44:38,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:44:38,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:44:38,344 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:44:38,344 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:44:38,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:44:38,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:44:38,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:44:38,345 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:44:38,345 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:44:38,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:44:38,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:44:38,346 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:44:38,346 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:44:38,347 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:44:38,347 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:44:38,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:44:38,347 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:44:38,347 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:44:38,348 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:44:38,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:44:38,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:44:38,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:44:38,413 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:44:38,414 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:44:38,414 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c [2018-11-07 10:44:38,485 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce990d335/dcf44f7ef2a144268f1f2d99f098a8d5/FLAGb13516e98 [2018-11-07 10:44:38,977 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:44:38,978 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_true-unreach-call1.c [2018-11-07 10:44:38,984 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce990d335/dcf44f7ef2a144268f1f2d99f098a8d5/FLAGb13516e98 [2018-11-07 10:44:38,997 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce990d335/dcf44f7ef2a144268f1f2d99f098a8d5 [2018-11-07 10:44:39,006 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:44:39,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:44:39,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:44:39,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:44:39,013 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:44:39,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:44:38" (1/1) ... [2018-11-07 10:44:39,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d7a262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39, skipping insertion in model container [2018-11-07 10:44:39,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:44:38" (1/1) ... [2018-11-07 10:44:39,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:44:39,047 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:44:39,262 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:44:39,266 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:44:39,283 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:44:39,299 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:44:39,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39 WrapperNode [2018-11-07 10:44:39,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:44:39,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:44:39,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:44:39,301 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:44:39,312 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:44:39" (1/1) ... [2018-11-07 10:44:39,318 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:44:39" (1/1) ... [2018-11-07 10:44:39,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:44:39,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:44:39,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:44:39,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:44:39,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39" (1/1) ... [2018-11-07 10:44:39,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39" (1/1) ... [2018-11-07 10:44:39,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39" (1/1) ... [2018-11-07 10:44:39,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39" (1/1) ... [2018-11-07 10:44:39,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39" (1/1) ... [2018-11-07 10:44:39,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39" (1/1) ... [2018-11-07 10:44:39,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39" (1/1) ... [2018-11-07 10:44:39,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:44:39,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:44:39,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:44:39,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:44:39,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39" (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 10:44:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:44:39,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:44:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:44:39,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:44:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:44:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:44:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:44:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:44:39,711 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:44:39,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:39 BoogieIcfgContainer [2018-11-07 10:44:39,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:44:39,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:44:39,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:44:39,716 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:44:39,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:44:38" (1/3) ... [2018-11-07 10:44:39,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c67d618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:44:39, skipping insertion in model container [2018-11-07 10:44:39,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:39" (2/3) ... [2018-11-07 10:44:39,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c67d618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:44:39, skipping insertion in model container [2018-11-07 10:44:39,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:39" (3/3) ... [2018-11-07 10:44:39,719 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_true-unreach-call1.c [2018-11-07 10:44:39,728 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:44:39,735 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:44:39,749 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:44:39,783 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:44:39,784 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:44:39,784 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:44:39,784 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:44:39,784 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:44:39,785 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:44:39,785 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:44:39,785 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:44:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-07 10:44:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 10:44:39,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:39,811 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:39,813 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:39,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-07 10:44:39,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:39,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:39,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:39,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:39,874 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:39,932 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 10:44:39,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:44:39,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:44:39,935 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:44:39,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:44:39,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:44:39,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:44:39,958 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-07 10:44:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:39,982 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-07 10:44:39,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:44:39,983 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 10:44:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:39,991 INFO L225 Difference]: With dead ends: 30 [2018-11-07 10:44:39,992 INFO L226 Difference]: Without dead ends: 13 [2018-11-07 10:44:39,994 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 10:44:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-07 10:44:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-07 10:44:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-07 10:44:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-07 10:44:40,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-07 10:44:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:40,035 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-07 10:44:40,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:44:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-07 10:44:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 10:44:40,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:40,036 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:40,037 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:40,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-07 10:44:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:40,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:40,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:40,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:40,130 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 10:44:40,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:44:40,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:44:40,131 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:44:40,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:44:40,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:44:40,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:44:40,134 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-07 10:44:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:40,232 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-07 10:44:40,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:44:40,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 10:44:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:40,235 INFO L225 Difference]: With dead ends: 24 [2018-11-07 10:44:40,235 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 10:44:40,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:44:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 10:44:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 10:44:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 10:44:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-07 10:44:40,243 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-07 10:44:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:40,244 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-07 10:44:40,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:44:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-07 10:44:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 10:44:40,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:40,245 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:40,250 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:40,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-07 10:44:40,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:40,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:40,252 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:40,441 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 10:44:40,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:40,442 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:40,443 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-07 10:44:40,445 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 10:44:40,477 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:44:40,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:44:40,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:44:40,610 INFO L272 AbstractInterpreter]: Visited 13 different actions 21 times. Merged at 3 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-07 10:44:40,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:40,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:44:40,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:40,627 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 10:44:40,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:40,640 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:44:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:40,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:40,724 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 10:44:40,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:40,991 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 10:44:41,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:41,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 9 [2018-11-07 10:44:41,020 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:41,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:44:41,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:44:41,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:44:41,022 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2018-11-07 10:44:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:41,071 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-07 10:44:41,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:44:41,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-07 10:44:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:41,074 INFO L225 Difference]: With dead ends: 27 [2018-11-07 10:44:41,074 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 10:44:41,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:44:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 10:44:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 10:44:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 10:44:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-07 10:44:41,082 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-07 10:44:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:41,082 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-07 10:44:41,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:44:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-07 10:44:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:44:41,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:41,086 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:41,086 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:41,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-07 10:44:41,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:41,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:41,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:41,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:41,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:41,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:41,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:41,295 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:41,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:41,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:41,296 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 10:44:41,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:44:41,306 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:44:41,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 10:44:41,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:41,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:44:41,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:44:41,502 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:44:41,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 6] imperfect sequences [5] total 10 [2018-11-07 10:44:41,502 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:44:41,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:44:41,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:44:41,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:44:41,503 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-07 10:44:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:41,563 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-07 10:44:41,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:44:41,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 10:44:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:41,565 INFO L225 Difference]: With dead ends: 27 [2018-11-07 10:44:41,565 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 10:44:41,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:44:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 10:44:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 10:44:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 10:44:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-07 10:44:41,571 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2018-11-07 10:44:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:41,571 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-07 10:44:41,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:44:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-07 10:44:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 10:44:41,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:41,572 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:41,573 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:41,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1801011421, now seen corresponding path program 1 times [2018-11-07 10:44:41,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:41,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:41,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:41,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:41,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:41,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:41,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:41,823 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-07 10:44:41,824 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [26], [29], [31], [37], [38], [39], [41] [2018-11-07 10:44:41,825 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:44:41,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:44:41,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:44:41,856 INFO L272 AbstractInterpreter]: Visited 14 different actions 24 times. Merged at 3 different actions 6 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 2 variables. [2018-11-07 10:44:41,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:41,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:44:41,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:41,884 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 10:44:41,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:41,894 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:44:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:41,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:42,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:42,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:42,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2018-11-07 10:44:42,177 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:42,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:44:42,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:44:42,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:44:42,178 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-07 10:44:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:42,522 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-07 10:44:42,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:44:42,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-07 10:44:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:42,523 INFO L225 Difference]: With dead ends: 34 [2018-11-07 10:44:42,523 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 10:44:42,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:44:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 10:44:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 10:44:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 10:44:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-07 10:44:42,529 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-11-07 10:44:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:42,530 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-07 10:44:42,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:44:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-07 10:44:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:44:42,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:42,531 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:42,532 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:42,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2092450784, now seen corresponding path program 2 times [2018-11-07 10:44:42,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:42,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:42,534 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:42,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:42,687 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:42,687 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:42,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:42,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:42,688 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 10:44:42,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:44:42,698 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:44:42,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:44:42,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:42,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 10:44:42,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 10:44:42,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:42,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 7] total 14 [2018-11-07 10:44:42,955 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:42,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:44:42,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:44:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:44:42,956 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2018-11-07 10:44:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:45,420 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-07 10:44:45,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 10:44:45,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-07 10:44:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:45,422 INFO L225 Difference]: With dead ends: 44 [2018-11-07 10:44:45,422 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 10:44:45,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:44:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 10:44:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-07 10:44:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 10:44:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-07 10:44:45,429 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-11-07 10:44:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:45,429 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-07 10:44:45,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:44:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-07 10:44:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 10:44:45,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:45,430 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:45,431 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:45,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:45,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1050905282, now seen corresponding path program 3 times [2018-11-07 10:44:45,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:45,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:45,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:45,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:45,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:45,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:45,903 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:45,903 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:45,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:45,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:45,903 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 10:44:45,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:44:45,912 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:44:45,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:44:45,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:45,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:44:45,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:44:46,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:46,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2018-11-07 10:44:46,283 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:46,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 10:44:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 10:44:46,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:44:46,284 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-07 10:44:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:46,385 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-07 10:44:46,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 10:44:46,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-07 10:44:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:46,387 INFO L225 Difference]: With dead ends: 46 [2018-11-07 10:44:46,387 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 10:44:46,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:44:46,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 10:44:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-07 10:44:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 10:44:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-07 10:44:46,394 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2018-11-07 10:44:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:46,395 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-07 10:44:46,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 10:44:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-07 10:44:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 10:44:46,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:46,396 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:46,396 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:46,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:46,397 INFO L82 PathProgramCache]: Analyzing trace with hash -306121381, now seen corresponding path program 4 times [2018-11-07 10:44:46,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:46,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:46,398 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:46,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:46,787 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:46,787 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:46,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:46,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:46,788 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 10:44:46,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:46,798 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:44:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:46,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:44:46,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:44:47,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:47,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2018-11-07 10:44:47,190 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:47,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:44:47,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:44:47,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:44:47,191 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 10 states. [2018-11-07 10:44:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:47,340 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-07 10:44:47,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 10:44:47,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-07 10:44:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:47,343 INFO L225 Difference]: With dead ends: 49 [2018-11-07 10:44:47,343 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 10:44:47,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-07 10:44:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 10:44:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-07 10:44:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 10:44:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-07 10:44:47,349 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 32 [2018-11-07 10:44:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:47,349 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-07 10:44:47,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:44:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-07 10:44:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 10:44:47,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:47,351 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:47,351 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:47,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash -249977826, now seen corresponding path program 5 times [2018-11-07 10:44:47,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:47,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:47,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:47,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:47,353 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:47,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:47,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:47,564 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:47,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:47,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:47,565 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 10:44:47,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:44:47,574 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:44:47,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:44:47,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:47,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:44:47,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-07 10:44:47,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:47,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 8] total 20 [2018-11-07 10:44:47,842 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:47,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:44:47,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:44:47,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:44:47,843 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 14 states. [2018-11-07 10:44:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:48,391 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-07 10:44:48,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:44:48,392 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-07 10:44:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:48,394 INFO L225 Difference]: With dead ends: 59 [2018-11-07 10:44:48,395 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 10:44:48,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2018-11-07 10:44:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 10:44:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-07 10:44:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 10:44:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-07 10:44:48,407 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 35 [2018-11-07 10:44:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:48,407 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-07 10:44:48,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:44:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-07 10:44:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 10:44:48,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:48,410 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:48,410 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:48,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:48,411 INFO L82 PathProgramCache]: Analyzing trace with hash 607533056, now seen corresponding path program 6 times [2018-11-07 10:44:48,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:48,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:48,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:48,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:48,415 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:48,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:48,706 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:48,706 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:48,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:48,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:48,707 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 10:44:48,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:44:48,718 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:44:48,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:44:48,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:48,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:48,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:49,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:49,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2018-11-07 10:44:49,423 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:49,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 10:44:49,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 10:44:49,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:44:49,425 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2018-11-07 10:44:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:49,653 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-07 10:44:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 10:44:49,655 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-07 10:44:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:49,656 INFO L225 Difference]: With dead ends: 61 [2018-11-07 10:44:49,656 INFO L226 Difference]: Without dead ends: 45 [2018-11-07 10:44:49,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:44:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-07 10:44:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-07 10:44:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 10:44:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-07 10:44:49,664 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41 [2018-11-07 10:44:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:49,664 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-07 10:44:49,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 10:44:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-07 10:44:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 10:44:49,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:49,666 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:49,666 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:49,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:49,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1655862429, now seen corresponding path program 7 times [2018-11-07 10:44:49,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:49,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:49,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:49,668 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:49,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:49,958 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:49,958 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:49,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:49,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:49,958 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 10:44:49,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:49,967 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:44:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:49,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 10:44:50,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 10:44:50,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:50,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 24 [2018-11-07 10:44:50,787 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:50,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:44:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:44:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:44:50,789 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 14 states. [2018-11-07 10:44:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:50,998 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-07 10:44:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:44:50,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-07 10:44:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:50,999 INFO L225 Difference]: With dead ends: 64 [2018-11-07 10:44:51,000 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 10:44:51,001 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 10:44:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 10:44:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 10:44:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:44:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-07 10:44:51,008 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 44 [2018-11-07 10:44:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:51,009 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-07 10:44:51,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:44:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-11-07 10:44:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 10:44:51,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:51,010 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:51,010 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:51,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash -565963040, now seen corresponding path program 8 times [2018-11-07 10:44:51,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:51,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:51,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:51,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:51,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:51,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:51,361 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:51,361 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:51,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:51,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:51,361 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 10:44:51,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:44:51,374 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:44:51,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:44:51,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:51,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 10:44:52,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 10:44:53,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:53,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 9] total 26 [2018-11-07 10:44:53,981 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:53,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:44:53,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:44:53,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2018-11-07 10:44:53,982 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 19 states. [2018-11-07 10:45:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:09,897 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-07 10:45:09,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 10:45:09,898 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-07 10:45:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:09,900 INFO L225 Difference]: With dead ends: 74 [2018-11-07 10:45:09,900 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 10:45:09,901 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=201, Invalid=610, Unknown=1, NotChecked=0, Total=812 [2018-11-07 10:45:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 10:45:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-07 10:45:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 10:45:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 10:45:09,907 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 47 [2018-11-07 10:45:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:09,908 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 10:45:09,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:45:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 10:45:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-07 10:45:09,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:09,909 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:09,909 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:09,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash -829748866, now seen corresponding path program 9 times [2018-11-07 10:45:09,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:09,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:09,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:45:09,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:09,911 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 28 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:45:10,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:10,293 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:10,293 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:10,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:10,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:10,293 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 10:45:10,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:45:10,302 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:45:10,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:45:10,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:45:10,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:45:10,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 121 proven. 165 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:45:11,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:11,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 29 [2018-11-07 10:45:11,251 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:11,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 10:45:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 10:45:11,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-07 10:45:11,252 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 17 states. [2018-11-07 10:45:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:11,535 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-11-07 10:45:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:45:11,536 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-07 10:45:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:11,538 INFO L225 Difference]: With dead ends: 79 [2018-11-07 10:45:11,538 INFO L226 Difference]: Without dead ends: 60 [2018-11-07 10:45:11,539 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-11-07 10:45:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-07 10:45:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-07 10:45:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 10:45:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-07 10:45:11,547 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 53 [2018-11-07 10:45:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:11,547 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-07 10:45:11,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 10:45:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-07 10:45:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 10:45:11,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:11,548 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:11,549 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:11,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash 794925150, now seen corresponding path program 10 times [2018-11-07 10:45:11,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:11,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:11,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:45:11,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:11,550 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 32 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:45:11,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:11,910 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:11,910 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:11,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:11,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:11,910 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 10:45:11,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:45:11,927 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:45:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:11,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:45:12,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 10:45:13,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:13,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 33 [2018-11-07 10:45:13,093 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:13,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 10:45:13,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 10:45:13,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:45:13,094 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 19 states. [2018-11-07 10:45:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:13,493 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-07 10:45:13,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 10:45:13,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-11-07 10:45:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:13,495 INFO L225 Difference]: With dead ends: 85 [2018-11-07 10:45:13,495 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 10:45:13,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 10:45:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 10:45:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-07 10:45:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 10:45:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-07 10:45:13,510 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 59 [2018-11-07 10:45:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:13,511 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-07 10:45:13,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 10:45:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-07 10:45:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 10:45:13,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:13,513 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:13,513 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:13,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash 369721150, now seen corresponding path program 11 times [2018-11-07 10:45:13,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:13,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:13,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:45:13,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:13,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 36 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:45:13,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:13,892 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:13,892 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:13,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:13,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:13,892 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 10:45:13,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:45:13,905 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:45:13,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 10:45:13,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:45:13,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 10:45:14,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 196 proven. 26 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-07 10:45:14,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:14,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 10] total 34 [2018-11-07 10:45:14,587 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:14,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:45:14,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:45:14,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 10:45:14,588 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 26 states. [2018-11-07 10:45:17,241 WARN L179 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 10:45:26,402 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 10:45:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:29,759 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-07 10:45:29,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 10:45:29,759 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-11-07 10:45:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:29,760 INFO L225 Difference]: With dead ends: 98 [2018-11-07 10:45:29,761 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 10:45:29,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=378, Invalid=1102, Unknown=2, NotChecked=0, Total=1482 [2018-11-07 10:45:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 10:45:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-11-07 10:45:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 10:45:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-07 10:45:29,771 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 65 [2018-11-07 10:45:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:29,771 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-07 10:45:29,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:45:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-07 10:45:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 10:45:29,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:29,773 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:29,773 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:29,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash 10718589, now seen corresponding path program 12 times [2018-11-07 10:45:29,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:29,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:45:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:29,775 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:45:30,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:30,411 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:30,412 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:30,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:30,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:30,412 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 10:45:30,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:45:30,428 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:45:30,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:45:30,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:45:30,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:45:30,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 100 proven. 570 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:45:32,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:32,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 45 [2018-11-07 10:45:32,602 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:32,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 10:45:32,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 10:45:32,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:45:32,604 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 24 states. [2018-11-07 10:45:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:33,201 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-07 10:45:33,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 10:45:33,202 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-07 10:45:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:33,203 INFO L225 Difference]: With dead ends: 100 [2018-11-07 10:45:33,203 INFO L226 Difference]: Without dead ends: 78 [2018-11-07 10:45:33,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=550, Invalid=1430, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 10:45:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-07 10:45:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-07 10:45:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 10:45:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-11-07 10:45:33,212 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 74 [2018-11-07 10:45:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:33,213 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-11-07 10:45:33,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 10:45:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-11-07 10:45:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-07 10:45:33,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:33,214 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 17, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:33,215 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:33,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1880758400, now seen corresponding path program 13 times [2018-11-07 10:45:33,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:33,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:33,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:45:33,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:33,216 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:45:34,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:34,671 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:34,671 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:34,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:34,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:34,672 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 10:45:34,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:45:34,679 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:45:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:34,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 10:45:34,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 252 proven. 459 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 10:45:36,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:36,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 21] total 44 [2018-11-07 10:45:36,781 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:36,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 10:45:36,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 10:45:36,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:45:36,783 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 25 states. [2018-11-07 10:45:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:37,566 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-11-07 10:45:37,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 10:45:37,567 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-11-07 10:45:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:37,568 INFO L225 Difference]: With dead ends: 103 [2018-11-07 10:45:37,568 INFO L226 Difference]: Without dead ends: 81 [2018-11-07 10:45:37,570 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=523, Invalid=1369, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 10:45:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-07 10:45:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-07 10:45:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 10:45:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-11-07 10:45:37,577 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 77 [2018-11-07 10:45:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:37,578 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-11-07 10:45:37,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 10:45:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-07 10:45:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 10:45:37,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:37,579 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 18, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:37,579 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:37,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2078995811, now seen corresponding path program 14 times [2018-11-07 10:45:37,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:37,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:37,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:45:37,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:37,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:45:38,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:38,190 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:38,190 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:38,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:38,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:38,191 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 10:45:38,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:45:38,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:45:38,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:45:38,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:45:38,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-07 10:45:38,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 40 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-07 10:45:39,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:39,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 8, 11] total 41 [2018-11-07 10:45:39,372 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:39,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 10:45:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 10:45:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 10:45:39,373 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 32 states. [2018-11-07 10:45:42,325 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 10:45:50,028 WARN L179 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 10:45:55,305 WARN L179 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-07 10:46:23,462 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-07 10:46:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:46:23,535 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-11-07 10:46:23,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 10:46:23,535 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 80 [2018-11-07 10:46:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:46:23,536 INFO L225 Difference]: With dead ends: 114 [2018-11-07 10:46:23,536 INFO L226 Difference]: Without dead ends: 92 [2018-11-07 10:46:23,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 149 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=534, Invalid=1624, Unknown=4, NotChecked=0, Total=2162 [2018-11-07 10:46:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-07 10:46:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-11-07 10:46:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 10:46:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-11-07 10:46:23,546 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 80 [2018-11-07 10:46:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:46:23,546 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-11-07 10:46:23,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 10:46:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-07 10:46:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-07 10:46:23,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:46:23,547 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 19, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:46:23,547 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:46:23,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:46:23,547 INFO L82 PathProgramCache]: Analyzing trace with hash 59221243, now seen corresponding path program 15 times [2018-11-07 10:46:23,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:46:23,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:46:23,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:46:23,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:46:23,549 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:46:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:46:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 50 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:46:24,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:24,715 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:46:24,715 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:46:24,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:46:24,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:24,716 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 10:46:24,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:46:24,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:46:24,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:46:24,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:46:24,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:46:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:46:24,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:46:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:46:28,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:46:28,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22, 23] total 49 [2018-11-07 10:46:28,200 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:46:28,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 10:46:28,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 10:46:28,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:46:28,202 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 28 states. [2018-11-07 10:46:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:46:28,907 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-11-07 10:46:28,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 10:46:28,908 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-11-07 10:46:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:46:28,909 INFO L225 Difference]: With dead ends: 118 [2018-11-07 10:46:28,909 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 10:46:28,911 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=667, Invalid=1685, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:46:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 10:46:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-07 10:46:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-07 10:46:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-11-07 10:46:28,918 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 86 [2018-11-07 10:46:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:46:28,919 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-11-07 10:46:28,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 10:46:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-11-07 10:46:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 10:46:28,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:46:28,920 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 21, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:46:28,920 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:46:28,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:46:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1341754853, now seen corresponding path program 16 times [2018-11-07 10:46:28,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:46:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:46:28,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:46:28,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:46:28,922 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:46:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:46:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 54 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:46:29,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:29,698 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:46:29,699 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:46:29,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:46:29,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:29,699 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 10:46:29,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:46:29,710 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:46:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:46:29,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:46:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:46:30,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:46:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 374 proven. 693 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 10:46:32,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:46:32,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 25] total 53 [2018-11-07 10:46:32,202 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:46:32,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-07 10:46:32,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-07 10:46:32,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 10:46:32,204 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 30 states. [2018-11-07 10:46:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:46:33,019 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-11-07 10:46:33,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 10:46:33,019 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2018-11-07 10:46:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:46:33,020 INFO L225 Difference]: With dead ends: 124 [2018-11-07 10:46:33,021 INFO L226 Difference]: Without dead ends: 99 [2018-11-07 10:46:33,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=775, Invalid=1981, Unknown=0, NotChecked=0, Total=2756 [2018-11-07 10:46:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-07 10:46:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-07 10:46:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-07 10:46:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-11-07 10:46:33,030 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 92 [2018-11-07 10:46:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:46:33,030 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-11-07 10:46:33,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-07 10:46:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-11-07 10:46:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 10:46:33,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:46:33,031 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 23, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:46:33,032 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:46:33,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:46:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2143361221, now seen corresponding path program 17 times [2018-11-07 10:46:33,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:46:33,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:46:33,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:46:33,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:46:33,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:46:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:46:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 58 proven. 1218 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:46:34,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:34,142 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:46:34,142 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:46:34,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:46:34,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:34,142 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 10:46:34,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:46:34,151 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:47:14,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 10:47:14,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:47:15,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:47:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 10:47:15,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:47:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-07 10:47:15,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:47:15,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 9, 12] total 49 [2018-11-07 10:47:15,879 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:47:15,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 10:47:15,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 10:47:15,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=1814, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 10:47:15,881 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 39 states. [2018-11-07 10:47:25,780 WARN L179 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-07 10:47:35,929 WARN L179 SmtUtils]: Spent 4.84 s on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2018-11-07 10:48:05,239 WARN L179 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-07 10:48:18,965 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 10:48:28,836 WARN L179 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 10:48:34,491 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-07 10:48:54,775 WARN L179 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2018-11-07 10:49:00,485 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 Received shutdown request... [2018-11-07 10:49:15,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 10:49:15,221 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:49:15,224 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:49:15,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:49:15 BoogieIcfgContainer [2018-11-07 10:49:15,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:49:15,225 INFO L168 Benchmark]: Toolchain (without parser) took 276218.25 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 985.7 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -468.8 MB). Peak memory consumption was 516.8 MB. Max. memory is 7.1 GB. [2018-11-07 10:49:15,226 INFO L168 Benchmark]: CDTParser took 0.19 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 10:49:15,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.83 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 10:49:15,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.88 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 10:49:15,228 INFO L168 Benchmark]: Boogie Preprocessor took 26.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:49:15,228 INFO L168 Benchmark]: RCFGBuilder took 360.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2018-11-07 10:49:15,229 INFO L168 Benchmark]: TraceAbstraction took 275511.95 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 257.9 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 308.5 MB). Peak memory consumption was 566.4 MB. Max. memory is 7.1 GB. [2018-11-07 10:49:15,233 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.19 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 291.83 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 23.88 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 26.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 360.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 275511.95 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 257.9 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 308.5 MB). Peak memory consumption was 566.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was constructing difference of abstraction (99states) and FLOYD_HOARE automaton (currently 54 states, 39 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. TIMEOUT Result, 275.4s OverallTime, 21 OverallIterations, 30 TraceHistogramMax, 202.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 451 SDtfs, 290 SDslu, 5381 SDs, 0 SdLazy, 8643 SolverSat, 481 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 59.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2357 GetRequests, 1758 SyntacticMatches, 51 SemanticMatches, 547 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 157.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 41.4s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 1993 NumberOfCodeBlocks, 1816 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 2920 ConstructedInterpolants, 0 QuantifiedInterpolants, 1144460 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1437 ConjunctsInSsa, 419 ConjunctsInUnsatCore, 59 InterpolantComputations, 4 PerfectInterpolantSequences, 9096/22749 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown