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/Problem13_label24_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:08:35,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:08:35,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:08:35,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:08:35,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:08:35,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:08:35,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:08:35,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:08:35,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:08:35,037 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:08:35,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:08:35,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:08:35,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:08:35,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:08:35,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:08:35,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:08:35,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:08:35,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:08:35,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:08:35,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:08:35,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:08:35,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:08:35,054 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:08:35,054 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:08:35,054 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:08:35,055 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:08:35,057 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:08:35,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:08:35,058 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:08:35,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:08:35,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:08:35,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:08:35,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:08:35,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:08:35,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:08:35,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:08:35,064 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-24 14:08:35,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:08:35,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:08:35,081 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:08:35,081 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:08:35,082 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:08:35,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:08:35,082 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:08:35,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:08:35,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:08:35,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:08:35,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:08:35,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:08:35,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:08:35,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:08:35,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:08:35,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:08:35,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:08:35,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:08:35,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:08:35,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:08:35,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:08:35,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:08:35,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:08:35,087 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:08:35,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:08:35,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:08:35,087 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:08:35,088 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:08:35,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:08:35,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:08:35,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:08:35,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:08:35,183 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:08:35,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label24_false-unreach-call.c [2018-10-24 14:08:35,259 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1ff740e47/10a194cdc1a44c4faaa2e6489e015c69/FLAG0bacc94ae [2018-10-24 14:08:36,088 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:08:36,089 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label24_false-unreach-call.c [2018-10-24 14:08:36,131 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1ff740e47/10a194cdc1a44c4faaa2e6489e015c69/FLAG0bacc94ae [2018-10-24 14:08:36,151 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1ff740e47/10a194cdc1a44c4faaa2e6489e015c69 [2018-10-24 14:08:36,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:08:36,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:08:36,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:08:36,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:08:36,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:08:36,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:08:36" (1/1) ... [2018-10-24 14:08:36,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7670273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:36, skipping insertion in model container [2018-10-24 14:08:36,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:08:36" (1/1) ... [2018-10-24 14:08:36,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:08:36,385 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:08:37,932 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:08:37,936 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:08:38,745 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:08:38,787 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:08:38,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38 WrapperNode [2018-10-24 14:08:38,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:08:38,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:08:38,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:08:38,789 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:08:38,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (1/1) ... [2018-10-24 14:08:38,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (1/1) ... [2018-10-24 14:08:39,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:08:39,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:08:39,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:08:39,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:08:39,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (1/1) ... [2018-10-24 14:08:39,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (1/1) ... [2018-10-24 14:08:39,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (1/1) ... [2018-10-24 14:08:39,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (1/1) ... [2018-10-24 14:08:40,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (1/1) ... [2018-10-24 14:08:40,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (1/1) ... [2018-10-24 14:08:40,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (1/1) ... [2018-10-24 14:08:40,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:08:40,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:08:40,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:08:40,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:08:40,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (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-24 14:08:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:08:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:08:40,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:08:53,187 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:08:53,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:08:53 BoogieIcfgContainer [2018-10-24 14:08:53,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:08:53,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:08:53,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:08:53,193 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:08:53,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:08:36" (1/3) ... [2018-10-24 14:08:53,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386120dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:08:53, skipping insertion in model container [2018-10-24 14:08:53,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:08:38" (2/3) ... [2018-10-24 14:08:53,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386120dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:08:53, skipping insertion in model container [2018-10-24 14:08:53,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:08:53" (3/3) ... [2018-10-24 14:08:53,197 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label24_false-unreach-call.c [2018-10-24 14:08:53,207 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:08:53,217 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:08:53,235 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:08:53,279 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:08:53,280 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:08:53,280 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:08:53,280 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:08:53,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:08:53,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:08:53,281 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:08:53,281 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:08:53,281 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:08:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-24 14:08:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-24 14:08:53,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:08:53,336 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] [2018-10-24 14:08:53,339 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:08:53,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:08:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash 808956810, now seen corresponding path program 1 times [2018-10-24 14:08:53,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:08:53,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:08:53,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:08:53,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:08:53,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:08:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:08:53,786 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-24 14:08:53,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:08:53,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:08:53,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:08:53,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:08:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:08:53,814 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-24 14:09:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:09:11,557 INFO L93 Difference]: Finished difference Result 3863 states and 7261 transitions. [2018-10-24 14:09:11,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:09:11,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-10-24 14:09:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:09:11,607 INFO L225 Difference]: With dead ends: 3863 [2018-10-24 14:09:11,607 INFO L226 Difference]: Without dead ends: 2757 [2018-10-24 14:09:11,618 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-24 14:09:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2018-10-24 14:09:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2736. [2018-10-24 14:09:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2736 states. [2018-10-24 14:09:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 4486 transitions. [2018-10-24 14:09:11,781 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 4486 transitions. Word has length 30 [2018-10-24 14:09:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:09:11,781 INFO L481 AbstractCegarLoop]: Abstraction has 2736 states and 4486 transitions. [2018-10-24 14:09:11,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:09:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 4486 transitions. [2018-10-24 14:09:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-24 14:09:11,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:09:11,788 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-10-24 14:09:11,788 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:09:11,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:09:11,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1033901677, now seen corresponding path program 1 times [2018-10-24 14:09:11,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:09:11,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:09:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:09:11,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:09:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:09:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:09:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:09:12,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:09:12,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:09:12,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:09:12,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:09:12,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:09:12,050 INFO L87 Difference]: Start difference. First operand 2736 states and 4486 transitions. Second operand 4 states. [2018-10-24 14:09:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:09:28,412 INFO L93 Difference]: Finished difference Result 10268 states and 17048 transitions. [2018-10-24 14:09:28,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:09:28,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-10-24 14:09:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:09:28,453 INFO L225 Difference]: With dead ends: 10268 [2018-10-24 14:09:28,454 INFO L226 Difference]: Without dead ends: 7534 [2018-10-24 14:09:28,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:09:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2018-10-24 14:09:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 7528. [2018-10-24 14:09:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7528 states. [2018-10-24 14:09:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7528 states to 7528 states and 11328 transitions. [2018-10-24 14:09:28,611 INFO L78 Accepts]: Start accepts. Automaton has 7528 states and 11328 transitions. Word has length 117 [2018-10-24 14:09:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:09:28,612 INFO L481 AbstractCegarLoop]: Abstraction has 7528 states and 11328 transitions. [2018-10-24 14:09:28,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:09:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 7528 states and 11328 transitions. [2018-10-24 14:09:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-24 14:09:28,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:09:28,617 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-10-24 14:09:28,617 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:09:28,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:09:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -323945332, now seen corresponding path program 1 times [2018-10-24 14:09:28,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:09:28,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:09:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:09:28,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:09:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:09:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:09:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:09:29,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:09:29,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:09:29,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:09:29,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:09:29,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:09:29,068 INFO L87 Difference]: Start difference. First operand 7528 states and 11328 transitions. Second operand 5 states. [2018-10-24 14:09:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:09:49,080 INFO L93 Difference]: Finished difference Result 36654 states and 55493 transitions. [2018-10-24 14:09:49,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:09:49,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-10-24 14:09:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:09:49,182 INFO L225 Difference]: With dead ends: 36654 [2018-10-24 14:09:49,182 INFO L226 Difference]: Without dead ends: 29128 [2018-10-24 14:09:49,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:09:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2018-10-24 14:09:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 28970. [2018-10-24 14:09:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28970 states. [2018-10-24 14:09:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28970 states to 28970 states and 40615 transitions. [2018-10-24 14:09:49,693 INFO L78 Accepts]: Start accepts. Automaton has 28970 states and 40615 transitions. Word has length 127 [2018-10-24 14:09:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:09:49,694 INFO L481 AbstractCegarLoop]: Abstraction has 28970 states and 40615 transitions. [2018-10-24 14:09:49,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:09:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 28970 states and 40615 transitions. [2018-10-24 14:09:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-24 14:09:49,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:09:49,699 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:09:49,700 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:09:49,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:09:49,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1565563409, now seen corresponding path program 1 times [2018-10-24 14:09:49,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:09:49,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:09:49,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:09:49,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:09:49,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:09:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:09:50,156 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 6 [2018-10-24 14:09:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:09:50,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:09:50,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:09:50,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:09:50,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:09:50,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:09:50,191 INFO L87 Difference]: Start difference. First operand 28970 states and 40615 transitions. Second operand 4 states. [2018-10-24 14:10:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:10:01,610 INFO L93 Difference]: Finished difference Result 86368 states and 118574 transitions. [2018-10-24 14:10:01,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:10:01,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-10-24 14:10:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:10:01,728 INFO L225 Difference]: With dead ends: 86368 [2018-10-24 14:10:01,728 INFO L226 Difference]: Without dead ends: 57400 [2018-10-24 14:10:01,770 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-24 14:10:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57400 states. [2018-10-24 14:10:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57400 to 47880. [2018-10-24 14:10:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47880 states. [2018-10-24 14:10:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47880 states to 47880 states and 61736 transitions. [2018-10-24 14:10:02,585 INFO L78 Accepts]: Start accepts. Automaton has 47880 states and 61736 transitions. Word has length 147 [2018-10-24 14:10:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:10:02,586 INFO L481 AbstractCegarLoop]: Abstraction has 47880 states and 61736 transitions. [2018-10-24 14:10:02,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:10:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 47880 states and 61736 transitions. [2018-10-24 14:10:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-24 14:10:02,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:10:02,592 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:10:02,593 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:10:02,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:10:02,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1923597236, now seen corresponding path program 1 times [2018-10-24 14:10:02,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:10:02,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:10:02,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:02,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:02,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:10:02,966 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 14:10:03,479 WARN L179 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-10-24 14:10:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 14:10:03,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:10:03,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:10:03,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:10:03,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:10:03,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:10:03,540 INFO L87 Difference]: Start difference. First operand 47880 states and 61736 transitions. Second operand 5 states. [2018-10-24 14:10:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:10:15,153 INFO L93 Difference]: Finished difference Result 143030 states and 183909 transitions. [2018-10-24 14:10:15,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:10:15,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2018-10-24 14:10:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:10:15,279 INFO L225 Difference]: With dead ends: 143030 [2018-10-24 14:10:15,280 INFO L226 Difference]: Without dead ends: 95152 [2018-10-24 14:10:15,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:10:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95152 states. [2018-10-24 14:10:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95152 to 94360. [2018-10-24 14:10:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94360 states. [2018-10-24 14:10:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94360 states to 94360 states and 115529 transitions. [2018-10-24 14:10:16,401 INFO L78 Accepts]: Start accepts. Automaton has 94360 states and 115529 transitions. Word has length 176 [2018-10-24 14:10:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:10:16,402 INFO L481 AbstractCegarLoop]: Abstraction has 94360 states and 115529 transitions. [2018-10-24 14:10:16,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:10:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 94360 states and 115529 transitions. [2018-10-24 14:10:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-24 14:10:16,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:10:16,410 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:10:16,411 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:10:16,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:10:16,411 INFO L82 PathProgramCache]: Analyzing trace with hash -465057532, now seen corresponding path program 1 times [2018-10-24 14:10:16,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:10:16,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:10:16,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:16,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:10:17,357 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:10:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:10:17,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:10:17,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:10:17,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:10:17,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:10:17,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:10:17,476 INFO L87 Difference]: Start difference. First operand 94360 states and 115529 transitions. Second operand 4 states. [2018-10-24 14:10:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:10:30,136 INFO L93 Difference]: Finished difference Result 266715 states and 330775 transitions. [2018-10-24 14:10:30,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:10:30,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 273 [2018-10-24 14:10:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:10:30,321 INFO L225 Difference]: With dead ends: 266715 [2018-10-24 14:10:30,322 INFO L226 Difference]: Without dead ends: 139949 [2018-10-24 14:10:30,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:10:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139949 states. [2018-10-24 14:10:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139949 to 132063. [2018-10-24 14:10:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132063 states. [2018-10-24 14:10:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132063 states to 132063 states and 150754 transitions. [2018-10-24 14:10:32,297 INFO L78 Accepts]: Start accepts. Automaton has 132063 states and 150754 transitions. Word has length 273 [2018-10-24 14:10:32,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:10:32,298 INFO L481 AbstractCegarLoop]: Abstraction has 132063 states and 150754 transitions. [2018-10-24 14:10:32,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:10:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 132063 states and 150754 transitions. [2018-10-24 14:10:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-24 14:10:32,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:10:32,305 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:10:32,306 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:10:32,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:10:32,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2109416440, now seen corresponding path program 1 times [2018-10-24 14:10:32,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:10:32,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:10:32,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:32,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:32,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:10:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 14:10:32,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:10:32,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:10:32,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:10:32,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:10:32,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:10:32,604 INFO L87 Difference]: Start difference. First operand 132063 states and 150754 transitions. Second operand 4 states. [2018-10-24 14:10:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:10:45,031 INFO L93 Difference]: Finished difference Result 300414 states and 344422 transitions. [2018-10-24 14:10:45,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:10:45,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2018-10-24 14:10:45,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:10:45,222 INFO L225 Difference]: With dead ends: 300414 [2018-10-24 14:10:45,222 INFO L226 Difference]: Without dead ends: 169141 [2018-10-24 14:10:45,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:10:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169141 states. [2018-10-24 14:10:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169141 to 164368. [2018-10-24 14:10:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164368 states. [2018-10-24 14:10:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164368 states to 164368 states and 182550 transitions. [2018-10-24 14:10:46,670 INFO L78 Accepts]: Start accepts. Automaton has 164368 states and 182550 transitions. Word has length 332 [2018-10-24 14:10:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:10:46,670 INFO L481 AbstractCegarLoop]: Abstraction has 164368 states and 182550 transitions. [2018-10-24 14:10:46,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:10:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 164368 states and 182550 transitions. [2018-10-24 14:10:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-24 14:10:46,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:10:46,681 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:10:46,681 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:10:46,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:10:46,682 INFO L82 PathProgramCache]: Analyzing trace with hash -127785171, now seen corresponding path program 1 times [2018-10-24 14:10:46,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:10:46,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:10:46,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:46,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:46,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:10:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-10-24 14:10:47,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:10:47,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:10:47,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:10:47,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:10:47,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:10:47,073 INFO L87 Difference]: Start difference. First operand 164368 states and 182550 transitions. Second operand 3 states. [2018-10-24 14:10:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:10:56,809 INFO L93 Difference]: Finished difference Result 327944 states and 364306 transitions. [2018-10-24 14:10:56,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:10:56,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2018-10-24 14:10:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:10:57,037 INFO L225 Difference]: With dead ends: 327944 [2018-10-24 14:10:57,037 INFO L226 Difference]: Without dead ends: 164366 [2018-10-24 14:10:57,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:10:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164366 states. [2018-10-24 14:10:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164366 to 162001. [2018-10-24 14:10:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162001 states. [2018-10-24 14:10:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162001 states to 162001 states and 175392 transitions. [2018-10-24 14:10:59,079 INFO L78 Accepts]: Start accepts. Automaton has 162001 states and 175392 transitions. Word has length 408 [2018-10-24 14:10:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:10:59,080 INFO L481 AbstractCegarLoop]: Abstraction has 162001 states and 175392 transitions. [2018-10-24 14:10:59,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:10:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 162001 states and 175392 transitions. [2018-10-24 14:10:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-24 14:10:59,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:10:59,110 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-10-24 14:10:59,110 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:10:59,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:10:59,111 INFO L82 PathProgramCache]: Analyzing trace with hash -566731383, now seen corresponding path program 1 times [2018-10-24 14:10:59,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:10:59,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:10:59,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:59,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:10:59,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:10:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:11:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-10-24 14:11:00,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:11:00,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:11:00,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:11:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:11:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:00,846 INFO L87 Difference]: Start difference. First operand 162001 states and 175392 transitions. Second operand 4 states. [2018-10-24 14:11:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:11:09,048 INFO L93 Difference]: Finished difference Result 328717 states and 356731 transitions. [2018-10-24 14:11:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:11:09,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 559 [2018-10-24 14:11:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:11:09,241 INFO L225 Difference]: With dead ends: 328717 [2018-10-24 14:11:09,241 INFO L226 Difference]: Without dead ends: 167506 [2018-10-24 14:11:09,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167506 states. [2018-10-24 14:11:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167506 to 165929. [2018-10-24 14:11:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165929 states. [2018-10-24 14:11:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165929 states to 165929 states and 179061 transitions. [2018-10-24 14:11:11,615 INFO L78 Accepts]: Start accepts. Automaton has 165929 states and 179061 transitions. Word has length 559 [2018-10-24 14:11:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:11:11,616 INFO L481 AbstractCegarLoop]: Abstraction has 165929 states and 179061 transitions. [2018-10-24 14:11:11,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:11:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 165929 states and 179061 transitions. [2018-10-24 14:11:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2018-10-24 14:11:11,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:11:11,645 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:11:11,646 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:11:11,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:11:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash -285119364, now seen corresponding path program 1 times [2018-10-24 14:11:11,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:11:11,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:11:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:11,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:11:11,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:11:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-10-24 14:11:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:11:12,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:11:12,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:11:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:11:12,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:12,328 INFO L87 Difference]: Start difference. First operand 165929 states and 179061 transitions. Second operand 4 states. [2018-10-24 14:11:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:11:24,515 INFO L93 Difference]: Finished difference Result 398960 states and 430186 transitions. [2018-10-24 14:11:24,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:11:24,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 583 [2018-10-24 14:11:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:11:24,780 INFO L225 Difference]: With dead ends: 398960 [2018-10-24 14:11:24,780 INFO L226 Difference]: Without dead ends: 233821 [2018-10-24 14:11:24,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-24 14:11:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233821 states. [2018-10-24 14:11:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233821 to 225831. [2018-10-24 14:11:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225831 states. [2018-10-24 14:11:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225831 states to 225831 states and 242862 transitions. [2018-10-24 14:11:27,835 INFO L78 Accepts]: Start accepts. Automaton has 225831 states and 242862 transitions. Word has length 583 [2018-10-24 14:11:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:11:27,835 INFO L481 AbstractCegarLoop]: Abstraction has 225831 states and 242862 transitions. [2018-10-24 14:11:27,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:11:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 225831 states and 242862 transitions. [2018-10-24 14:11:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2018-10-24 14:11:27,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:11:27,855 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 14:11:27,856 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:11:27,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:11:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1305774152, now seen corresponding path program 1 times [2018-10-24 14:11:27,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:11:27,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:11:27,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:27,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:11:27,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:11:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2018-10-24 14:11:28,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:11:28,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:11:28,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:11:28,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:11:28,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:28,670 INFO L87 Difference]: Start difference. First operand 225831 states and 242862 transitions. Second operand 4 states. [2018-10-24 14:11:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:11:39,567 INFO L93 Difference]: Finished difference Result 480810 states and 517691 transitions. [2018-10-24 14:11:39,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:11:39,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 616 [2018-10-24 14:11:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:11:39,875 INFO L225 Difference]: With dead ends: 480810 [2018-10-24 14:11:39,875 INFO L226 Difference]: Without dead ends: 255769 [2018-10-24 14:11:40,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255769 states. [2018-10-24 14:11:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255769 to 247864. [2018-10-24 14:11:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247864 states. [2018-10-24 14:11:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247864 states to 247864 states and 262912 transitions. [2018-10-24 14:11:43,763 INFO L78 Accepts]: Start accepts. Automaton has 247864 states and 262912 transitions. Word has length 616 [2018-10-24 14:11:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:11:43,764 INFO L481 AbstractCegarLoop]: Abstraction has 247864 states and 262912 transitions. [2018-10-24 14:11:43,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:11:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 247864 states and 262912 transitions. [2018-10-24 14:11:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2018-10-24 14:11:43,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:11:43,798 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2018-10-24 14:11:43,798 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:11:43,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:11:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash 527952713, now seen corresponding path program 1 times [2018-10-24 14:11:43,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:11:43,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:11:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:43,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:11:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:11:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:11:45,804 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-24 14:11:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 1175 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-10-24 14:11:46,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:11:46,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:11:46,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:11:46,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:11:46,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:11:46,232 INFO L87 Difference]: Start difference. First operand 247864 states and 262912 transitions. Second operand 4 states. [2018-10-24 14:12:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:12:00,060 INFO L93 Difference]: Finished difference Result 498867 states and 528919 transitions. [2018-10-24 14:12:00,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:12:00,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 727 [2018-10-24 14:12:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:12:00,950 INFO L225 Difference]: With dead ends: 498867 [2018-10-24 14:12:00,950 INFO L226 Difference]: Without dead ends: 249425 [2018-10-24 14:12:01,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:12:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249425 states. [2018-10-24 14:12:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249425 to 247049. [2018-10-24 14:12:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247049 states. [2018-10-24 14:12:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247049 states to 247049 states and 259437 transitions. [2018-10-24 14:12:03,971 INFO L78 Accepts]: Start accepts. Automaton has 247049 states and 259437 transitions. Word has length 727 [2018-10-24 14:12:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:12:03,972 INFO L481 AbstractCegarLoop]: Abstraction has 247049 states and 259437 transitions. [2018-10-24 14:12:03,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:12:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 247049 states and 259437 transitions. [2018-10-24 14:12:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 744 [2018-10-24 14:12:04,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:12:04,007 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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] [2018-10-24 14:12:04,007 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:12:04,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:12:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash -204234439, now seen corresponding path program 1 times [2018-10-24 14:12:04,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:12:04,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:12:04,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:04,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:12:04,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:12:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 1275 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2018-10-24 14:12:05,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:12:05,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:12:05,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:12:05,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:12:05,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:12:05,210 INFO L87 Difference]: Start difference. First operand 247049 states and 259437 transitions. Second operand 3 states. [2018-10-24 14:12:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:12:11,950 INFO L93 Difference]: Finished difference Result 490143 states and 514829 transitions. [2018-10-24 14:12:11,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:12:11,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 743 [2018-10-24 14:12:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:12:12,227 INFO L225 Difference]: With dead ends: 490143 [2018-10-24 14:12:12,228 INFO L226 Difference]: Without dead ends: 243884 [2018-10-24 14:12:12,323 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-24 14:12:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243884 states. [2018-10-24 14:12:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243884 to 241516. [2018-10-24 14:12:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241516 states. [2018-10-24 14:12:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241516 states to 241516 states and 252115 transitions. [2018-10-24 14:12:15,049 INFO L78 Accepts]: Start accepts. Automaton has 241516 states and 252115 transitions. Word has length 743 [2018-10-24 14:12:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:12:15,049 INFO L481 AbstractCegarLoop]: Abstraction has 241516 states and 252115 transitions. [2018-10-24 14:12:15,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:12:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 241516 states and 252115 transitions. [2018-10-24 14:12:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2018-10-24 14:12:15,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:12:15,085 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:12:15,086 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:12:15,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:12:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1298063105, now seen corresponding path program 1 times [2018-10-24 14:12:15,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:12:15,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:12:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:15,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:12:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:12:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:12:15,697 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 14:12:16,497 WARN L179 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-10-24 14:12:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 1267 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-10-24 14:12:17,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:12:17,819 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-24 14:12:17,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:12:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:12:18,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:12:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 1342 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-10-24 14:12:19,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:12:19,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-10-24 14:12:19,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 14:12:19,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 14:12:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-24 14:12:19,145 INFO L87 Difference]: Start difference. First operand 241516 states and 252115 transitions. Second operand 8 states. Received shutdown request... [2018-10-24 14:12:21,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:12:21,350 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:12:21,356 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:12:21,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:12:21 BoogieIcfgContainer [2018-10-24 14:12:21,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:12:21,357 INFO L168 Benchmark]: Toolchain (without parser) took 225192.53 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.1 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-24 14:12:21,358 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:12:21,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2618.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:12:21,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 963.74 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 834.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:12:21,360 INFO L168 Benchmark]: Boogie Preprocessor took 438.67 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:12:21,361 INFO L168 Benchmark]: RCFGBuilder took 12996.61 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 252.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -1.5 MB). Peak memory consumption was 617.8 MB. Max. memory is 7.1 GB. [2018-10-24 14:12:21,362 INFO L168 Benchmark]: TraceAbstraction took 208167.09 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -512.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-24 14:12:21,367 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2618.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 256.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 963.74 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 834.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 73.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 438.67 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12996.61 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 252.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -1.5 MB). Peak memory consumption was 617.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208167.09 ms. Allocated memory was 2.6 GB in the beginning and 4.6 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -512.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 99). Cancelled while BasicCegarLoop was constructing difference of abstraction (241516states) and FLOYD_HOARE automaton (currently 5 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (383 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 208.0s OverallTime, 14 OverallIterations, 7 TraceHistogramMax, 169.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11202 SDtfs, 25734 SDslu, 3303 SDs, 0 SdLazy, 61583 SolverSat, 15307 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 133.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 847 GetRequests, 797 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247864occurred in iteration=11, 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: 22.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 47737 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 6384 NumberOfCodeBlocks, 6384 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 6369 ConstructedInterpolants, 0 QuantifiedInterpolants, 10051755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 975 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 10636/10657 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown