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_label08_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:58:14,241 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:58:14,243 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:58:14,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:58:14,255 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:58:14,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:58:14,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:58:14,260 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:58:14,262 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:58:14,263 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:58:14,264 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:58:14,264 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:58:14,265 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:58:14,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:58:14,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:58:14,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:58:14,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:58:14,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:58:14,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:58:14,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:58:14,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:58:14,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:58:14,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:58:14,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:58:14,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:58:14,282 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:58:14,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:58:14,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:58:14,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:58:14,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:58:14,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:58:14,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:58:14,287 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:58:14,288 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:58:14,289 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:58:14,290 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:58:14,290 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 19:58:14,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:58:14,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:58:14,307 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:58:14,308 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:58:14,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:58:14,309 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:58:14,309 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:58:14,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:58:14,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:58:14,310 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:58:14,310 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:58:14,310 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:58:14,310 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:58:14,311 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:58:14,311 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:58:14,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:58:14,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:58:14,312 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:58:14,312 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:58:14,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:58:14,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:58:14,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:58:14,313 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:58:14,313 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:58:14,313 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:58:14,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:58:14,314 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:58:14,314 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:58:14,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:58:14,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:58:14,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:58:14,384 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:58:14,384 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:58:14,385 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label08_true-unreach-call.c [2018-10-26 19:58:14,449 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b1887b3e9/8c1b796695a64889ac21e7ad1537a7b4/FLAG6e5770ebe [2018-10-26 19:58:15,132 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:58:15,133 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label08_true-unreach-call.c [2018-10-26 19:58:15,153 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b1887b3e9/8c1b796695a64889ac21e7ad1537a7b4/FLAG6e5770ebe [2018-10-26 19:58:15,172 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b1887b3e9/8c1b796695a64889ac21e7ad1537a7b4 [2018-10-26 19:58:15,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:58:15,187 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:58:15,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:15,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:58:15,195 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:58:15,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:15" (1/1) ... [2018-10-26 19:58:15,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a0d1884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:15, skipping insertion in model container [2018-10-26 19:58:15,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:15" (1/1) ... [2018-10-26 19:58:15,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:58:15,294 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:58:16,079 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:16,086 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:58:16,375 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:16,399 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:58:16,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16 WrapperNode [2018-10-26 19:58:16,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:16,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:16,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:58:16,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:58:16,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (1/1) ... [2018-10-26 19:58:16,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (1/1) ... [2018-10-26 19:58:16,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:16,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:58:16,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:58:16,707 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:58:16,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (1/1) ... [2018-10-26 19:58:16,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (1/1) ... [2018-10-26 19:58:16,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (1/1) ... [2018-10-26 19:58:16,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (1/1) ... [2018-10-26 19:58:16,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (1/1) ... [2018-10-26 19:58:16,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (1/1) ... [2018-10-26 19:58:16,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (1/1) ... [2018-10-26 19:58:16,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:58:16,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:58:16,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:58:16,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:58:16,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:58:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:58:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:58:16,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:58:22,386 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:58:22,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:22 BoogieIcfgContainer [2018-10-26 19:58:22,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:58:22,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:58:22,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:58:22,392 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:58:22,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:58:15" (1/3) ... [2018-10-26 19:58:22,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760465f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:22, skipping insertion in model container [2018-10-26 19:58:22,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:16" (2/3) ... [2018-10-26 19:58:22,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760465f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:22, skipping insertion in model container [2018-10-26 19:58:22,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:22" (3/3) ... [2018-10-26 19:58:22,396 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label08_true-unreach-call.c [2018-10-26 19:58:22,407 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:58:22,416 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:58:22,434 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:58:22,481 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:58:22,482 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:58:22,482 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:58:22,482 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:58:22,482 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:58:22,483 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:58:22,483 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:58:22,483 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:58:22,483 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:58:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 19:58:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-26 19:58:22,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:22,528 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] [2018-10-26 19:58:22,530 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:22,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:22,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1617915860, now seen corresponding path program 1 times [2018-10-26 19:58:22,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:22,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:22,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:22,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:22,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:23,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:23,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:23,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:23,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:23,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:23,371 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 19:58:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:27,148 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-26 19:58:27,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:27,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-10-26 19:58:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:27,176 INFO L225 Difference]: With dead ends: 1027 [2018-10-26 19:58:27,176 INFO L226 Difference]: Without dead ends: 717 [2018-10-26 19:58:27,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-26 19:58:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-26 19:58:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-26 19:58:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-26 19:58:27,281 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 158 [2018-10-26 19:58:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:27,282 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-26 19:58:27,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-26 19:58:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-26 19:58:27,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:27,289 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] [2018-10-26 19:58:27,289 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:27,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:27,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1348626709, now seen corresponding path program 1 times [2018-10-26 19:58:27,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:27,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:27,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:27,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:27,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:27,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:27,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:27,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:27,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:27,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:27,449 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-26 19:58:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:29,127 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-26 19:58:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:29,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-10-26 19:58:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:29,138 INFO L225 Difference]: With dead ends: 2058 [2018-10-26 19:58:29,139 INFO L226 Difference]: Without dead ends: 1345 [2018-10-26 19:58:29,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-26 19:58:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-26 19:58:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-26 19:58:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-26 19:58:29,206 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 167 [2018-10-26 19:58:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:29,207 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-26 19:58:29,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-26 19:58:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 19:58:29,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:29,214 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:29,215 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:29,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1364601921, now seen corresponding path program 1 times [2018-10-26 19:58:29,215 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:29,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:29,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:29,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:29,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:29,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:29,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:29,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:29,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:29,517 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-26 19:58:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:33,436 INFO L93 Difference]: Finished difference Result 3901 states and 6135 transitions. [2018-10-26 19:58:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:33,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-10-26 19:58:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:33,453 INFO L225 Difference]: With dead ends: 3901 [2018-10-26 19:58:33,453 INFO L226 Difference]: Without dead ends: 2572 [2018-10-26 19:58:33,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2018-10-26 19:58:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2558. [2018-10-26 19:58:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2018-10-26 19:58:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3854 transitions. [2018-10-26 19:58:33,507 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3854 transitions. Word has length 175 [2018-10-26 19:58:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:33,508 INFO L481 AbstractCegarLoop]: Abstraction has 2558 states and 3854 transitions. [2018-10-26 19:58:33,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3854 transitions. [2018-10-26 19:58:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-26 19:58:33,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:33,515 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] [2018-10-26 19:58:33,515 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:33,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:33,516 INFO L82 PathProgramCache]: Analyzing trace with hash 408853660, now seen corresponding path program 1 times [2018-10-26 19:58:33,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:33,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:33,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:33,655 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-26 19:58:33,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:33,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:33,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:33,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:33,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:33,657 INFO L87 Difference]: Start difference. First operand 2558 states and 3854 transitions. Second operand 3 states. [2018-10-26 19:58:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:34,311 INFO L93 Difference]: Finished difference Result 5091 states and 7675 transitions. [2018-10-26 19:58:34,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:34,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-26 19:58:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:34,325 INFO L225 Difference]: With dead ends: 5091 [2018-10-26 19:58:34,325 INFO L226 Difference]: Without dead ends: 2535 [2018-10-26 19:58:34,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2018-10-26 19:58:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2535. [2018-10-26 19:58:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2535 states. [2018-10-26 19:58:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3747 transitions. [2018-10-26 19:58:34,388 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3747 transitions. Word has length 189 [2018-10-26 19:58:34,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:34,388 INFO L481 AbstractCegarLoop]: Abstraction has 2535 states and 3747 transitions. [2018-10-26 19:58:34,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:34,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3747 transitions. [2018-10-26 19:58:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-26 19:58:34,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:34,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:34,397 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:34,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:34,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1261203664, now seen corresponding path program 1 times [2018-10-26 19:58:34,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:34,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:34,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:34,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:34,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:34,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:34,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:34,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:34,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:34,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:34,636 INFO L87 Difference]: Start difference. First operand 2535 states and 3747 transitions. Second operand 3 states. [2018-10-26 19:58:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:35,928 INFO L93 Difference]: Finished difference Result 7314 states and 10763 transitions. [2018-10-26 19:58:35,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:35,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-10-26 19:58:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:35,949 INFO L225 Difference]: With dead ends: 7314 [2018-10-26 19:58:35,949 INFO L226 Difference]: Without dead ends: 4781 [2018-10-26 19:58:35,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2018-10-26 19:58:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2018-10-26 19:58:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4778 states. [2018-10-26 19:58:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6617 transitions. [2018-10-26 19:58:36,028 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6617 transitions. Word has length 210 [2018-10-26 19:58:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:36,028 INFO L481 AbstractCegarLoop]: Abstraction has 4778 states and 6617 transitions. [2018-10-26 19:58:36,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6617 transitions. [2018-10-26 19:58:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-26 19:58:36,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:36,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:36,038 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:36,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:36,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1940533706, now seen corresponding path program 1 times [2018-10-26 19:58:36,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:36,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:36,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:36,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:36,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:36,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:36,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:36,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:36,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:36,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:36,256 INFO L87 Difference]: Start difference. First operand 4778 states and 6617 transitions. Second operand 4 states. [2018-10-26 19:58:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:39,111 INFO L93 Difference]: Finished difference Result 17751 states and 24441 transitions. [2018-10-26 19:58:39,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:39,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-10-26 19:58:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:39,159 INFO L225 Difference]: With dead ends: 17751 [2018-10-26 19:58:39,159 INFO L226 Difference]: Without dead ends: 12975 [2018-10-26 19:58:39,169 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-26 19:58:39,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12975 states. [2018-10-26 19:58:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12975 to 9063. [2018-10-26 19:58:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-10-26 19:58:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 11954 transitions. [2018-10-26 19:58:39,324 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 11954 transitions. Word has length 213 [2018-10-26 19:58:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:39,325 INFO L481 AbstractCegarLoop]: Abstraction has 9063 states and 11954 transitions. [2018-10-26 19:58:39,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 11954 transitions. [2018-10-26 19:58:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-26 19:58:39,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:39,341 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:39,341 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:39,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:39,342 INFO L82 PathProgramCache]: Analyzing trace with hash -12059043, now seen corresponding path program 1 times [2018-10-26 19:58:39,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:39,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:39,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 19:58:39,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:39,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:39,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:39,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:39,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:39,491 INFO L87 Difference]: Start difference. First operand 9063 states and 11954 transitions. Second operand 3 states. [2018-10-26 19:58:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:40,787 INFO L93 Difference]: Finished difference Result 23069 states and 30331 transitions. [2018-10-26 19:58:40,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:40,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-10-26 19:58:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:40,829 INFO L225 Difference]: With dead ends: 23069 [2018-10-26 19:58:40,829 INFO L226 Difference]: Without dead ends: 14008 [2018-10-26 19:58:40,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14008 states. [2018-10-26 19:58:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14008 to 14005. [2018-10-26 19:58:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14005 states. [2018-10-26 19:58:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14005 states to 14005 states and 18328 transitions. [2018-10-26 19:58:41,130 INFO L78 Accepts]: Start accepts. Automaton has 14005 states and 18328 transitions. Word has length 222 [2018-10-26 19:58:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:41,131 INFO L481 AbstractCegarLoop]: Abstraction has 14005 states and 18328 transitions. [2018-10-26 19:58:41,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 14005 states and 18328 transitions. [2018-10-26 19:58:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-26 19:58:41,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:41,155 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-26 19:58:41,155 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:41,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:41,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1088101623, now seen corresponding path program 1 times [2018-10-26 19:58:41,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:41,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:41,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:41,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:41,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 19:58:41,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:58:41,417 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:58:41,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:41,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:58:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-26 19:58:41,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:58:41,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-26 19:58:41,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:58:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:58:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:58:41,756 INFO L87 Difference]: Start difference. First operand 14005 states and 18328 transitions. Second operand 6 states. [2018-10-26 19:58:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:49,506 INFO L93 Difference]: Finished difference Result 85662 states and 112685 transitions. [2018-10-26 19:58:49,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 19:58:49,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2018-10-26 19:58:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:49,657 INFO L225 Difference]: With dead ends: 85662 [2018-10-26 19:58:49,657 INFO L226 Difference]: Without dead ends: 71659 [2018-10-26 19:58:49,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:58:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71659 states. [2018-10-26 19:58:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71659 to 70421. [2018-10-26 19:58:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70421 states. [2018-10-26 19:58:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70421 states to 70421 states and 86088 transitions. [2018-10-26 19:58:50,733 INFO L78 Accepts]: Start accepts. Automaton has 70421 states and 86088 transitions. Word has length 230 [2018-10-26 19:58:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:50,733 INFO L481 AbstractCegarLoop]: Abstraction has 70421 states and 86088 transitions. [2018-10-26 19:58:50,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:58:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 70421 states and 86088 transitions. [2018-10-26 19:58:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-26 19:58:50,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:50,789 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, 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] [2018-10-26 19:58:50,789 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:50,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:50,790 INFO L82 PathProgramCache]: Analyzing trace with hash -307747242, now seen corresponding path program 1 times [2018-10-26 19:58:50,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:50,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:50,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:50,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:50,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:50,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:50,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:50,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:50,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:50,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:50,999 INFO L87 Difference]: Start difference. First operand 70421 states and 86088 transitions. Second operand 3 states. [2018-10-26 19:58:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:52,628 INFO L93 Difference]: Finished difference Result 136010 states and 165688 transitions. [2018-10-26 19:58:52,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:52,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-10-26 19:58:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:52,721 INFO L225 Difference]: With dead ends: 136010 [2018-10-26 19:58:52,721 INFO L226 Difference]: Without dead ends: 65591 [2018-10-26 19:58:52,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65591 states. [2018-10-26 19:58:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65591 to 65584. [2018-10-26 19:58:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65584 states. [2018-10-26 19:58:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65584 states to 65584 states and 76213 transitions. [2018-10-26 19:58:54,166 INFO L78 Accepts]: Start accepts. Automaton has 65584 states and 76213 transitions. Word has length 237 [2018-10-26 19:58:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:54,166 INFO L481 AbstractCegarLoop]: Abstraction has 65584 states and 76213 transitions. [2018-10-26 19:58:54,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 65584 states and 76213 transitions. [2018-10-26 19:58:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-26 19:58:54,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:54,205 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:54,206 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:54,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:54,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1654308121, now seen corresponding path program 1 times [2018-10-26 19:58:54,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:54,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:54,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:54,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:54,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:54,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:54,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:54,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:54,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:54,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:54,496 INFO L87 Difference]: Start difference. First operand 65584 states and 76213 transitions. Second operand 3 states. [2018-10-26 19:58:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:56,158 INFO L93 Difference]: Finished difference Result 171765 states and 199387 transitions. [2018-10-26 19:58:56,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:56,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-10-26 19:58:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:56,286 INFO L225 Difference]: With dead ends: 171765 [2018-10-26 19:58:56,287 INFO L226 Difference]: Without dead ends: 106183 [2018-10-26 19:58:56,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106183 states. [2018-10-26 19:58:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106183 to 106178. [2018-10-26 19:58:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106178 states. [2018-10-26 19:58:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106178 states to 106178 states and 123027 transitions. [2018-10-26 19:58:58,122 INFO L78 Accepts]: Start accepts. Automaton has 106178 states and 123027 transitions. Word has length 274 [2018-10-26 19:58:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:58,122 INFO L481 AbstractCegarLoop]: Abstraction has 106178 states and 123027 transitions. [2018-10-26 19:58:58,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 106178 states and 123027 transitions. [2018-10-26 19:58:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-26 19:58:58,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:58,177 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:58:58,178 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:58,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:58,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1442636741, now seen corresponding path program 1 times [2018-10-26 19:58:58,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:58,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:58,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:58,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:58,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:58,584 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 19:58:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:59,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:59,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-26 19:58:59,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 19:58:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 19:58:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:58:59,400 INFO L87 Difference]: Start difference. First operand 106178 states and 123027 transitions. Second operand 11 states. [2018-10-26 19:59:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:07,150 INFO L93 Difference]: Finished difference Result 319247 states and 366301 transitions. [2018-10-26 19:59:07,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 19:59:07,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 282 [2018-10-26 19:59:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:07,378 INFO L225 Difference]: With dead ends: 319247 [2018-10-26 19:59:07,378 INFO L226 Difference]: Without dead ends: 213071 [2018-10-26 19:59:07,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-10-26 19:59:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213071 states. [2018-10-26 19:59:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213071 to 210692. [2018-10-26 19:59:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210692 states. [2018-10-26 19:59:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210692 states to 210692 states and 240627 transitions. [2018-10-26 19:59:10,740 INFO L78 Accepts]: Start accepts. Automaton has 210692 states and 240627 transitions. Word has length 282 [2018-10-26 19:59:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:10,741 INFO L481 AbstractCegarLoop]: Abstraction has 210692 states and 240627 transitions. [2018-10-26 19:59:10,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 19:59:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 210692 states and 240627 transitions. [2018-10-26 19:59:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-26 19:59:10,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:10,842 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:59:10,843 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:10,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:10,843 INFO L82 PathProgramCache]: Analyzing trace with hash -985106448, now seen corresponding path program 1 times [2018-10-26 19:59:10,843 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:10,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:10,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-10-26 19:59:10,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:10,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:10,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:59:10,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:59:10,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:10,996 INFO L87 Difference]: Start difference. First operand 210692 states and 240627 transitions. Second operand 3 states. [2018-10-26 19:59:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:13,468 INFO L93 Difference]: Finished difference Result 418111 states and 477909 transitions. [2018-10-26 19:59:13,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:59:13,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-10-26 19:59:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:13,742 INFO L225 Difference]: With dead ends: 418111 [2018-10-26 19:59:13,743 INFO L226 Difference]: Without dead ends: 207421 [2018-10-26 19:59:13,864 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-26 19:59:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207421 states. [2018-10-26 19:59:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207421 to 207389. [2018-10-26 19:59:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207389 states. [2018-10-26 19:59:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207389 states to 207389 states and 229056 transitions. [2018-10-26 19:59:18,556 INFO L78 Accepts]: Start accepts. Automaton has 207389 states and 229056 transitions. Word has length 313 [2018-10-26 19:59:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:18,557 INFO L481 AbstractCegarLoop]: Abstraction has 207389 states and 229056 transitions. [2018-10-26 19:59:18,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:59:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 207389 states and 229056 transitions. [2018-10-26 19:59:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-26 19:59:18,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:18,619 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:59:18,619 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:18,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:18,619 INFO L82 PathProgramCache]: Analyzing trace with hash 298861796, now seen corresponding path program 1 times [2018-10-26 19:59:18,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:18,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:18,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:18,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:18,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 19:59:18,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:18,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:18,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:18,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:18,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:18,984 INFO L87 Difference]: Start difference. First operand 207389 states and 229056 transitions. Second operand 4 states. [2018-10-26 19:59:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:26,453 INFO L93 Difference]: Finished difference Result 608923 states and 670921 transitions. [2018-10-26 19:59:26,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:26,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-10-26 19:59:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:26,924 INFO L225 Difference]: With dead ends: 608923 [2018-10-26 19:59:26,925 INFO L226 Difference]: Without dead ends: 401536 [2018-10-26 19:59:27,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401536 states. [2018-10-26 19:59:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401536 to 396796. [2018-10-26 19:59:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396796 states. [2018-10-26 19:59:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396796 states to 396796 states and 436615 transitions. [2018-10-26 19:59:33,267 INFO L78 Accepts]: Start accepts. Automaton has 396796 states and 436615 transitions. Word has length 317 [2018-10-26 19:59:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:33,267 INFO L481 AbstractCegarLoop]: Abstraction has 396796 states and 436615 transitions. [2018-10-26 19:59:33,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 396796 states and 436615 transitions. [2018-10-26 19:59:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-26 19:59:33,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:33,372 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 19:59:33,372 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:33,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:33,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1895868189, now seen corresponding path program 1 times [2018-10-26 19:59:33,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:33,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:33,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:33,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:33,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-26 19:59:33,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:33,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:33,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:33,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:33,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:33,812 INFO L87 Difference]: Start difference. First operand 396796 states and 436615 transitions. Second operand 4 states. [2018-10-26 19:59:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:38,730 INFO L93 Difference]: Finished difference Result 785515 states and 864790 transitions. [2018-10-26 19:59:38,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:59:38,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2018-10-26 19:59:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:39,126 INFO L225 Difference]: With dead ends: 785515 [2018-10-26 19:59:39,126 INFO L226 Difference]: Without dead ends: 388721 [2018-10-26 19:59:39,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388721 states. [2018-10-26 19:59:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388721 to 387781. [2018-10-26 19:59:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387781 states. [2018-10-26 19:59:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387781 states to 387781 states and 424956 transitions. [2018-10-26 19:59:45,174 INFO L78 Accepts]: Start accepts. Automaton has 387781 states and 424956 transitions. Word has length 372 [2018-10-26 19:59:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:45,175 INFO L481 AbstractCegarLoop]: Abstraction has 387781 states and 424956 transitions. [2018-10-26 19:59:45,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 387781 states and 424956 transitions. [2018-10-26 19:59:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-26 19:59:45,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:45,265 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:59:45,265 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:45,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash 663501376, now seen corresponding path program 1 times [2018-10-26 19:59:45,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:45,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:45,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-10-26 19:59:45,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:45,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:45,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:45,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:45,706 INFO L87 Difference]: Start difference. First operand 387781 states and 424956 transitions. Second operand 4 states. [2018-10-26 19:59:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:53,823 INFO L93 Difference]: Finished difference Result 775630 states and 850037 transitions. [2018-10-26 19:59:53,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:53,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2018-10-26 19:59:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:54,322 INFO L225 Difference]: With dead ends: 775630 [2018-10-26 19:59:54,322 INFO L226 Difference]: Without dead ends: 387851 [2018-10-26 19:59:54,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387851 states. [2018-10-26 20:00:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387851 to 387781. [2018-10-26 20:00:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387781 states. [2018-10-26 20:00:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387781 states to 387781 states and 420600 transitions. [2018-10-26 20:00:00,817 INFO L78 Accepts]: Start accepts. Automaton has 387781 states and 420600 transitions. Word has length 386 [2018-10-26 20:00:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:00,817 INFO L481 AbstractCegarLoop]: Abstraction has 387781 states and 420600 transitions. [2018-10-26 20:00:00,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 387781 states and 420600 transitions. [2018-10-26 20:00:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-10-26 20:00:00,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:00,936 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:00:00,936 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:00,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1826316818, now seen corresponding path program 1 times [2018-10-26 20:00:00,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:00,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:00,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:00,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:00,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-26 20:00:01,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:01,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:01,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:01,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:01,185 INFO L87 Difference]: Start difference. First operand 387781 states and 420600 transitions. Second operand 3 states. [2018-10-26 20:00:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:05,654 INFO L93 Difference]: Finished difference Result 723348 states and 786210 transitions. [2018-10-26 20:00:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:05,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2018-10-26 20:00:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:06,024 INFO L225 Difference]: With dead ends: 723348 [2018-10-26 20:00:06,024 INFO L226 Difference]: Without dead ends: 335569 [2018-10-26 20:00:06,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335569 states. [2018-10-26 20:00:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335569 to 332268. [2018-10-26 20:00:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332268 states. [2018-10-26 20:00:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332268 states to 332268 states and 360060 transitions. [2018-10-26 20:00:11,371 INFO L78 Accepts]: Start accepts. Automaton has 332268 states and 360060 transitions. Word has length 393 [2018-10-26 20:00:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:11,372 INFO L481 AbstractCegarLoop]: Abstraction has 332268 states and 360060 transitions. [2018-10-26 20:00:11,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 332268 states and 360060 transitions. [2018-10-26 20:00:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-26 20:00:11,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:11,458 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:00:11,458 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:11,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1588649335, now seen corresponding path program 1 times [2018-10-26 20:00:11,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:11,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:11,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:11,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-26 20:00:11,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:11,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:00:11,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:11,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:11,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:11,782 INFO L87 Difference]: Start difference. First operand 332268 states and 360060 transitions. Second operand 3 states. [2018-10-26 20:00:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:15,939 INFO L93 Difference]: Finished difference Result 853198 states and 922511 transitions. [2018-10-26 20:00:15,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:15,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2018-10-26 20:00:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:16,619 INFO L225 Difference]: With dead ends: 853198 [2018-10-26 20:00:16,619 INFO L226 Difference]: Without dead ends: 520932 [2018-10-26 20:00:16,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520932 states. [2018-10-26 20:00:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520932 to 520926. [2018-10-26 20:00:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520926 states. [2018-10-26 20:00:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520926 states to 520926 states and 562366 transitions. [2018-10-26 20:00:29,605 INFO L78 Accepts]: Start accepts. Automaton has 520926 states and 562366 transitions. Word has length 396 [2018-10-26 20:00:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:29,605 INFO L481 AbstractCegarLoop]: Abstraction has 520926 states and 562366 transitions. [2018-10-26 20:00:29,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 520926 states and 562366 transitions. [2018-10-26 20:00:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-26 20:00:29,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:29,744 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, 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, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:00:29,745 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:29,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:29,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1331815661, now seen corresponding path program 1 times [2018-10-26 20:00:29,745 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:29,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:29,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-26 20:00:30,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:30,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:30,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:30,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:30,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:30,065 INFO L87 Difference]: Start difference. First operand 520926 states and 562366 transitions. Second operand 3 states. [2018-10-26 20:00:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:36,614 INFO L93 Difference]: Finished difference Result 1325610 states and 1430525 transitions. [2018-10-26 20:00:36,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:36,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 405 [2018-10-26 20:00:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:37,660 INFO L225 Difference]: With dead ends: 1325610 [2018-10-26 20:00:37,660 INFO L226 Difference]: Without dead ends: 804686 [2018-10-26 20:00:37,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804686 states. [2018-10-26 20:01:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804686 to 804276. [2018-10-26 20:01:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804276 states. [2018-10-26 20:01:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804276 states to 804276 states and 864196 transitions. [2018-10-26 20:01:04,281 INFO L78 Accepts]: Start accepts. Automaton has 804276 states and 864196 transitions. Word has length 405 [2018-10-26 20:01:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:04,282 INFO L481 AbstractCegarLoop]: Abstraction has 804276 states and 864196 transitions. [2018-10-26 20:01:04,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:01:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 804276 states and 864196 transitions. [2018-10-26 20:01:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-26 20:01:04,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:04,400 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 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, 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] [2018-10-26 20:01:04,401 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:04,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:04,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1212429337, now seen corresponding path program 1 times [2018-10-26 20:01:04,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:04,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:04,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:04,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:04,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-26 20:01:04,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:04,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:04,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:04,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:04,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:04,685 INFO L87 Difference]: Start difference. First operand 804276 states and 864196 transitions. Second operand 4 states. [2018-10-26 20:01:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:14,395 INFO L93 Difference]: Finished difference Result 1649230 states and 1771756 transitions. [2018-10-26 20:01:14,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:14,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 411 [2018-10-26 20:01:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:15,417 INFO L225 Difference]: With dead ends: 1649230 [2018-10-26 20:01:15,417 INFO L226 Difference]: Without dead ends: 844956 [2018-10-26 20:01:15,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844956 states. [2018-10-26 20:01:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844956 to 794748. [2018-10-26 20:01:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794748 states. [2018-10-26 20:01:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794748 states to 794748 states and 851623 transitions. [2018-10-26 20:01:29,348 INFO L78 Accepts]: Start accepts. Automaton has 794748 states and 851623 transitions. Word has length 411 [2018-10-26 20:01:29,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:29,348 INFO L481 AbstractCegarLoop]: Abstraction has 794748 states and 851623 transitions. [2018-10-26 20:01:29,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:01:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 794748 states and 851623 transitions. [2018-10-26 20:01:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-26 20:01:29,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:29,462 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:29,462 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:29,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:29,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1299541976, now seen corresponding path program 1 times [2018-10-26 20:01:29,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:29,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:29,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-26 20:01:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:29,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:29,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:29,873 INFO L87 Difference]: Start difference. First operand 794748 states and 851623 transitions. Second operand 4 states. Received shutdown request... [2018-10-26 20:01:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:37,365 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:01:37,370 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:01:37,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:01:37 BoogieIcfgContainer [2018-10-26 20:01:37,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:01:37,371 INFO L168 Benchmark]: Toolchain (without parser) took 202185.77 ms. Allocated memory was 1.6 GB in the beginning and 6.4 GB in the end (delta: 4.8 GB). Free memory was 1.4 GB in the beginning and 5.1 GB in the end (delta: -3.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-26 20:01:37,372 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:01:37,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1210.88 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:37,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 305.64 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 782.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -906.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:37,375 INFO L168 Benchmark]: Boogie Preprocessor took 127.71 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:37,375 INFO L168 Benchmark]: RCFGBuilder took 5553.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 251.0 MB). Peak memory consumption was 251.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:37,376 INFO L168 Benchmark]: TraceAbstraction took 194981.56 ms. Allocated memory was 2.3 GB in the beginning and 6.4 GB in the end (delta: 4.1 GB). Free memory was 2.0 GB in the beginning and 5.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 922.2 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:37,381 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.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1210.88 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 305.64 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 782.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -906.4 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.71 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5553.41 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 251.0 MB). Peak memory consumption was 251.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 194981.56 ms. Allocated memory was 2.3 GB in the beginning and 6.4 GB in the end (delta: 4.1 GB). Free memory was 2.0 GB in the beginning and 5.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 922.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1506]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1506). Cancelled while BasicCegarLoop was constructing difference of abstraction (794748states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (79237 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 194.8s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 97.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5624 SDtfs, 10099 SDslu, 3191 SDs, 0 SdLazy, 18378 SolverSat, 3616 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 50.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 254 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804276occurred in iteration=18, 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: 88.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 67284 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 6019 NumberOfCodeBlocks, 6019 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5998 ConstructedInterpolants, 0 QuantifiedInterpolants, 5120206 SizeOfPredicates, 1 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 4305/4309 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown