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_label21_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:57:10,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:57:10,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:57:10,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:57:10,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:57:10,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:57:10,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:57:10,478 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:57:10,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:57:10,487 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:57:10,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:57:10,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:57:10,491 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:57:10,492 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:57:10,493 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:57:10,494 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:57:10,497 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:57:10,498 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:57:10,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:57:10,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:57:10,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:57:10,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:57:10,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:57:10,513 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:57:10,513 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:57:10,514 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:57:10,515 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:57:10,515 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:57:10,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:57:10,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:57:10,519 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:57:10,520 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:57:10,520 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:57:10,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:57:10,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:57:10,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:57:10,523 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:57:10,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:57:10,550 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:57:10,551 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:57:10,551 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:57:10,552 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:57:10,552 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:57:10,552 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:57:10,552 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:57:10,553 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:57:10,554 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:57:10,554 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:57:10,554 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:57:10,554 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:57:10,554 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:57:10,555 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:57:10,555 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:57:10,555 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:57:10,555 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:57:10,555 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:57:10,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:57:10,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:57:10,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:57:10,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:57:10,557 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:57:10,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:57:10,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:57:10,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:57:10,558 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:57:10,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:57:10,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:57:10,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:57:10,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:57:10,644 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:57:10,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label21_true-unreach-call.c [2018-10-24 14:57:10,715 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dd7d90a1c/0395962f65b34dfdbdab7633ed439edd/FLAG69d621467 [2018-10-24 14:57:11,432 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:57:11,436 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label21_true-unreach-call.c [2018-10-24 14:57:11,459 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dd7d90a1c/0395962f65b34dfdbdab7633ed439edd/FLAG69d621467 [2018-10-24 14:57:11,475 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dd7d90a1c/0395962f65b34dfdbdab7633ed439edd [2018-10-24 14:57:11,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:57:11,485 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:57:11,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:11,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:57:11,491 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:57:11,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:11" (1/1) ... [2018-10-24 14:57:11,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@618e506f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:11, skipping insertion in model container [2018-10-24 14:57:11,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:11" (1/1) ... [2018-10-24 14:57:11,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:57:11,604 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:57:12,254 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:12,260 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:57:12,657 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:12,679 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:57:12,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:12 WrapperNode [2018-10-24 14:57:12,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:12,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:12,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:57:12,682 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:57:12,692 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:57:12" (1/1) ... [2018-10-24 14:57:12,747 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:57:12" (1/1) ... [2018-10-24 14:57:13,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:13,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:57:13,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:57:13,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:57:13,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:12" (1/1) ... [2018-10-24 14:57:13,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:12" (1/1) ... [2018-10-24 14:57:13,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:12" (1/1) ... [2018-10-24 14:57:13,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:12" (1/1) ... [2018-10-24 14:57:13,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:12" (1/1) ... [2018-10-24 14:57:13,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:12" (1/1) ... [2018-10-24 14:57:13,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:12" (1/1) ... [2018-10-24 14:57:13,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:57:13,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:57:13,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:57:13,200 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:57:13,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:12" (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:57:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:57:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:57:13,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:57:18,939 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:57:18,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:18 BoogieIcfgContainer [2018-10-24 14:57:18,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:57:18,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:57:18,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:57:18,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:57:18,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:57:11" (1/3) ... [2018-10-24 14:57:18,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687fac15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:18, skipping insertion in model container [2018-10-24 14:57:18,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:12" (2/3) ... [2018-10-24 14:57:18,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687fac15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:18, skipping insertion in model container [2018-10-24 14:57:18,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:18" (3/3) ... [2018-10-24 14:57:18,949 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label21_true-unreach-call.c [2018-10-24 14:57:18,958 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:57:18,967 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:57:18,984 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:57:19,024 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:57:19,025 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:57:19,025 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:57:19,025 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:57:19,025 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:57:19,025 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:57:19,025 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:57:19,026 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:57:19,026 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:57:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:57:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-24 14:57:19,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:19,073 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, 1, 1, 1, 1, 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:57:19,076 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:19,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1515972374, now seen corresponding path program 1 times [2018-10-24 14:57:19,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:19,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:19,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:19,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:19,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:20,040 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:57:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:20,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:20,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:20,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:20,068 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:57:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:23,784 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-24 14:57:23,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:23,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-10-24 14:57:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:23,814 INFO L225 Difference]: With dead ends: 1027 [2018-10-24 14:57:23,814 INFO L226 Difference]: Without dead ends: 717 [2018-10-24 14:57:23,819 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:57:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-24 14:57:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-24 14:57:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-24 14:57:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-24 14:57:23,922 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 203 [2018-10-24 14:57:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:23,923 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-24 14:57:23,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-24 14:57:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-24 14:57:23,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:23,941 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, 1, 1, 1, 1, 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:57:23,942 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:23,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:23,942 INFO L82 PathProgramCache]: Analyzing trace with hash -197428085, now seen corresponding path program 1 times [2018-10-24 14:57:23,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:23,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:23,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:23,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:24,090 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-24 14:57:24,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:24,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:24,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:24,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:24,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:24,093 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-24 14:57:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:25,907 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-24 14:57:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:25,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-10-24 14:57:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:25,916 INFO L225 Difference]: With dead ends: 2058 [2018-10-24 14:57:25,916 INFO L226 Difference]: Without dead ends: 1345 [2018-10-24 14:57:25,920 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-24 14:57:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-24 14:57:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-24 14:57:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-24 14:57:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-24 14:57:25,955 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 212 [2018-10-24 14:57:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:25,955 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-24 14:57:25,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-24 14:57:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-24 14:57:25,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:25,961 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 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:57:25,962 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:25,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash -472348186, now seen corresponding path program 1 times [2018-10-24 14:57:25,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:25,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:25,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:25,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:25,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 14:57:26,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:26,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:26,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:26,103 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-24 14:57:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:28,522 INFO L93 Difference]: Finished difference Result 3977 states and 6209 transitions. [2018-10-24 14:57:28,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:28,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2018-10-24 14:57:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:28,538 INFO L225 Difference]: With dead ends: 3977 [2018-10-24 14:57:28,538 INFO L226 Difference]: Without dead ends: 2648 [2018-10-24 14:57:28,541 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-24 14:57:28,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-10-24 14:57:28,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2645. [2018-10-24 14:57:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-10-24 14:57:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4120 transitions. [2018-10-24 14:57:28,609 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4120 transitions. Word has length 226 [2018-10-24 14:57:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:28,609 INFO L481 AbstractCegarLoop]: Abstraction has 2645 states and 4120 transitions. [2018-10-24 14:57:28,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4120 transitions. [2018-10-24 14:57:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-24 14:57:28,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:28,618 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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, 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:57:28,618 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:28,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:28,619 INFO L82 PathProgramCache]: Analyzing trace with hash -494435718, now seen corresponding path program 1 times [2018-10-24 14:57:28,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:28,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:28,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:28,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 14:57:28,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:28,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:28,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:28,798 INFO L87 Difference]: Start difference. First operand 2645 states and 4120 transitions. Second operand 3 states. [2018-10-24 14:57:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:29,587 INFO L93 Difference]: Finished difference Result 5250 states and 8186 transitions. [2018-10-24 14:57:29,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:29,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2018-10-24 14:57:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:29,608 INFO L225 Difference]: With dead ends: 5250 [2018-10-24 14:57:29,608 INFO L226 Difference]: Without dead ends: 2607 [2018-10-24 14:57:29,612 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-24 14:57:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2018-10-24 14:57:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2607. [2018-10-24 14:57:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2018-10-24 14:57:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3992 transitions. [2018-10-24 14:57:29,673 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3992 transitions. Word has length 234 [2018-10-24 14:57:29,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:29,673 INFO L481 AbstractCegarLoop]: Abstraction has 2607 states and 3992 transitions. [2018-10-24 14:57:29,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3992 transitions. [2018-10-24 14:57:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-24 14:57:29,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:29,682 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:29,682 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:29,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1318050450, now seen corresponding path program 1 times [2018-10-24 14:57:29,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:29,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:29,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:29,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:29,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:30,185 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:57:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:30,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:30,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:57:30,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:57:30,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:57:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:30,260 INFO L87 Difference]: Start difference. First operand 2607 states and 3992 transitions. Second operand 5 states. [2018-10-24 14:57:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:34,443 INFO L93 Difference]: Finished difference Result 6279 states and 9778 transitions. [2018-10-24 14:57:34,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:57:34,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2018-10-24 14:57:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:34,463 INFO L225 Difference]: With dead ends: 6279 [2018-10-24 14:57:34,463 INFO L226 Difference]: Without dead ends: 3674 [2018-10-24 14:57:34,467 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-24 14:57:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2018-10-24 14:57:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3015. [2018-10-24 14:57:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3015 states. [2018-10-24 14:57:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 4612 transitions. [2018-10-24 14:57:34,536 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 4612 transitions. Word has length 243 [2018-10-24 14:57:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:34,536 INFO L481 AbstractCegarLoop]: Abstraction has 3015 states and 4612 transitions. [2018-10-24 14:57:34,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:57:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 4612 transitions. [2018-10-24 14:57:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-24 14:57:34,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:34,546 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:34,546 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:34,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:34,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1744395106, now seen corresponding path program 1 times [2018-10-24 14:57:34,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:34,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:34,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:34,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:34,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:34,878 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:57:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-24 14:57:34,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:57:34,933 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:57:34,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:35,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:57:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-24 14:57:35,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:57:35,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-24 14:57:35,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:35,234 INFO L87 Difference]: Start difference. First operand 3015 states and 4612 transitions. Second operand 4 states. [2018-10-24 14:57:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:38,351 INFO L93 Difference]: Finished difference Result 12048 states and 18435 transitions. [2018-10-24 14:57:38,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:38,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2018-10-24 14:57:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:38,397 INFO L225 Difference]: With dead ends: 12048 [2018-10-24 14:57:38,397 INFO L226 Difference]: Without dead ends: 9035 [2018-10-24 14:57:38,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 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:57:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9035 states. [2018-10-24 14:57:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9035 to 6022. [2018-10-24 14:57:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2018-10-24 14:57:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 9192 transitions. [2018-10-24 14:57:38,560 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 9192 transitions. Word has length 279 [2018-10-24 14:57:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:38,560 INFO L481 AbstractCegarLoop]: Abstraction has 6022 states and 9192 transitions. [2018-10-24 14:57:38,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 9192 transitions. [2018-10-24 14:57:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-24 14:57:38,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:38,572 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:38,573 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:38,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:38,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1003075031, now seen corresponding path program 1 times [2018-10-24 14:57:38,573 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:38,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:38,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:38,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:38,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:38,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:38,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:38,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:38,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:38,838 INFO L87 Difference]: Start difference. First operand 6022 states and 9192 transitions. Second operand 3 states. [2018-10-24 14:57:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:40,769 INFO L93 Difference]: Finished difference Result 17361 states and 26560 transitions. [2018-10-24 14:57:40,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:40,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-10-24 14:57:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:40,816 INFO L225 Difference]: With dead ends: 17361 [2018-10-24 14:57:40,817 INFO L226 Difference]: Without dead ends: 11341 [2018-10-24 14:57:40,828 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:57:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11341 states. [2018-10-24 14:57:40,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11341 to 11337. [2018-10-24 14:57:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11337 states. [2018-10-24 14:57:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11337 states to 11337 states and 15999 transitions. [2018-10-24 14:57:41,008 INFO L78 Accepts]: Start accepts. Automaton has 11337 states and 15999 transitions. Word has length 279 [2018-10-24 14:57:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:41,008 INFO L481 AbstractCegarLoop]: Abstraction has 11337 states and 15999 transitions. [2018-10-24 14:57:41,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 11337 states and 15999 transitions. [2018-10-24 14:57:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-24 14:57:41,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:41,028 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:41,028 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:41,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:41,028 INFO L82 PathProgramCache]: Analyzing trace with hash 949743912, now seen corresponding path program 1 times [2018-10-24 14:57:41,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:41,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:41,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:41,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:41,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:41,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:41,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:41,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:41,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:41,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:41,260 INFO L87 Difference]: Start difference. First operand 11337 states and 15999 transitions. Second operand 4 states. [2018-10-24 14:57:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:44,132 INFO L93 Difference]: Finished difference Result 41586 states and 58258 transitions. [2018-10-24 14:57:44,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:44,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2018-10-24 14:57:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:44,210 INFO L225 Difference]: With dead ends: 41586 [2018-10-24 14:57:44,210 INFO L226 Difference]: Without dead ends: 30251 [2018-10-24 14:57:44,233 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:57:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30251 states. [2018-10-24 14:57:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30251 to 21129. [2018-10-24 14:57:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-24 14:57:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 28285 transitions. [2018-10-24 14:57:44,586 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 28285 transitions. Word has length 282 [2018-10-24 14:57:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:44,587 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 28285 transitions. [2018-10-24 14:57:44,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 28285 transitions. [2018-10-24 14:57:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-24 14:57:44,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:44,621 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:44,621 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:44,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1216779258, now seen corresponding path program 1 times [2018-10-24 14:57:44,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:44,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:44,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:44,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:44,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-24 14:57:44,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:44,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:44,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:44,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:44,781 INFO L87 Difference]: Start difference. First operand 21129 states and 28285 transitions. Second operand 3 states. [2018-10-24 14:57:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:46,341 INFO L93 Difference]: Finished difference Result 42264 states and 56582 transitions. [2018-10-24 14:57:46,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:46,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-10-24 14:57:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:46,381 INFO L225 Difference]: With dead ends: 42264 [2018-10-24 14:57:46,381 INFO L226 Difference]: Without dead ends: 21137 [2018-10-24 14:57:46,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2018-10-24 14:57:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 21129. [2018-10-24 14:57:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-10-24 14:57:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 25984 transitions. [2018-10-24 14:57:46,680 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 25984 transitions. Word has length 289 [2018-10-24 14:57:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:46,680 INFO L481 AbstractCegarLoop]: Abstraction has 21129 states and 25984 transitions. [2018-10-24 14:57:46,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 25984 transitions. [2018-10-24 14:57:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-24 14:57:46,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:46,704 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:46,704 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:46,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:46,705 INFO L82 PathProgramCache]: Analyzing trace with hash 287123333, now seen corresponding path program 1 times [2018-10-24 14:57:46,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:46,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:46,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:46,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:46,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-24 14:57:46,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:46,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:46,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:46,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:46,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:46,991 INFO L87 Difference]: Start difference. First operand 21129 states and 25984 transitions. Second operand 4 states. [2018-10-24 14:57:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:48,635 INFO L93 Difference]: Finished difference Result 41848 states and 51444 transitions. [2018-10-24 14:57:48,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:48,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-10-24 14:57:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:48,661 INFO L225 Difference]: With dead ends: 41848 [2018-10-24 14:57:48,661 INFO L226 Difference]: Without dead ends: 20721 [2018-10-24 14:57:48,688 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:57:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2018-10-24 14:57:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 20721. [2018-10-24 14:57:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20721 states. [2018-10-24 14:57:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20721 states to 20721 states and 24096 transitions. [2018-10-24 14:57:48,946 INFO L78 Accepts]: Start accepts. Automaton has 20721 states and 24096 transitions. Word has length 306 [2018-10-24 14:57:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:48,947 INFO L481 AbstractCegarLoop]: Abstraction has 20721 states and 24096 transitions. [2018-10-24 14:57:48,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 20721 states and 24096 transitions. [2018-10-24 14:57:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-24 14:57:48,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:48,974 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:48,974 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:48,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:48,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1928214112, now seen corresponding path program 1 times [2018-10-24 14:57:48,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:48,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:48,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:48,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:48,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-24 14:57:49,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:49,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:49,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:49,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:49,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:49,367 INFO L87 Difference]: Start difference. First operand 20721 states and 24096 transitions. Second operand 4 states. [2018-10-24 14:57:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:51,933 INFO L93 Difference]: Finished difference Result 81406 states and 94708 transitions. [2018-10-24 14:57:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:51,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-10-24 14:57:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:52,017 INFO L225 Difference]: With dead ends: 81406 [2018-10-24 14:57:52,017 INFO L226 Difference]: Without dead ends: 60687 [2018-10-24 14:57:52,044 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:57:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60687 states. [2018-10-24 14:57:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60687 to 60685. [2018-10-24 14:57:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60685 states. [2018-10-24 14:57:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60685 states to 60685 states and 70476 transitions. [2018-10-24 14:57:52,852 INFO L78 Accepts]: Start accepts. Automaton has 60685 states and 70476 transitions. Word has length 308 [2018-10-24 14:57:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:52,852 INFO L481 AbstractCegarLoop]: Abstraction has 60685 states and 70476 transitions. [2018-10-24 14:57:52,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 60685 states and 70476 transitions. [2018-10-24 14:57:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-24 14:57:52,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:52,880 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:52,880 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:52,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash -458556812, now seen corresponding path program 1 times [2018-10-24 14:57:52,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:52,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:52,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-24 14:57:53,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:53,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:53,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:53,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:53,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:53,097 INFO L87 Difference]: Start difference. First operand 60685 states and 70476 transitions. Second operand 3 states. [2018-10-24 14:57:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:57,061 INFO L93 Difference]: Finished difference Result 165657 states and 191383 transitions. [2018-10-24 14:57:57,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:57,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-10-24 14:57:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:57,170 INFO L225 Difference]: With dead ends: 165657 [2018-10-24 14:57:57,170 INFO L226 Difference]: Without dead ends: 104974 [2018-10-24 14:57:57,219 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:57:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104974 states. [2018-10-24 14:57:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104974 to 104938. [2018-10-24 14:57:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104938 states. [2018-10-24 14:57:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104938 states to 104938 states and 118157 transitions. [2018-10-24 14:57:58,433 INFO L78 Accepts]: Start accepts. Automaton has 104938 states and 118157 transitions. Word has length 341 [2018-10-24 14:57:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:58,433 INFO L481 AbstractCegarLoop]: Abstraction has 104938 states and 118157 transitions. [2018-10-24 14:57:58,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 104938 states and 118157 transitions. [2018-10-24 14:57:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-24 14:57:58,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:58,452 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, 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, 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] [2018-10-24 14:57:58,452 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:58,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1480618161, now seen corresponding path program 1 times [2018-10-24 14:57:58,453 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:58,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:58,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:58,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-24 14:57:58,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:58,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:58,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:58,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:58,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:58,694 INFO L87 Difference]: Start difference. First operand 104938 states and 118157 transitions. Second operand 3 states. [2018-10-24 14:58:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:01,367 INFO L93 Difference]: Finished difference Result 263416 states and 296388 transitions. [2018-10-24 14:58:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:01,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2018-10-24 14:58:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:01,556 INFO L225 Difference]: With dead ends: 263416 [2018-10-24 14:58:01,557 INFO L226 Difference]: Without dead ends: 158480 [2018-10-24 14:58:01,605 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-24 14:58:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158480 states. [2018-10-24 14:58:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158480 to 158462. [2018-10-24 14:58:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158462 states. [2018-10-24 14:58:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158462 states to 158462 states and 178052 transitions. [2018-10-24 14:58:03,386 INFO L78 Accepts]: Start accepts. Automaton has 158462 states and 178052 transitions. Word has length 342 [2018-10-24 14:58:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:03,386 INFO L481 AbstractCegarLoop]: Abstraction has 158462 states and 178052 transitions. [2018-10-24 14:58:03,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 158462 states and 178052 transitions. [2018-10-24 14:58:03,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-24 14:58:03,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:03,423 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:03,423 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:03,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:03,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1211834363, now seen corresponding path program 1 times [2018-10-24 14:58:03,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:03,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:03,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:03,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:03,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:03,787 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:58:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-24 14:58:05,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:05,069 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-24 14:58:05,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:05,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-24 14:58:05,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:05,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:58:05,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:58:05,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:58:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:58:05,648 INFO L87 Difference]: Start difference. First operand 158462 states and 178052 transitions. Second operand 7 states. [2018-10-24 14:58:05,842 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 14:58:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:13,214 INFO L93 Difference]: Finished difference Result 490832 states and 552463 transitions. [2018-10-24 14:58:13,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 14:58:13,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 350 [2018-10-24 14:58:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:13,653 INFO L225 Difference]: With dead ends: 490832 [2018-10-24 14:58:13,654 INFO L226 Difference]: Without dead ends: 332366 [2018-10-24 14:58:13,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-24 14:58:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332366 states. [2018-10-24 14:58:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332366 to 331100. [2018-10-24 14:58:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331100 states. [2018-10-24 14:58:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331100 states to 331100 states and 362711 transitions. [2018-10-24 14:58:19,996 INFO L78 Accepts]: Start accepts. Automaton has 331100 states and 362711 transitions. Word has length 350 [2018-10-24 14:58:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:19,996 INFO L481 AbstractCegarLoop]: Abstraction has 331100 states and 362711 transitions. [2018-10-24 14:58:19,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:58:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 331100 states and 362711 transitions. [2018-10-24 14:58:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-24 14:58:20,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:20,061 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, 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, 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] [2018-10-24 14:58:20,061 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:20,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1657524425, now seen corresponding path program 1 times [2018-10-24 14:58:20,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:20,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:20,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-10-24 14:58:20,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:20,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:58:20,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:58:20,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:58:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:58:20,482 INFO L87 Difference]: Start difference. First operand 331100 states and 362711 transitions. Second operand 6 states. [2018-10-24 14:58:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:28,551 INFO L93 Difference]: Finished difference Result 1202642 states and 1309094 transitions. [2018-10-24 14:58:28,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:58:28,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 414 [2018-10-24 14:58:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:29,833 INFO L225 Difference]: With dead ends: 1202642 [2018-10-24 14:58:29,834 INFO L226 Difference]: Without dead ends: 871544 [2018-10-24 14:58:30,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:58:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871544 states. [2018-10-24 14:58:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871544 to 870676. [2018-10-24 14:58:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870676 states. [2018-10-24 14:58:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870676 states to 870676 states and 944357 transitions. [2018-10-24 14:58:53,487 INFO L78 Accepts]: Start accepts. Automaton has 870676 states and 944357 transitions. Word has length 414 [2018-10-24 14:58:53,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:53,487 INFO L481 AbstractCegarLoop]: Abstraction has 870676 states and 944357 transitions. [2018-10-24 14:58:53,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:58:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 870676 states and 944357 transitions. [2018-10-24 14:58:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-24 14:58:53,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:53,571 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:53,572 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:53,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:53,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1681683295, now seen corresponding path program 1 times [2018-10-24 14:58:53,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:53,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:53,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:53,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:53,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-24 14:58:55,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:55,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:58:55,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:58:55,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:58:55,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:55,651 INFO L87 Difference]: Start difference. First operand 870676 states and 944357 transitions. Second operand 5 states. [2018-10-24 14:59:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:16,673 INFO L93 Difference]: Finished difference Result 2249398 states and 2431434 transitions. [2018-10-24 14:59:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:59:16,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 416 [2018-10-24 14:59:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:20,715 INFO L225 Difference]: With dead ends: 2249398 [2018-10-24 14:59:20,716 INFO L226 Difference]: Without dead ends: 1378724 [2018-10-24 14:59:20,996 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-24 14:59:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378724 states. [2018-10-24 14:59:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378724 to 1269242. [2018-10-24 14:59:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269242 states. [2018-10-24 15:00:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269242 states to 1269242 states and 1370861 transitions. [2018-10-24 15:00:06,538 INFO L78 Accepts]: Start accepts. Automaton has 1269242 states and 1370861 transitions. Word has length 416 [2018-10-24 15:00:06,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:06,539 INFO L481 AbstractCegarLoop]: Abstraction has 1269242 states and 1370861 transitions. [2018-10-24 15:00:06,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:00:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1269242 states and 1370861 transitions. [2018-10-24 15:00:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-10-24 15:00:06,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:06,688 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 15:00:06,689 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:06,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 893198241, now seen corresponding path program 1 times [2018-10-24 15:00:06,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:06,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:06,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-24 15:00:07,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:07,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:07,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:07,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:07,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:07,064 INFO L87 Difference]: Start difference. First operand 1269242 states and 1370861 transitions. Second operand 4 states. Received shutdown request... [2018-10-24 15:00:25,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:25,309 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:00:25,315 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:00:25,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:00:25 BoogieIcfgContainer [2018-10-24 15:00:25,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:00:25,316 INFO L168 Benchmark]: Toolchain (without parser) took 193831.48 ms. Allocated memory was 1.5 GB in the beginning and 6.5 GB in the end (delta: 5.0 GB). Free memory was 1.4 GB in the beginning and 4.1 GB in the end (delta: -2.7 GB). Peak memory consumption was 5.9 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:25,317 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:00:25,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1194.42 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-24 15:00:25,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 349.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.6 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -837.0 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:25,320 INFO L168 Benchmark]: Boogie Preprocessor took 167.83 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:25,320 INFO L168 Benchmark]: RCFGBuilder took 5740.65 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 260.2 MB). Peak memory consumption was 260.2 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:25,321 INFO L168 Benchmark]: TraceAbstraction took 186374.25 ms. Allocated memory was 2.2 GB in the beginning and 6.5 GB in the end (delta: 4.3 GB). Free memory was 1.9 GB in the beginning and 4.1 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.7 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:25,326 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1194.42 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 349.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.6 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -837.0 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 167.83 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5740.65 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 260.2 MB). Peak memory consumption was 260.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186374.25 ms. Allocated memory was 2.2 GB in the beginning and 6.5 GB in the end (delta: 4.3 GB). Free memory was 1.9 GB in the beginning and 4.1 GB in the end (delta: -2.3 GB). 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: 1641]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1269242states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1113427 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 186.3s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 95.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4396 SDtfs, 12994 SDslu, 4755 SDs, 0 SdLazy, 17190 SolverSat, 3629 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 692 GetRequests, 646 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1269242occurred 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: 80.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 124497 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 5805 NumberOfCodeBlocks, 5805 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5786 ConstructedInterpolants, 0 QuantifiedInterpolants, 3106999 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1158 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 3483/3497 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown