java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:49:31,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:49:32,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:49:32,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:49:32,017 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:49:32,019 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:49:32,020 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:49:32,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:49:32,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:49:32,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:49:32,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:49:32,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:49:32,035 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:49:32,039 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:49:32,042 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:49:32,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:49:32,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:49:32,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:49:32,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:49:32,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:49:32,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:49:32,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:49:32,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:49:32,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:49:32,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:49:32,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:49:32,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:49:32,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:49:32,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:49:32,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:49:32,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:49:32,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:49:32,071 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:49:32,071 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:49:32,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:49:32,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:49:32,075 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:49:32,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:49:32,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:49:32,098 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:49:32,099 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:49:32,099 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:49:32,099 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:49:32,099 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:49:32,099 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:49:32,100 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:49:32,100 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:49:32,100 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:49:32,100 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:49:32,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:49:32,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:49:32,101 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:49:32,101 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:49:32,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:49:32,104 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:49:32,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:49:32,104 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:49:32,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:49:32,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:49:32,105 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:49:32,105 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:49:32,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:49:32,105 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:49:32,105 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:49:32,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:49:32,106 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:49:32,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:49:32,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:49:32,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:49:32,106 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:49:32,107 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:49:32,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:49:32,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:49:32,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:49:32,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:49:32,190 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:49:32,191 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c [2018-11-07 16:49:32,272 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f970ac59/175b3c744bf74095a82c2e21188966ad/FLAGe924b4a3a [2018-11-07 16:49:32,729 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:49:32,729 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c [2018-11-07 16:49:32,735 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f970ac59/175b3c744bf74095a82c2e21188966ad/FLAGe924b4a3a [2018-11-07 16:49:32,750 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f970ac59/175b3c744bf74095a82c2e21188966ad [2018-11-07 16:49:32,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:49:32,761 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:49:32,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:49:32,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:49:32,766 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:49:32,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:49:32" (1/1) ... [2018-11-07 16:49:32,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ddd7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:32, skipping insertion in model container [2018-11-07 16:49:32,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:49:32" (1/1) ... [2018-11-07 16:49:32,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:49:32,801 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:49:32,978 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:49:32,982 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:49:33,001 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:49:33,018 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:49:33,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33 WrapperNode [2018-11-07 16:49:33,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:49:33,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:49:33,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:49:33,021 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:49:33,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (1/1) ... [2018-11-07 16:49:33,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (1/1) ... [2018-11-07 16:49:33,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:49:33,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:49:33,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:49:33,045 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:49:33,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (1/1) ... [2018-11-07 16:49:33,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (1/1) ... [2018-11-07 16:49:33,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (1/1) ... [2018-11-07 16:49:33,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (1/1) ... [2018-11-07 16:49:33,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (1/1) ... [2018-11-07 16:49:33,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (1/1) ... [2018-11-07 16:49:33,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (1/1) ... [2018-11-07 16:49:33,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:49:33,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:49:33,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:49:33,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:49:33,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:49:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:49:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:49:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:49:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:49:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:49:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:49:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:49:33,188 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:49:33,378 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:49:33,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:49:33 BoogieIcfgContainer [2018-11-07 16:49:33,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:49:33,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:49:33,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:49:33,383 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:49:33,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:49:32" (1/3) ... [2018-11-07 16:49:33,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea13083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:49:33, skipping insertion in model container [2018-11-07 16:49:33,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:49:33" (2/3) ... [2018-11-07 16:49:33,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea13083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:49:33, skipping insertion in model container [2018-11-07 16:49:33,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:49:33" (3/3) ... [2018-11-07 16:49:33,387 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono5_false-unreach-call1.c [2018-11-07 16:49:33,397 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:49:33,405 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:49:33,423 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:49:33,453 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:49:33,453 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:49:33,453 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:49:33,454 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:49:33,454 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:49:33,454 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:49:33,454 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:49:33,454 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:49:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 16:49:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:49:33,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:33,482 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:33,484 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:33,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:33,491 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2018-11-07 16:49:33,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:33,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:33,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:33,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:33,541 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:33,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:49:33,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:49:33,601 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:49:33,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:49:33,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:49:33,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:49:33,620 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 16:49:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:33,641 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-07 16:49:33,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:49:33,642 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:49:33,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:33,650 INFO L225 Difference]: With dead ends: 31 [2018-11-07 16:49:33,650 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 16:49:33,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:49:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 16:49:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 16:49:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 16:49:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-07 16:49:33,689 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-07 16:49:33,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:33,690 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-07 16:49:33,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:49:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-07 16:49:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 16:49:33,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:33,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:33,692 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:33,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-07 16:49:33,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:33,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:33,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:33,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:49:33,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:49:33,945 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:49:33,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:49:33,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:49:33,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:49:33,947 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-07 16:49:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:34,056 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-07 16:49:34,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:49:34,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-07 16:49:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:34,058 INFO L225 Difference]: With dead ends: 23 [2018-11-07 16:49:34,058 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 16:49:34,059 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:49:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 16:49:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 16:49:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 16:49:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-07 16:49:34,067 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2018-11-07 16:49:34,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:34,067 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-07 16:49:34,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:49:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-07 16:49:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 16:49:34,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:34,070 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:34,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:34,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash 514987241, now seen corresponding path program 1 times [2018-11-07 16:49:34,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:34,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:34,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:34,073 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:34,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:49:34,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:49:34,191 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:49:34,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:49:34,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:49:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:49:34,193 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2018-11-07 16:49:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:34,243 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-07 16:49:34,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:49:34,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-07 16:49:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:34,245 INFO L225 Difference]: With dead ends: 31 [2018-11-07 16:49:34,245 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 16:49:34,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:49:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 16:49:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 16:49:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 16:49:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-07 16:49:34,252 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-11-07 16:49:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:34,252 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-07 16:49:34,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:49:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-07 16:49:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:49:34,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:34,254 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:34,254 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:34,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:34,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1263790289, now seen corresponding path program 1 times [2018-11-07 16:49:34,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:34,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:34,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:34,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:34,257 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:34,476 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-07 16:49:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:34,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:34,502 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:34,503 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-07 16:49:34,505 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [21], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 16:49:34,545 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:49:34,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:49:34,640 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:49:34,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:49:34,792 INFO L272 AbstractInterpreter]: Visited 15 different actions 87 times. Merged at 6 different actions 42 times. Widened at 1 different actions 4 times. Found 9 fixpoints after 4 different actions. Largest state had 5 variables. [2018-11-07 16:49:34,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:34,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:49:34,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:34,808 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:34,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:34,820 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:34,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:34,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:35,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:35,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2018-11-07 16:49:35,170 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:35,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:49:35,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:49:35,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:49:35,171 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-07 16:49:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:35,249 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-07 16:49:35,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:49:35,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 16:49:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:35,251 INFO L225 Difference]: With dead ends: 35 [2018-11-07 16:49:35,251 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 16:49:35,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:49:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 16:49:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-07 16:49:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 16:49:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-07 16:49:35,258 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2018-11-07 16:49:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:35,259 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-07 16:49:35,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:49:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-07 16:49:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:49:35,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:35,260 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:35,260 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:35,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash -375813959, now seen corresponding path program 2 times [2018-11-07 16:49:35,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:35,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:35,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:35,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:35,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:35,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:35,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:35,435 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:35,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:35,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:35,436 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:35,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:35,451 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:35,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 16:49:35,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:35,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 16:49:35,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 16:49:35,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:35,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2018-11-07 16:49:35,849 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:35,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:49:35,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:49:35,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:49:35,851 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2018-11-07 16:49:36,210 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 16:49:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:36,498 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-07 16:49:36,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:49:36,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-07 16:49:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:36,501 INFO L225 Difference]: With dead ends: 46 [2018-11-07 16:49:36,502 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 16:49:36,504 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:49:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 16:49:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-07 16:49:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 16:49:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-07 16:49:36,510 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 23 [2018-11-07 16:49:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:36,511 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-07 16:49:36,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:49:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-07 16:49:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 16:49:36,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:36,512 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:36,512 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:36,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:36,513 INFO L82 PathProgramCache]: Analyzing trace with hash 60088779, now seen corresponding path program 3 times [2018-11-07 16:49:36,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:36,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:36,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:36,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:36,515 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:36,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:36,777 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:36,777 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:36,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:36,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:36,778 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:36,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:36,792 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:36,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:36,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:36,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:36,841 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 16:49:36,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 16:49:37,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:37,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2018-11-07 16:49:37,031 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:37,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:49:37,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:49:37,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:49:37,033 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-11-07 16:49:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:37,190 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-07 16:49:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:49:37,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-07 16:49:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:37,192 INFO L225 Difference]: With dead ends: 55 [2018-11-07 16:49:37,192 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 16:49:37,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:49:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 16:49:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-07 16:49:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 16:49:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-07 16:49:37,200 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 31 [2018-11-07 16:49:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:37,200 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-07 16:49:37,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:49:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-07 16:49:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 16:49:37,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:37,202 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:37,202 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:37,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash -113592933, now seen corresponding path program 4 times [2018-11-07 16:49:37,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:37,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:37,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:37,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:37,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:37,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:37,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:37,491 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:37,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:37,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:37,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:37,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:37,508 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:37,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 40 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 16:49:37,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 40 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 16:49:37,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:37,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2018-11-07 16:49:37,870 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:37,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:49:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:49:37,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:49:37,872 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 10 states. [2018-11-07 16:49:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:38,127 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-07 16:49:38,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:49:38,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-07 16:49:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:38,136 INFO L225 Difference]: With dead ends: 63 [2018-11-07 16:49:38,136 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 16:49:38,137 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:49:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 16:49:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-07 16:49:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-07 16:49:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-07 16:49:38,143 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 39 [2018-11-07 16:49:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:38,144 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-07 16:49:38,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:49:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-07 16:49:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 16:49:38,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:38,146 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:38,146 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:38,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1492629867, now seen corresponding path program 5 times [2018-11-07 16:49:38,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:38,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:38,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:38,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:38,425 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:38,425 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:38,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:38,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:38,425 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:38,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:38,438 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:38,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:49:38,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:38,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 16:49:38,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 16:49:38,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:38,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 22 [2018-11-07 16:49:38,814 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:38,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:49:38,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:49:38,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:49:38,816 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 17 states. [2018-11-07 16:49:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:39,496 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-07 16:49:39,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:49:39,497 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-11-07 16:49:39,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:39,498 INFO L225 Difference]: With dead ends: 78 [2018-11-07 16:49:39,498 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 16:49:39,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2018-11-07 16:49:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 16:49:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-07 16:49:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-07 16:49:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-07 16:49:39,509 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 47 [2018-11-07 16:49:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:39,509 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-07 16:49:39,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:49:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-07 16:49:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 16:49:39,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:39,511 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:39,512 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:39,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash -642646683, now seen corresponding path program 6 times [2018-11-07 16:49:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:39,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:39,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:39,514 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 35 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:39,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:39,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:39,866 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:39,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:39,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:39,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:39,875 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:39,875 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:39,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:39,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:39,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 107 proven. 171 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 16:49:39,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 107 proven. 171 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 16:49:40,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:40,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 25 [2018-11-07 16:49:40,296 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:40,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:49:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:49:40,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-11-07 16:49:40,298 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 15 states. [2018-11-07 16:49:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:40,729 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-07 16:49:40,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:49:40,730 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-07 16:49:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:40,731 INFO L225 Difference]: With dead ends: 91 [2018-11-07 16:49:40,731 INFO L226 Difference]: Without dead ends: 74 [2018-11-07 16:49:40,732 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-11-07 16:49:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-07 16:49:40,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-07 16:49:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-07 16:49:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-07 16:49:40,740 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 59 [2018-11-07 16:49:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:40,741 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-07 16:49:40,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:49:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-07 16:49:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 16:49:40,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:40,743 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:40,743 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:40,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:40,744 INFO L82 PathProgramCache]: Analyzing trace with hash 733358365, now seen corresponding path program 7 times [2018-11-07 16:49:40,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:40,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:40,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:40,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 44 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:41,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:41,142 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:41,142 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:41,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 16:49:41,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:41,143 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:41,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:41,173 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:41,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 140 proven. 300 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 16:49:41,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 140 proven. 300 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 16:49:42,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:42,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 31 [2018-11-07 16:49:42,077 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:42,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:49:42,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:49:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=648, Unknown=0, NotChecked=0, Total=930 [2018-11-07 16:49:42,079 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 18 states. [2018-11-07 16:49:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:42,851 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-07 16:49:42,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:49:42,857 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-07 16:49:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:42,858 INFO L225 Difference]: With dead ends: 103 [2018-11-07 16:49:42,858 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 16:49:42,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=282, Invalid=648, Unknown=0, NotChecked=0, Total=930 [2018-11-07 16:49:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 16:49:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-11-07 16:49:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-07 16:49:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-07 16:49:42,880 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 71 [2018-11-07 16:49:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:42,880 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-07 16:49:42,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:49:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-07 16:49:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 16:49:42,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:42,884 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:42,884 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:42,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash 134119637, now seen corresponding path program 8 times [2018-11-07 16:49:42,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:42,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:42,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:42,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:42,888 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 53 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:43,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:43,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:43,904 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:43,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:43,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:43,905 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:43,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:43,916 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:43,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 16:49:43,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:43,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-07 16:49:44,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-07 16:49:44,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:44,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8, 8] total 33 [2018-11-07 16:49:44,428 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:44,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 16:49:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 16:49:44,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 16:49:44,429 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 27 states. [2018-11-07 16:49:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:46,982 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2018-11-07 16:49:46,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 16:49:46,983 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-07 16:49:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:46,985 INFO L225 Difference]: With dead ends: 122 [2018-11-07 16:49:46,985 INFO L226 Difference]: Without dead ends: 102 [2018-11-07 16:49:46,987 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:49:46,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-07 16:49:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-07 16:49:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-07 16:49:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-07 16:49:46,997 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 83 [2018-11-07 16:49:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:46,997 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-07 16:49:46,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 16:49:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-07 16:49:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 16:49:46,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:46,999 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 18, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:46,999 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:46,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:46,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1864426569, now seen corresponding path program 9 times [2018-11-07 16:49:47,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:47,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:47,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:47,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:47,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 65 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:47,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:47,735 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:47,735 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:47,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:47,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:47,735 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:47,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:49:47,743 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:49:47,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:49:47,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:47,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 281 proven. 666 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 16:49:47,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 281 proven. 666 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 16:49:49,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:49,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 44 [2018-11-07 16:49:49,054 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:49,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 16:49:49,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 16:49:49,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=1348, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:49:49,057 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 25 states. [2018-11-07 16:49:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:50,252 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-11-07 16:49:50,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-07 16:49:50,253 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-07 16:49:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:50,254 INFO L225 Difference]: With dead ends: 139 [2018-11-07 16:49:50,255 INFO L226 Difference]: Without dead ends: 118 [2018-11-07 16:49:50,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=544, Invalid=1348, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 16:49:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-07 16:49:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-11-07 16:49:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-07 16:49:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-11-07 16:49:50,265 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 99 [2018-11-07 16:49:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:50,266 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-11-07 16:49:50,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 16:49:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-11-07 16:49:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-07 16:49:50,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:50,268 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 22, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:50,268 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:50,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1480580265, now seen corresponding path program 10 times [2018-11-07 16:49:50,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:50,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:50,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:50,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:50,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 77 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:51,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:51,245 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:51,245 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:51,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:51,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:51,245 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:51,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:51,254 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:49:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:51,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 341 proven. 990 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 16:49:51,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 341 proven. 990 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 16:49:52,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:52,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 25] total 52 [2018-11-07 16:49:52,895 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:52,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-07 16:49:52,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-07 16:49:52,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=1904, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:49:52,897 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 29 states. [2018-11-07 16:49:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:54,168 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2018-11-07 16:49:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 16:49:54,171 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-07 16:49:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:54,172 INFO L225 Difference]: With dead ends: 155 [2018-11-07 16:49:54,172 INFO L226 Difference]: Without dead ends: 134 [2018-11-07 16:49:54,174 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=748, Invalid=1904, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 16:49:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-07 16:49:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-11-07 16:49:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-07 16:49:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2018-11-07 16:49:54,183 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 115 [2018-11-07 16:49:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:54,183 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2018-11-07 16:49:54,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-07 16:49:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-11-07 16:49:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 16:49:54,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:54,185 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 26, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:54,186 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:54,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash -337777929, now seen corresponding path program 11 times [2018-11-07 16:49:54,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:54,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:49:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:54,187 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:49:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 89 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:49:55,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:55,847 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:49:55,847 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:49:55,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:49:55,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:49:55,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:49:55,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:49:55,857 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:49:55,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:49:55,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:49:55,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:49:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-11-07 16:49:56,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:49:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 422 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-11-07 16:49:56,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:49:56,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9, 9] total 47 [2018-11-07 16:49:56,586 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:49:56,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 16:49:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 16:49:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2014, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 16:49:56,587 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 40 states. [2018-11-07 16:49:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:49:59,762 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2018-11-07 16:49:59,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 16:49:59,763 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 131 [2018-11-07 16:49:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:49:59,764 INFO L225 Difference]: With dead ends: 178 [2018-11-07 16:49:59,765 INFO L226 Difference]: Without dead ends: 154 [2018-11-07 16:49:59,767 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=454, Invalid=5552, Unknown=0, NotChecked=0, Total=6006 [2018-11-07 16:49:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-07 16:49:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-07 16:49:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-07 16:49:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2018-11-07 16:49:59,783 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 131 [2018-11-07 16:49:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:49:59,786 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2018-11-07 16:49:59,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 16:49:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2018-11-07 16:49:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 16:49:59,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:49:59,788 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 30, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:49:59,789 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:49:59,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:49:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash 504657089, now seen corresponding path program 12 times [2018-11-07 16:49:59,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:49:59,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:59,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:49:59,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:49:59,790 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:49:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 104 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:01,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:01,065 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:01,065 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:01,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:01,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:01,065 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:01,082 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:50:01,082 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:50:01,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:50:01,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:01,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 476 proven. 1953 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 16:50:01,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 476 proven. 1953 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 16:50:03,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:03,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 70 [2018-11-07 16:50:03,913 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:03,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 16:50:03,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 16:50:03,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1324, Invalid=3506, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 16:50:03,915 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 38 states. [2018-11-07 16:50:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:06,141 INFO L93 Difference]: Finished difference Result 199 states and 215 transitions. [2018-11-07 16:50:06,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 16:50:06,142 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-11-07 16:50:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:06,144 INFO L225 Difference]: With dead ends: 199 [2018-11-07 16:50:06,144 INFO L226 Difference]: Without dead ends: 174 [2018-11-07 16:50:06,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1324, Invalid=3506, Unknown=0, NotChecked=0, Total=4830 [2018-11-07 16:50:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-07 16:50:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-11-07 16:50:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-07 16:50:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 179 transitions. [2018-11-07 16:50:06,157 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 179 transitions. Word has length 151 [2018-11-07 16:50:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:06,158 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 179 transitions. [2018-11-07 16:50:06,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 16:50:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 179 transitions. [2018-11-07 16:50:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-07 16:50:06,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:06,160 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 35, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:06,161 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:06,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:06,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1798768713, now seen corresponding path program 13 times [2018-11-07 16:50:06,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:06,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:06,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:06,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:06,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 119 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:07,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:07,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:07,682 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:07,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:07,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:07,682 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:07,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:07,691 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:07,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 679 proven. 2485 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 16:50:07,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 679 proven. 2485 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 16:50:10,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:10,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38, 38] total 79 [2018-11-07 16:50:10,870 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:10,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 16:50:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 16:50:10,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 16:50:10,873 INFO L87 Difference]: Start difference. First operand 173 states and 179 transitions. Second operand 43 states. [2018-11-07 16:50:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:14,150 INFO L93 Difference]: Finished difference Result 219 states and 235 transitions. [2018-11-07 16:50:14,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 16:50:14,151 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 171 [2018-11-07 16:50:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:14,153 INFO L225 Difference]: With dead ends: 219 [2018-11-07 16:50:14,153 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 16:50:14,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 306 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1671, Invalid=4491, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 16:50:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 16:50:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-11-07 16:50:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-07 16:50:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 199 transitions. [2018-11-07 16:50:14,163 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 199 transitions. Word has length 171 [2018-11-07 16:50:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:14,163 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 199 transitions. [2018-11-07 16:50:14,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 16:50:14,164 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 199 transitions. [2018-11-07 16:50:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-07 16:50:14,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:14,165 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 40, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:14,165 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:14,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1502906321, now seen corresponding path program 14 times [2018-11-07 16:50:14,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:14,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:14,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:14,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:14,167 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 134 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:15,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:15,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:15,651 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:15,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:15,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:15,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:15,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:15,662 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:50:15,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 16:50:15,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:15,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 810 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 16:50:16,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 0 proven. 810 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-11-07 16:50:16,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:16,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 10, 10] total 64 [2018-11-07 16:50:16,656 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:16,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 16:50:16,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 16:50:16,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3824, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 16:50:16,658 INFO L87 Difference]: Start difference. First operand 193 states and 199 transitions. Second operand 56 states. [2018-11-07 16:50:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:23,225 INFO L93 Difference]: Finished difference Result 246 states and 264 transitions. [2018-11-07 16:50:23,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 16:50:23,225 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 191 [2018-11-07 16:50:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:23,227 INFO L225 Difference]: With dead ends: 246 [2018-11-07 16:50:23,227 INFO L226 Difference]: Without dead ends: 218 [2018-11-07 16:50:23,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=709, Invalid=11281, Unknown=0, NotChecked=0, Total=11990 [2018-11-07 16:50:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-07 16:50:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-11-07 16:50:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-07 16:50:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 224 transitions. [2018-11-07 16:50:23,239 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 224 transitions. Word has length 191 [2018-11-07 16:50:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:23,240 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 224 transitions. [2018-11-07 16:50:23,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 16:50:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 224 transitions. [2018-11-07 16:50:23,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 16:50:23,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:23,241 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 45, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:23,241 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:23,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:23,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1605843837, now seen corresponding path program 15 times [2018-11-07 16:50:23,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:23,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:23,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 152 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:24,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:24,985 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:24,985 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:24,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:24,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:24,985 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:24,994 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:50:24,994 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:50:25,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:50:25,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:25,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 1052 proven. 4095 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 16:50:25,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 1052 proven. 4095 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 16:50:30,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:30,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 48, 48] total 100 [2018-11-07 16:50:30,061 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:30,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-07 16:50:30,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-07 16:50:30,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2640, Invalid=7260, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 16:50:30,063 INFO L87 Difference]: Start difference. First operand 217 states and 224 transitions. Second operand 54 states. [2018-11-07 16:50:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:34,938 INFO L93 Difference]: Finished difference Result 271 states and 290 transitions. [2018-11-07 16:50:34,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-07 16:50:34,938 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 215 [2018-11-07 16:50:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:34,940 INFO L225 Difference]: With dead ends: 271 [2018-11-07 16:50:34,941 INFO L226 Difference]: Without dead ends: 242 [2018-11-07 16:50:34,942 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 384 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2640, Invalid=7260, Unknown=0, NotChecked=0, Total=9900 [2018-11-07 16:50:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-07 16:50:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-11-07 16:50:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-07 16:50:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 248 transitions. [2018-11-07 16:50:34,949 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 248 transitions. Word has length 215 [2018-11-07 16:50:34,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:34,950 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 248 transitions. [2018-11-07 16:50:34,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-07 16:50:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 248 transitions. [2018-11-07 16:50:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-07 16:50:34,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:34,952 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 51, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:34,952 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:34,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:34,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1571831821, now seen corresponding path program 16 times [2018-11-07 16:50:34,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:34,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:34,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:34,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:34,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 170 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:36,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:36,989 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:36,990 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:36,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:36,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:36,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:36,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:37,000 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:37,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 1190 proven. 5253 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 16:50:37,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 1190 proven. 5253 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 16:50:43,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:43,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 54, 54] total 112 [2018-11-07 16:50:43,523 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:43,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-07 16:50:43,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-07 16:50:43,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3294, Invalid=9138, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 16:50:43,526 INFO L87 Difference]: Start difference. First operand 241 states and 248 transitions. Second operand 60 states. [2018-11-07 16:50:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:49,527 INFO L93 Difference]: Finished difference Result 295 states and 314 transitions. [2018-11-07 16:50:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 16:50:49,528 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 239 [2018-11-07 16:50:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:49,531 INFO L225 Difference]: With dead ends: 295 [2018-11-07 16:50:49,531 INFO L226 Difference]: Without dead ends: 266 [2018-11-07 16:50:49,532 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 426 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3294, Invalid=9138, Unknown=0, NotChecked=0, Total=12432 [2018-11-07 16:50:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-07 16:50:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-11-07 16:50:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-07 16:50:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 272 transitions. [2018-11-07 16:50:49,541 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 272 transitions. Word has length 239 [2018-11-07 16:50:49,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:49,542 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 272 transitions. [2018-11-07 16:50:49,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-07 16:50:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 272 transitions. [2018-11-07 16:50:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-07 16:50:49,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:49,543 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 57, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:49,544 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:49,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:49,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1560843421, now seen corresponding path program 17 times [2018-11-07 16:50:49,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:49,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:49,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:49,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:49,545 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 188 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:51,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:51,740 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:51,741 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:51,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:51,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:51,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:51,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:51,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:51:22,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:51:22,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:51:22,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:51:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 0 proven. 1383 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2018-11-07 16:51:23,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:51:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 0 proven. 1383 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2018-11-07 16:51:24,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:51:24,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 11, 11] total 84 [2018-11-07 16:51:24,505 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:51:24,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-07 16:51:24,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-07 16:51:24,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=6693, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 16:51:24,507 INFO L87 Difference]: Start difference. First operand 265 states and 272 transitions. Second operand 75 states. [2018-11-07 16:51:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:51:36,878 INFO L93 Difference]: Finished difference Result 326 states and 347 transitions. [2018-11-07 16:51:36,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-07 16:51:36,879 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 263 [2018-11-07 16:51:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:51:36,881 INFO L225 Difference]: With dead ends: 326 [2018-11-07 16:51:36,882 INFO L226 Difference]: Without dead ends: 294 [2018-11-07 16:51:36,883 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1041, Invalid=20715, Unknown=0, NotChecked=0, Total=21756 [2018-11-07 16:51:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-07 16:51:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-11-07 16:51:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-07 16:51:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 301 transitions. [2018-11-07 16:51:36,893 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 301 transitions. Word has length 263 [2018-11-07 16:51:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:51:36,894 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 301 transitions. [2018-11-07 16:51:36,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-07 16:51:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 301 transitions. [2018-11-07 16:51:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-07 16:51:36,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:51:36,896 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 63, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:51:36,897 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:51:36,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:51:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1494174461, now seen corresponding path program 18 times [2018-11-07 16:51:36,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:51:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:36,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:51:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:36,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:51:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:51:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 209 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:51:40,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:40,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:51:40,362 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:51:40,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:51:40,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:51:40,363 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:51:40,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:51:40,372 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:51:40,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:51:40,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:51:40,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:51:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 1721 proven. 8001 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 16:51:40,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:51:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 1721 proven. 8001 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 16:51:50,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:51:50,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 66, 66] total 137 [2018-11-07 16:51:50,287 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:51:50,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-11-07 16:51:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-11-07 16:51:50,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4885, Invalid=13747, Unknown=0, NotChecked=0, Total=18632 [2018-11-07 16:51:50,289 INFO L87 Difference]: Start difference. First operand 293 states and 301 transitions. Second operand 73 states. [2018-11-07 16:51:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:51:59,796 INFO L93 Difference]: Finished difference Result 355 states and 377 transitions. [2018-11-07 16:51:59,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-07 16:51:59,798 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 291 [2018-11-07 16:51:59,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:51:59,800 INFO L225 Difference]: With dead ends: 355 [2018-11-07 16:51:59,800 INFO L226 Difference]: Without dead ends: 322 [2018-11-07 16:51:59,801 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 518 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=4885, Invalid=13747, Unknown=0, NotChecked=0, Total=18632 [2018-11-07 16:51:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-07 16:51:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2018-11-07 16:51:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-07 16:51:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 329 transitions. [2018-11-07 16:51:59,812 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 329 transitions. Word has length 291 [2018-11-07 16:51:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:51:59,813 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 329 transitions. [2018-11-07 16:51:59,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-11-07 16:51:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 329 transitions. [2018-11-07 16:51:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-07 16:51:59,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:51:59,815 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 70, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:51:59,816 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:51:59,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:51:59,816 INFO L82 PathProgramCache]: Analyzing trace with hash 348763733, now seen corresponding path program 19 times [2018-11-07 16:51:59,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:51:59,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:59,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:51:59,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:51:59,817 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:51:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 230 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:03,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:03,353 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:03,353 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:03,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:03,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:03,353 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:52:03,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:52:03,363 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:52:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:03,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 1910 proven. 9870 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 16:52:03,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 1910 proven. 9870 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-07 16:52:14,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:14,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 73, 73] total 151 [2018-11-07 16:52:14,565 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:14,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-11-07 16:52:14,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-11-07 16:52:14,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5914, Invalid=16736, Unknown=0, NotChecked=0, Total=22650 [2018-11-07 16:52:14,567 INFO L87 Difference]: Start difference. First operand 321 states and 329 transitions. Second operand 80 states. [2018-11-07 16:52:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:26,638 INFO L93 Difference]: Finished difference Result 383 states and 405 transitions. [2018-11-07 16:52:26,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-11-07 16:52:26,642 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 319 [2018-11-07 16:52:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:26,644 INFO L225 Difference]: With dead ends: 383 [2018-11-07 16:52:26,644 INFO L226 Difference]: Without dead ends: 350 [2018-11-07 16:52:26,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 567 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=5914, Invalid=16736, Unknown=0, NotChecked=0, Total=22650 [2018-11-07 16:52:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-07 16:52:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2018-11-07 16:52:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-11-07 16:52:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 357 transitions. [2018-11-07 16:52:26,657 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 357 transitions. Word has length 319 [2018-11-07 16:52:26,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:26,658 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 357 transitions. [2018-11-07 16:52:26,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-11-07 16:52:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 357 transitions. [2018-11-07 16:52:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-07 16:52:26,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:26,660 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 84, 77, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:52:26,660 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:26,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash -310628947, now seen corresponding path program 20 times [2018-11-07 16:52:26,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:26,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:26,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:52:26,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:26,663 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 251 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:30,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:30,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:30,493 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:30,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:30,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:30,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:52:30,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:52:30,502 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:52:34,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 16:52:34,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:52:34,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 0 proven. 2177 refuted. 0 times theorem prover too weak. 11935 trivial. 0 not checked. [2018-11-07 16:52:35,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 0 proven. 2177 refuted. 0 times theorem prover too weak. 11935 trivial. 0 not checked. [2018-11-07 16:52:36,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:36,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 12, 12] total 107 [2018-11-07 16:52:36,768 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:36,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-11-07 16:52:36,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-11-07 16:52:36,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=10981, Unknown=0, NotChecked=0, Total=11342 [2018-11-07 16:52:36,770 INFO L87 Difference]: Start difference. First operand 349 states and 357 transitions. Second operand 97 states. [2018-11-07 16:52:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:57,050 INFO L93 Difference]: Finished difference Result 418 states and 442 transitions. [2018-11-07 16:52:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-07 16:52:57,051 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 347 [2018-11-07 16:52:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:57,054 INFO L225 Difference]: With dead ends: 418 [2018-11-07 16:52:57,054 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 16:52:57,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 675 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3607 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1459, Invalid=35213, Unknown=0, NotChecked=0, Total=36672 [2018-11-07 16:52:57,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 16:52:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-11-07 16:52:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 16:52:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 390 transitions. [2018-11-07 16:52:57,069 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 390 transitions. Word has length 347 [2018-11-07 16:52:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:57,069 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 390 transitions. [2018-11-07 16:52:57,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-11-07 16:52:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 390 transitions. [2018-11-07 16:52:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-11-07 16:52:57,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:57,072 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 92, 84, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:52:57,072 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:57,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:57,073 INFO L82 PathProgramCache]: Analyzing trace with hash 234343471, now seen corresponding path program 21 times [2018-11-07 16:52:57,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:57,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:57,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:52:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:57,074 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:53:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 987 proven. 15931 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 16:53:01,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:53:01,767 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:53:01,767 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:53:01,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:53:01,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:53:01,768 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:53:01,777 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:53:01,777 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:53:01,865 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:53:01,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:53:01,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:53:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 2627 proven. 14196 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 16:53:02,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:53:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 2627 proven. 14196 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 16:53:17,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:53:17,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 87, 87] total 178 [2018-11-07 16:53:17,060 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:53:17,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-07 16:53:17,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-07 16:53:17,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8178, Invalid=23328, Unknown=0, NotChecked=0, Total=31506 [2018-11-07 16:53:17,062 INFO L87 Difference]: Start difference. First operand 381 states and 390 transitions. Second operand 93 states. [2018-11-07 16:53:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:53:31,163 INFO L93 Difference]: Finished difference Result 443 states and 466 transitions. [2018-11-07 16:53:31,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-11-07 16:53:31,164 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 379 [2018-11-07 16:53:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:53:31,168 INFO L225 Difference]: With dead ends: 443 [2018-11-07 16:53:31,168 INFO L226 Difference]: Without dead ends: 406 [2018-11-07 16:53:31,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 673 SyntacticMatches, 2 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=8178, Invalid=23328, Unknown=0, NotChecked=0, Total=31506 [2018-11-07 16:53:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-11-07 16:53:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2018-11-07 16:53:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-07 16:53:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 414 transitions. [2018-11-07 16:53:31,181 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 414 transitions. Word has length 379 [2018-11-07 16:53:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:53:31,181 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 414 transitions. [2018-11-07 16:53:31,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-07 16:53:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 414 transitions. [2018-11-07 16:53:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-11-07 16:53:31,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:53:31,184 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 98, 90, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:53:31,184 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:53:31,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:53:31,185 INFO L82 PathProgramCache]: Analyzing trace with hash -350040161, now seen corresponding path program 22 times [2018-11-07 16:53:31,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:53:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:53:31,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:53:31,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:53:31,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:53:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:53:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 1053 proven. 18145 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 16:53:36,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:53:36,763 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:53:36,763 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:53:36,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:53:36,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:53:36,763 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:53:36,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:53:36,771 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:53:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:53:36,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:53:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 2813 proven. 16290 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-07 16:53:37,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 16:53:46,252 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 16:53:46,452 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:53:46,453 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:53:46,458 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:53:46,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:53:46 BoogieIcfgContainer [2018-11-07 16:53:46,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:53:46,459 INFO L168 Benchmark]: Toolchain (without parser) took 253698.74 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 820.0 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -613.6 MB). Peak memory consumption was 206.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:53:46,460 INFO L168 Benchmark]: CDTParser took 0.24 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 16:53:46,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:53:46,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:53:46,461 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:53:46,462 INFO L168 Benchmark]: RCFGBuilder took 309.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-07 16:53:46,463 INFO L168 Benchmark]: TraceAbstraction took 253078.46 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 76.0 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 170.4 MB). Peak memory consumption was 246.5 MB. Max. memory is 7.1 GB. [2018-11-07 16:53:46,469 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 257.03 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.91 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 23.97 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 309.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253078.46 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 76.0 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 170.4 MB). Peak memory consumption was 246.5 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 analyzing trace of length 404 with TraceHistMax 99,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 156 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 253.0s OverallTime, 25 OverallIterations, 99 TraceHistogramMax, 102.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1137 SDtfs, 2329 SDslu, 51847 SDs, 0 SdLazy, 144268 SolverSat, 761 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 75.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7662 GetRequests, 6018 SyntacticMatches, 37 SemanticMatches, 1607 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7497 ImplicationChecksByTransitivity, 101.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 22 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 35.1s SatisfiabilityAnalysisTime, 96.8s InterpolantComputationTime, 6602 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 9819 ConstructedInterpolants, 0 QuantifiedInterpolants, 14239791 SizeOfPredicates, 28 NumberOfNonLiveVariables, 3479 ConjunctsInSsa, 1052 ConjunctsInUnsatCore, 66 InterpolantComputations, 3 PerfectInterpolantSequences, 72550/263636 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown