java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:07:11,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:07:11,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:07:11,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:07:11,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:07:11,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:07:11,133 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:07:11,136 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:07:11,138 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:07:11,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:07:11,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:07:11,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:07:11,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:07:11,146 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:07:11,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:07:11,156 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:07:11,157 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:07:11,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:07:11,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:07:11,164 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:07:11,168 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:07:11,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:07:11,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:07:11,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:07:11,172 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:07:11,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:07:11,174 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:07:11,174 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:07:11,175 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:07:11,176 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:07:11,176 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:07:11,177 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:07:11,177 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:07:11,177 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:07:11,178 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:07:11,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:07:11,184 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 20:07:11,207 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:07:11,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:07:11,208 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:07:11,208 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:07:11,210 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:07:11,210 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:07:11,211 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:07:11,211 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:07:11,211 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:07:11,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:07:11,212 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:07:11,212 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:07:11,212 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:07:11,212 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:07:11,212 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:07:11,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:07:11,213 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:07:11,213 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:07:11,213 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:07:11,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:07:11,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:07:11,214 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:07:11,214 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:07:11,214 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:07:11,214 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:07:11,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:07:11,215 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:07:11,215 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:07:11,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:07:11,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:07:11,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:07:11,291 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:07:11,291 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:07:11,292 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label59_true-unreach-call.c [2018-10-26 20:07:11,364 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8b86d3880/d49d7fd75bb94ee7a8c4bc1537dd31eb/FLAGacacf8680 [2018-10-26 20:07:11,983 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:07:11,984 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label59_true-unreach-call.c [2018-10-26 20:07:12,005 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8b86d3880/d49d7fd75bb94ee7a8c4bc1537dd31eb/FLAGacacf8680 [2018-10-26 20:07:12,023 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/8b86d3880/d49d7fd75bb94ee7a8c4bc1537dd31eb [2018-10-26 20:07:12,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:07:12,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:07:12,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:07:12,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:07:12,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:07:12,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:07:12" (1/1) ... [2018-10-26 20:07:12,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c55a3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:12, skipping insertion in model container [2018-10-26 20:07:12,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:07:12" (1/1) ... [2018-10-26 20:07:12,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:07:12,151 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:07:12,910 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:07:12,916 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:07:13,224 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:07:13,249 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:07:13,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13 WrapperNode [2018-10-26 20:07:13,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:07:13,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:07:13,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:07:13,252 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:07:13,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (1/1) ... [2018-10-26 20:07:13,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (1/1) ... [2018-10-26 20:07:13,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:07:13,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:07:13,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:07:13,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:07:13,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (1/1) ... [2018-10-26 20:07:13,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (1/1) ... [2018-10-26 20:07:13,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (1/1) ... [2018-10-26 20:07:13,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (1/1) ... [2018-10-26 20:07:13,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (1/1) ... [2018-10-26 20:07:13,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (1/1) ... [2018-10-26 20:07:13,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (1/1) ... [2018-10-26 20:07:13,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:07:13,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:07:13,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:07:13,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:07:13,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 20:07:13,795 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:07:13,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:07:13,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:07:19,464 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:07:19,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:07:19 BoogieIcfgContainer [2018-10-26 20:07:19,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:07:19,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:07:19,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:07:19,473 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:07:19,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:07:12" (1/3) ... [2018-10-26 20:07:19,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddc73ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:07:19, skipping insertion in model container [2018-10-26 20:07:19,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:07:13" (2/3) ... [2018-10-26 20:07:19,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddc73ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:07:19, skipping insertion in model container [2018-10-26 20:07:19,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:07:19" (3/3) ... [2018-10-26 20:07:19,477 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label59_true-unreach-call.c [2018-10-26 20:07:19,489 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:07:19,504 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:07:19,524 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:07:19,574 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:07:19,575 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:07:19,575 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:07:19,576 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:07:19,576 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:07:19,576 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:07:19,576 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:07:19,576 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:07:19,577 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:07:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:07:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 20:07:19,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:19,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:19,641 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:19,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1588100358, now seen corresponding path program 1 times [2018-10-26 20:07:19,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:19,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:19,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:19,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:19,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:07:20,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:20,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:07:20,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:07:20,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:07:20,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:20,743 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 20:07:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:24,401 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-26 20:07:24,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:07:24,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-10-26 20:07:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:24,434 INFO L225 Difference]: With dead ends: 1089 [2018-10-26 20:07:24,434 INFO L226 Difference]: Without dead ends: 779 [2018-10-26 20:07:24,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-26 20:07:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-26 20:07:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-26 20:07:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-26 20:07:24,616 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 175 [2018-10-26 20:07:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:24,617 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-26 20:07:24,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:07:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-26 20:07:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 20:07:24,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:24,628 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:24,629 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:24,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash -439509271, now seen corresponding path program 1 times [2018-10-26 20:07:24,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:24,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:24,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:07:24,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:24,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:07:24,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:07:24,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:07:24,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:24,957 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-26 20:07:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:29,891 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-26 20:07:29,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:07:29,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-10-26 20:07:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:29,900 INFO L225 Difference]: With dead ends: 1904 [2018-10-26 20:07:29,901 INFO L226 Difference]: Without dead ends: 1391 [2018-10-26 20:07:29,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:29,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-26 20:07:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-26 20:07:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-26 20:07:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-26 20:07:29,946 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 181 [2018-10-26 20:07:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:29,946 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-26 20:07:29,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:07:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-26 20:07:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 20:07:29,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:29,955 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:29,955 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:29,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:29,956 INFO L82 PathProgramCache]: Analyzing trace with hash 980035246, now seen corresponding path program 1 times [2018-10-26 20:07:29,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:29,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:29,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:07:30,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:30,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:07:30,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:07:30,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:07:30,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:30,076 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-26 20:07:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:31,970 INFO L93 Difference]: Finished difference Result 2712 states and 4483 transitions. [2018-10-26 20:07:31,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:07:31,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-26 20:07:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:31,981 INFO L225 Difference]: With dead ends: 2712 [2018-10-26 20:07:31,981 INFO L226 Difference]: Without dead ends: 1787 [2018-10-26 20:07:31,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-10-26 20:07:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1783. [2018-10-26 20:07:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2018-10-26 20:07:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2737 transitions. [2018-10-26 20:07:32,024 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2737 transitions. Word has length 182 [2018-10-26 20:07:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:32,024 INFO L481 AbstractCegarLoop]: Abstraction has 1783 states and 2737 transitions. [2018-10-26 20:07:32,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:07:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2737 transitions. [2018-10-26 20:07:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:07:32,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:32,030 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:32,030 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:32,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash 554627611, now seen corresponding path program 1 times [2018-10-26 20:07:32,031 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:32,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:32,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:32,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:32,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:07:32,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:32,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:07:32,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:07:32,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:07:32,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:32,149 INFO L87 Difference]: Start difference. First operand 1783 states and 2737 transitions. Second operand 3 states. [2018-10-26 20:07:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:33,613 INFO L93 Difference]: Finished difference Result 5213 states and 8072 transitions. [2018-10-26 20:07:33,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:07:33,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-10-26 20:07:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:33,633 INFO L225 Difference]: With dead ends: 5213 [2018-10-26 20:07:33,633 INFO L226 Difference]: Without dead ends: 3432 [2018-10-26 20:07:33,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2018-10-26 20:07:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3415. [2018-10-26 20:07:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2018-10-26 20:07:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 5131 transitions. [2018-10-26 20:07:33,753 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 5131 transitions. Word has length 184 [2018-10-26 20:07:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:33,753 INFO L481 AbstractCegarLoop]: Abstraction has 3415 states and 5131 transitions. [2018-10-26 20:07:33,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:07:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 5131 transitions. [2018-10-26 20:07:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-26 20:07:33,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:33,763 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:33,763 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:33,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:33,764 INFO L82 PathProgramCache]: Analyzing trace with hash 785822816, now seen corresponding path program 1 times [2018-10-26 20:07:33,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:33,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:33,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:33,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:33,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:07:33,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:33,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:07:33,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:07:33,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:07:33,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:33,938 INFO L87 Difference]: Start difference. First operand 3415 states and 5131 transitions. Second operand 3 states. [2018-10-26 20:07:35,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:35,654 INFO L93 Difference]: Finished difference Result 8269 states and 12391 transitions. [2018-10-26 20:07:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:07:35,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-10-26 20:07:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:35,677 INFO L225 Difference]: With dead ends: 8269 [2018-10-26 20:07:35,677 INFO L226 Difference]: Without dead ends: 4856 [2018-10-26 20:07:35,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4856 states. [2018-10-26 20:07:35,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4856 to 4855. [2018-10-26 20:07:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4855 states. [2018-10-26 20:07:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4855 states to 4855 states and 7152 transitions. [2018-10-26 20:07:35,775 INFO L78 Accepts]: Start accepts. Automaton has 4855 states and 7152 transitions. Word has length 186 [2018-10-26 20:07:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:35,775 INFO L481 AbstractCegarLoop]: Abstraction has 4855 states and 7152 transitions. [2018-10-26 20:07:35,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:07:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4855 states and 7152 transitions. [2018-10-26 20:07:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 20:07:35,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:35,785 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:35,787 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:35,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:35,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1789823033, now seen corresponding path program 1 times [2018-10-26 20:07:35,788 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:35,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:35,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:35,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:35,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:07:36,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:36,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:07:36,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:07:36,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:07:36,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:36,060 INFO L87 Difference]: Start difference. First operand 4855 states and 7152 transitions. Second operand 3 states. [2018-10-26 20:07:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:37,312 INFO L93 Difference]: Finished difference Result 9678 states and 14272 transitions. [2018-10-26 20:07:37,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:07:37,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-10-26 20:07:37,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:37,335 INFO L225 Difference]: With dead ends: 9678 [2018-10-26 20:07:37,335 INFO L226 Difference]: Without dead ends: 4825 [2018-10-26 20:07:37,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4825 states. [2018-10-26 20:07:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4825 to 4823. [2018-10-26 20:07:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4823 states. [2018-10-26 20:07:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 6572 transitions. [2018-10-26 20:07:37,440 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 6572 transitions. Word has length 192 [2018-10-26 20:07:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:37,441 INFO L481 AbstractCegarLoop]: Abstraction has 4823 states and 6572 transitions. [2018-10-26 20:07:37,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:07:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 6572 transitions. [2018-10-26 20:07:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 20:07:37,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:37,452 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:37,452 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:37,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:37,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1668382964, now seen corresponding path program 1 times [2018-10-26 20:07:37,453 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:37,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:37,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:37,904 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-26 20:07:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:07:37,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:07:37,963 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 20:07:37,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:38,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:07:38,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:07:38,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 20:07:38,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:07:38,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:07:38,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:07:38,273 INFO L87 Difference]: Start difference. First operand 4823 states and 6572 transitions. Second operand 7 states. [2018-10-26 20:07:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:46,130 INFO L93 Difference]: Finished difference Result 20489 states and 27696 transitions. [2018-10-26 20:07:46,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:07:46,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2018-10-26 20:07:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:46,191 INFO L225 Difference]: With dead ends: 20489 [2018-10-26 20:07:46,192 INFO L226 Difference]: Without dead ends: 15668 [2018-10-26 20:07:46,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:07:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15668 states. [2018-10-26 20:07:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15668 to 14436. [2018-10-26 20:07:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14436 states. [2018-10-26 20:07:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14436 states to 14436 states and 17101 transitions. [2018-10-26 20:07:46,501 INFO L78 Accepts]: Start accepts. Automaton has 14436 states and 17101 transitions. Word has length 194 [2018-10-26 20:07:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:46,501 INFO L481 AbstractCegarLoop]: Abstraction has 14436 states and 17101 transitions. [2018-10-26 20:07:46,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:07:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 14436 states and 17101 transitions. [2018-10-26 20:07:46,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-26 20:07:46,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:46,526 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:46,526 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:46,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:46,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1899480474, now seen corresponding path program 1 times [2018-10-26 20:07:46,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:46,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:46,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:46,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:46,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:46,806 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 20:07:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 20:07:46,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:46,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:07:46,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:07:46,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:07:46,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:46,833 INFO L87 Difference]: Start difference. First operand 14436 states and 17101 transitions. Second operand 4 states. [2018-10-26 20:07:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:49,691 INFO L93 Difference]: Finished difference Result 51773 states and 60953 transitions. [2018-10-26 20:07:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:07:49,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-10-26 20:07:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:49,770 INFO L225 Difference]: With dead ends: 51773 [2018-10-26 20:07:49,770 INFO L226 Difference]: Without dead ends: 37339 [2018-10-26 20:07:49,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37339 states. [2018-10-26 20:07:50,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37339 to 25450. [2018-10-26 20:07:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25450 states. [2018-10-26 20:07:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25450 states to 25450 states and 29160 transitions. [2018-10-26 20:07:50,472 INFO L78 Accepts]: Start accepts. Automaton has 25450 states and 29160 transitions. Word has length 219 [2018-10-26 20:07:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:50,472 INFO L481 AbstractCegarLoop]: Abstraction has 25450 states and 29160 transitions. [2018-10-26 20:07:50,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:07:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 25450 states and 29160 transitions. [2018-10-26 20:07:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-26 20:07:50,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:50,508 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:50,509 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:50,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:50,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1616212620, now seen corresponding path program 1 times [2018-10-26 20:07:50,509 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:50,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:50,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:50,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 20:07:50,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:50,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:07:50,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:07:50,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:07:50,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:50,719 INFO L87 Difference]: Start difference. First operand 25450 states and 29160 transitions. Second operand 3 states. [2018-10-26 20:07:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:51,897 INFO L93 Difference]: Finished difference Result 49842 states and 57086 transitions. [2018-10-26 20:07:51,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:07:51,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2018-10-26 20:07:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:51,936 INFO L225 Difference]: With dead ends: 49842 [2018-10-26 20:07:51,937 INFO L226 Difference]: Without dead ends: 24394 [2018-10-26 20:07:51,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24394 states. [2018-10-26 20:07:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24394 to 24394. [2018-10-26 20:07:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24394 states. [2018-10-26 20:07:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24394 states to 24394 states and 27706 transitions. [2018-10-26 20:07:52,311 INFO L78 Accepts]: Start accepts. Automaton has 24394 states and 27706 transitions. Word has length 236 [2018-10-26 20:07:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:52,315 INFO L481 AbstractCegarLoop]: Abstraction has 24394 states and 27706 transitions. [2018-10-26 20:07:52,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:07:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 24394 states and 27706 transitions. [2018-10-26 20:07:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-26 20:07:52,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:52,351 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:52,351 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:52,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:52,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1412223249, now seen corresponding path program 1 times [2018-10-26 20:07:52,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:52,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:52,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:52,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:52,821 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 20:07:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 20:07:52,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:52,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:07:52,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:07:52,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:07:52,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:07:52,860 INFO L87 Difference]: Start difference. First operand 24394 states and 27706 transitions. Second operand 5 states. [2018-10-26 20:07:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:55,688 INFO L93 Difference]: Finished difference Result 72579 states and 82679 transitions. [2018-10-26 20:07:55,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:07:55,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 270 [2018-10-26 20:07:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:55,748 INFO L225 Difference]: With dead ends: 72579 [2018-10-26 20:07:55,748 INFO L226 Difference]: Without dead ends: 48187 [2018-10-26 20:07:56,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:07:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48187 states. [2018-10-26 20:07:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48187 to 42840. [2018-10-26 20:07:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42840 states. [2018-10-26 20:07:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42840 states to 42840 states and 48640 transitions. [2018-10-26 20:07:56,686 INFO L78 Accepts]: Start accepts. Automaton has 42840 states and 48640 transitions. Word has length 270 [2018-10-26 20:07:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:56,686 INFO L481 AbstractCegarLoop]: Abstraction has 42840 states and 48640 transitions. [2018-10-26 20:07:56,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:07:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 42840 states and 48640 transitions. [2018-10-26 20:07:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-26 20:07:56,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:56,708 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:56,708 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:56,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash 509848481, now seen corresponding path program 1 times [2018-10-26 20:07:56,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:56,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:56,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:56,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:56,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 20:07:56,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:56,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:07:56,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:07:56,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:07:56,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:56,920 INFO L87 Difference]: Start difference. First operand 42840 states and 48640 transitions. Second operand 3 states. [2018-10-26 20:07:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:57,964 INFO L93 Difference]: Finished difference Result 85674 states and 97274 transitions. [2018-10-26 20:07:57,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:07:57,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-10-26 20:07:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:58,010 INFO L225 Difference]: With dead ends: 85674 [2018-10-26 20:07:58,010 INFO L226 Difference]: Without dead ends: 42836 [2018-10-26 20:07:58,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42836 states. [2018-10-26 20:07:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42836 to 42836. [2018-10-26 20:07:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42836 states. [2018-10-26 20:07:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42836 states to 42836 states and 48632 transitions. [2018-10-26 20:07:58,508 INFO L78 Accepts]: Start accepts. Automaton has 42836 states and 48632 transitions. Word has length 279 [2018-10-26 20:07:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:58,508 INFO L481 AbstractCegarLoop]: Abstraction has 42836 states and 48632 transitions. [2018-10-26 20:07:58,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:07:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 42836 states and 48632 transitions. [2018-10-26 20:07:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-26 20:07:58,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:58,527 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:58,527 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:58,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash 650014746, now seen corresponding path program 1 times [2018-10-26 20:07:58,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:07:58,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:07:58,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:58,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:58,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:07:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:07:58,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:58,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:07:58,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:07:58,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:07:58,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:07:58,828 INFO L87 Difference]: Start difference. First operand 42836 states and 48632 transitions. Second operand 5 states. [2018-10-26 20:08:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:02,930 INFO L93 Difference]: Finished difference Result 207589 states and 235657 transitions. [2018-10-26 20:08:02,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:08:02,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 285 [2018-10-26 20:08:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:03,122 INFO L225 Difference]: With dead ends: 207589 [2018-10-26 20:08:03,122 INFO L226 Difference]: Without dead ends: 164755 [2018-10-26 20:08:03,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:08:03,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164755 states. [2018-10-26 20:08:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164755 to 122331. [2018-10-26 20:08:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122331 states. [2018-10-26 20:08:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122331 states to 122331 states and 138707 transitions. [2018-10-26 20:08:05,700 INFO L78 Accepts]: Start accepts. Automaton has 122331 states and 138707 transitions. Word has length 285 [2018-10-26 20:08:05,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:05,700 INFO L481 AbstractCegarLoop]: Abstraction has 122331 states and 138707 transitions. [2018-10-26 20:08:05,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:08:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 122331 states and 138707 transitions. [2018-10-26 20:08:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-26 20:08:05,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:05,716 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:08:05,716 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:05,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:05,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1770193357, now seen corresponding path program 1 times [2018-10-26 20:08:05,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:08:05,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:08:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:08:05,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:08:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:08:05,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:05,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:08:05,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:08:05,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:08:05,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:08:05,926 INFO L87 Difference]: Start difference. First operand 122331 states and 138707 transitions. Second operand 3 states. [2018-10-26 20:08:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:08,110 INFO L93 Difference]: Finished difference Result 243026 states and 275594 transitions. [2018-10-26 20:08:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:08:08,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2018-10-26 20:08:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:08,253 INFO L225 Difference]: With dead ends: 243026 [2018-10-26 20:08:08,254 INFO L226 Difference]: Without dead ends: 120697 [2018-10-26 20:08:08,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:08:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120697 states. [2018-10-26 20:08:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120697 to 120691. [2018-10-26 20:08:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120691 states. [2018-10-26 20:08:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120691 states to 120691 states and 133343 transitions. [2018-10-26 20:08:10,745 INFO L78 Accepts]: Start accepts. Automaton has 120691 states and 133343 transitions. Word has length 288 [2018-10-26 20:08:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:10,745 INFO L481 AbstractCegarLoop]: Abstraction has 120691 states and 133343 transitions. [2018-10-26 20:08:10,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:08:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 120691 states and 133343 transitions. [2018-10-26 20:08:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-10-26 20:08:10,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:10,776 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:08:10,776 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:10,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1453785929, now seen corresponding path program 1 times [2018-10-26 20:08:10,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:08:10,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:08:10,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:08:10,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:10,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:08:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-26 20:08:11,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:11,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:08:11,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:11,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:11,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:11,166 INFO L87 Difference]: Start difference. First operand 120691 states and 133343 transitions. Second operand 4 states. [2018-10-26 20:08:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:15,305 INFO L93 Difference]: Finished difference Result 244676 states and 270749 transitions. [2018-10-26 20:08:15,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:15,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2018-10-26 20:08:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:15,492 INFO L225 Difference]: With dead ends: 244676 [2018-10-26 20:08:15,492 INFO L226 Difference]: Without dead ends: 123987 [2018-10-26 20:08:15,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:15,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123987 states. [2018-10-26 20:08:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123987 to 123958. [2018-10-26 20:08:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123958 states. [2018-10-26 20:08:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123958 states to 123958 states and 136111 transitions. [2018-10-26 20:08:17,169 INFO L78 Accepts]: Start accepts. Automaton has 123958 states and 136111 transitions. Word has length 357 [2018-10-26 20:08:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:17,169 INFO L481 AbstractCegarLoop]: Abstraction has 123958 states and 136111 transitions. [2018-10-26 20:08:17,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 123958 states and 136111 transitions. [2018-10-26 20:08:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-26 20:08:17,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:17,217 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:08:17,217 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:17,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1200294787, now seen corresponding path program 1 times [2018-10-26 20:08:17,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:08:17,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:08:17,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:08:17,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:17,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:08:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 20:08:18,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:18,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:08:18,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:08:18,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:08:18,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:08:18,701 INFO L87 Difference]: Start difference. First operand 123958 states and 136111 transitions. Second operand 3 states. [2018-10-26 20:08:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:20,939 INFO L93 Difference]: Finished difference Result 340325 states and 372669 transitions. [2018-10-26 20:08:20,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:08:20,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 407 [2018-10-26 20:08:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:21,214 INFO L225 Difference]: With dead ends: 340325 [2018-10-26 20:08:21,214 INFO L226 Difference]: Without dead ends: 216369 [2018-10-26 20:08:21,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:08:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216369 states. [2018-10-26 20:08:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216369 to 216369. [2018-10-26 20:08:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216369 states. [2018-10-26 20:08:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216369 states to 216369 states and 235230 transitions. [2018-10-26 20:08:24,857 INFO L78 Accepts]: Start accepts. Automaton has 216369 states and 235230 transitions. Word has length 407 [2018-10-26 20:08:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:24,858 INFO L481 AbstractCegarLoop]: Abstraction has 216369 states and 235230 transitions. [2018-10-26 20:08:24,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:08:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 216369 states and 235230 transitions. [2018-10-26 20:08:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-26 20:08:24,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:24,897 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:08:24,897 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:24,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash -702187967, now seen corresponding path program 1 times [2018-10-26 20:08:24,897 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:08:24,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:08:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:08:24,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:24,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:08:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:25,413 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 20:08:25,637 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 20:08:25,856 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 20:08:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 312 proven. 29 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 20:08:26,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:08:26,475 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-26 20:08:26,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:26,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 231 proven. 90 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-26 20:08:26,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:08:26,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-10-26 20:08:26,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 20:08:26,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 20:08:26,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:08:26,950 INFO L87 Difference]: Start difference. First operand 216369 states and 235230 transitions. Second operand 12 states. [2018-10-26 20:08:27,224 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 20:08:27,602 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:08:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:55,999 INFO L93 Difference]: Finished difference Result 1808637 states and 1955855 transitions. [2018-10-26 20:08:55,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-26 20:08:55,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 409 [2018-10-26 20:08:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:57,960 INFO L225 Difference]: With dead ends: 1808637 [2018-10-26 20:08:57,961 INFO L226 Difference]: Without dead ends: 1592264 [2018-10-26 20:08:58,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 407 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 20:08:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592264 states. [2018-10-26 20:09:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592264 to 1374545. [2018-10-26 20:09:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374545 states. [2018-10-26 20:09:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374545 states to 1374545 states and 1487018 transitions. [2018-10-26 20:09:37,259 INFO L78 Accepts]: Start accepts. Automaton has 1374545 states and 1487018 transitions. Word has length 409 [2018-10-26 20:09:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:37,259 INFO L481 AbstractCegarLoop]: Abstraction has 1374545 states and 1487018 transitions. [2018-10-26 20:09:37,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 20:09:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1374545 states and 1487018 transitions. [2018-10-26 20:09:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-10-26 20:09:37,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:37,375 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:09:37,376 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:37,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:37,376 INFO L82 PathProgramCache]: Analyzing trace with hash -197966188, now seen corresponding path program 1 times [2018-10-26 20:09:37,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:09:37,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:09:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:09:37,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:09:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-10-26 20:09:37,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:09:37,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:09:37,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:09:37,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:09:37,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:09:37,645 INFO L87 Difference]: Start difference. First operand 1374545 states and 1487018 transitions. Second operand 3 states. [2018-10-26 20:10:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:10:12,192 INFO L93 Difference]: Finished difference Result 3284728 states and 3542415 transitions. [2018-10-26 20:10:12,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:10:12,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2018-10-26 20:10:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:10:15,191 INFO L225 Difference]: With dead ends: 3284728 [2018-10-26 20:10:15,192 INFO L226 Difference]: Without dead ends: 1910185 [2018-10-26 20:10:17,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:10:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910185 states. Received shutdown request... [2018-10-26 20:10:31,954 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:10:31,958 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:10:31,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:10:31 BoogieIcfgContainer [2018-10-26 20:10:31,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:10:31,960 INFO L168 Benchmark]: Toolchain (without parser) took 199923.11 ms. Allocated memory was 1.5 GB in the beginning and 7.3 GB in the end (delta: 5.8 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -954.0 MB). Peak memory consumption was 5.9 GB. Max. memory is 7.1 GB. [2018-10-26 20:10:31,961 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:10:31,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1211.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2018-10-26 20:10:31,962 INFO L168 Benchmark]: Boogie Procedure Inliner took 330.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -876.5 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-26 20:10:31,963 INFO L168 Benchmark]: Boogie Preprocessor took 139.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-26 20:10:31,964 INFO L168 Benchmark]: RCFGBuilder took 5744.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 272.1 MB). Peak memory consumption was 272.1 MB. Max. memory is 7.1 GB. [2018-10-26 20:10:31,965 INFO L168 Benchmark]: TraceAbstraction took 192491.24 ms. Allocated memory was 2.3 GB in the beginning and 7.3 GB in the end (delta: 5.0 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -451.6 MB). Peak memory consumption was 5.7 GB. Max. memory is 7.1 GB. [2018-10-26 20:10:31,970 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1211.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 330.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -876.5 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.93 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5744.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 272.1 MB). Peak memory consumption was 272.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192491.24 ms. Allocated memory was 2.3 GB in the beginning and 7.3 GB in the end (delta: 5.0 GB). Free memory was 1.9 GB in the beginning and 2.4 GB in the end (delta: -451.6 MB). Peak memory consumption was 5.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1557]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1557). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 192.3s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 116.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4355 SDtfs, 16476 SDslu, 3459 SDs, 0 SdLazy, 25515 SolverSat, 4761 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 620 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1374545occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 66.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 279398 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 5108 NumberOfCodeBlocks, 5108 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5089 ConstructedInterpolants, 0 QuantifiedInterpolants, 4416578 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1078 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 2681/2804 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown