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/Problem18_label34_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:38:53,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:38:53,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:38:53,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:38:53,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:38:53,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:38:53,388 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:38:53,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:38:53,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:38:53,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:38:53,394 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:38:53,394 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:38:53,395 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:38:53,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:38:53,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:38:53,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:38:53,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:38:53,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:38:53,402 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:38:53,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:38:53,405 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:38:53,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:38:53,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:38:53,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:38:53,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:38:53,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:38:53,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:38:53,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:38:53,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:38:53,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:38:53,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:38:53,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:38:53,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:38:53,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:38:53,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:38:53,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:38:53,418 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:38:53,433 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:38:53,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:38:53,434 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:38:53,434 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:38:53,435 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:38:53,435 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:38:53,435 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:38:53,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:38:53,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:38:53,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:38:53,436 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:38:53,436 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:38:53,437 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:38:53,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:38:53,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:38:53,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:38:53,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:38:53,438 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:38:53,438 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:38:53,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:38:53,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:38:53,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:38:53,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:38:53,439 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:38:53,439 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:38:53,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:38:53,439 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:38:53,439 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:38:53,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:38:53,510 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:38:53,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:38:53,516 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:38:53,516 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:38:53,517 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label34_false-unreach-call.c [2018-10-24 14:38:53,586 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ff795b6f0/583207b3b0cf418c9562cb88d55d50c6/FLAGbeb7cf833 [2018-10-24 14:38:54,255 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:38:54,256 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label34_false-unreach-call.c [2018-10-24 14:38:54,285 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ff795b6f0/583207b3b0cf418c9562cb88d55d50c6/FLAGbeb7cf833 [2018-10-24 14:38:54,308 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ff795b6f0/583207b3b0cf418c9562cb88d55d50c6 [2018-10-24 14:38:54,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:38:54,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:38:54,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:38:54,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:38:54,331 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:38:54,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:54" (1/1) ... [2018-10-24 14:38:54,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58fe24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:54, skipping insertion in model container [2018-10-24 14:38:54,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:54" (1/1) ... [2018-10-24 14:38:54,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:38:54,488 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:38:55,579 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:38:55,584 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:38:56,058 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:38:56,091 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:38:56,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56 WrapperNode [2018-10-24 14:38:56,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:38:56,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:38:56,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:38:56,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:38:56,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (1/1) ... [2018-10-24 14:38:56,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (1/1) ... [2018-10-24 14:38:56,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:38:56,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:38:56,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:38:56,621 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:38:56,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (1/1) ... [2018-10-24 14:38:56,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (1/1) ... [2018-10-24 14:38:56,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (1/1) ... [2018-10-24 14:38:56,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (1/1) ... [2018-10-24 14:38:56,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (1/1) ... [2018-10-24 14:38:56,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (1/1) ... [2018-10-24 14:38:56,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (1/1) ... [2018-10-24 14:38:56,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:38:56,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:38:56,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:38:56,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:38:56,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:38:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:38:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:38:56,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:39:06,351 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:39:06,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:39:06 BoogieIcfgContainer [2018-10-24 14:39:06,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:39:06,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:39:06,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:39:06,357 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:39:06,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:38:54" (1/3) ... [2018-10-24 14:39:06,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6ef474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:39:06, skipping insertion in model container [2018-10-24 14:39:06,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:56" (2/3) ... [2018-10-24 14:39:06,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6ef474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:39:06, skipping insertion in model container [2018-10-24 14:39:06,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:39:06" (3/3) ... [2018-10-24 14:39:06,361 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label34_false-unreach-call.c [2018-10-24 14:39:06,372 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:39:06,382 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:39:06,400 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:39:06,453 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:39:06,454 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:39:06,454 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:39:06,455 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:39:06,455 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:39:06,455 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:39:06,455 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:39:06,455 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:39:06,456 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:39:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2018-10-24 14:39:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-24 14:39:06,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:06,522 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:06,524 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:06,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:06,531 INFO L82 PathProgramCache]: Analyzing trace with hash 150940466, now seen corresponding path program 1 times [2018-10-24 14:39:06,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:06,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:06,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:06,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:06,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:39:06,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:06,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:39:06,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:39:06,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:39:06,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:39:06,742 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 3 states. [2018-10-24 14:39:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:12,909 INFO L93 Difference]: Finished difference Result 2224 states and 4285 transitions. [2018-10-24 14:39:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:39:12,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-24 14:39:12,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:12,945 INFO L225 Difference]: With dead ends: 2224 [2018-10-24 14:39:12,945 INFO L226 Difference]: Without dead ends: 1462 [2018-10-24 14:39:12,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:39:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2018-10-24 14:39:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1462. [2018-10-24 14:39:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-10-24 14:39:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2366 transitions. [2018-10-24 14:39:13,079 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2366 transitions. Word has length 8 [2018-10-24 14:39:13,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:13,079 INFO L481 AbstractCegarLoop]: Abstraction has 1462 states and 2366 transitions. [2018-10-24 14:39:13,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:39:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2366 transitions. [2018-10-24 14:39:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-24 14:39:13,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:13,083 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:13,084 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:13,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:13,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2114697122, now seen corresponding path program 1 times [2018-10-24 14:39:13,084 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:13,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:13,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:39:13,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:13,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:39:13,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:39:13,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:39:13,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:13,374 INFO L87 Difference]: Start difference. First operand 1462 states and 2366 transitions. Second operand 4 states. [2018-10-24 14:39:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:22,091 INFO L93 Difference]: Finished difference Result 4304 states and 7017 transitions. [2018-10-24 14:39:22,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:39:22,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-10-24 14:39:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:22,108 INFO L225 Difference]: With dead ends: 4304 [2018-10-24 14:39:22,109 INFO L226 Difference]: Without dead ends: 2844 [2018-10-24 14:39:22,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2018-10-24 14:39:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2844. [2018-10-24 14:39:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2844 states. [2018-10-24 14:39:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 3963 transitions. [2018-10-24 14:39:22,177 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 3963 transitions. Word has length 74 [2018-10-24 14:39:22,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:22,178 INFO L481 AbstractCegarLoop]: Abstraction has 2844 states and 3963 transitions. [2018-10-24 14:39:22,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:39:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3963 transitions. [2018-10-24 14:39:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-24 14:39:22,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:22,186 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:22,186 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:22,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1934827818, now seen corresponding path program 1 times [2018-10-24 14:39:22,187 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:22,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:22,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:22,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:22,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 14:39:23,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:23,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:39:23,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:39:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:39:23,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:39:23,069 INFO L87 Difference]: Start difference. First operand 2844 states and 3963 transitions. Second operand 5 states. [2018-10-24 14:39:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:32,126 INFO L93 Difference]: Finished difference Result 11214 states and 15002 transitions. [2018-10-24 14:39:32,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:39:32,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2018-10-24 14:39:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:32,169 INFO L225 Difference]: With dead ends: 11214 [2018-10-24 14:39:32,169 INFO L226 Difference]: Without dead ends: 8372 [2018-10-24 14:39:32,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:39:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8372 states. [2018-10-24 14:39:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8372 to 7681. [2018-10-24 14:39:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7681 states. [2018-10-24 14:39:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7681 states to 7681 states and 9090 transitions. [2018-10-24 14:39:32,321 INFO L78 Accepts]: Start accepts. Automaton has 7681 states and 9090 transitions. Word has length 193 [2018-10-24 14:39:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:32,322 INFO L481 AbstractCegarLoop]: Abstraction has 7681 states and 9090 transitions. [2018-10-24 14:39:32,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:39:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7681 states and 9090 transitions. [2018-10-24 14:39:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-24 14:39:32,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:32,329 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:32,329 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:32,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash -45049022, now seen corresponding path program 1 times [2018-10-24 14:39:32,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:32,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:32,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:32,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:32,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 242 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-24 14:39:33,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:39:33,115 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:39:33,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:33,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:39:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-24 14:39:33,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:39:33,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:39:33,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:39:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:39:33,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:39:33,584 INFO L87 Difference]: Start difference. First operand 7681 states and 9090 transitions. Second operand 6 states. [2018-10-24 14:39:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:46,233 INFO L93 Difference]: Finished difference Result 25051 states and 29700 transitions. [2018-10-24 14:39:46,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 14:39:46,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 376 [2018-10-24 14:39:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:46,292 INFO L225 Difference]: With dead ends: 25051 [2018-10-24 14:39:46,292 INFO L226 Difference]: Without dead ends: 14604 [2018-10-24 14:39:46,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 376 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:39:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14604 states. [2018-10-24 14:39:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14604 to 10442. [2018-10-24 14:39:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10442 states. [2018-10-24 14:39:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10442 states to 10442 states and 11660 transitions. [2018-10-24 14:39:46,558 INFO L78 Accepts]: Start accepts. Automaton has 10442 states and 11660 transitions. Word has length 376 [2018-10-24 14:39:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:46,559 INFO L481 AbstractCegarLoop]: Abstraction has 10442 states and 11660 transitions. [2018-10-24 14:39:46,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:39:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 10442 states and 11660 transitions. [2018-10-24 14:39:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-24 14:39:46,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:46,568 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:46,568 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:46,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1458921127, now seen corresponding path program 1 times [2018-10-24 14:39:46,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:46,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:46,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:46,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:46,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-24 14:39:46,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:46,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:39:46,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:39:46,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:39:46,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:39:46,911 INFO L87 Difference]: Start difference. First operand 10442 states and 11660 transitions. Second operand 3 states. [2018-10-24 14:39:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:50,380 INFO L93 Difference]: Finished difference Result 27792 states and 31365 transitions. [2018-10-24 14:39:50,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:39:50,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2018-10-24 14:39:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:50,452 INFO L225 Difference]: With dead ends: 27792 [2018-10-24 14:39:50,452 INFO L226 Difference]: Without dead ends: 17352 [2018-10-24 14:39:50,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:39:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17352 states. [2018-10-24 14:39:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17352 to 17352. [2018-10-24 14:39:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17352 states. [2018-10-24 14:39:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17352 states to 17352 states and 19482 transitions. [2018-10-24 14:39:50,962 INFO L78 Accepts]: Start accepts. Automaton has 17352 states and 19482 transitions. Word has length 381 [2018-10-24 14:39:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:50,963 INFO L481 AbstractCegarLoop]: Abstraction has 17352 states and 19482 transitions. [2018-10-24 14:39:50,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:39:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 17352 states and 19482 transitions. [2018-10-24 14:39:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-10-24 14:39:50,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:50,975 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:50,975 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:50,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1854426833, now seen corresponding path program 1 times [2018-10-24 14:39:50,976 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:50,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:50,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-10-24 14:39:51,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:39:51,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:39:51,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:39:51,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:39:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:51,474 INFO L87 Difference]: Start difference. First operand 17352 states and 19482 transitions. Second operand 4 states. [2018-10-24 14:39:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:39:57,111 INFO L93 Difference]: Finished difference Result 53359 states and 61361 transitions. [2018-10-24 14:39:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:39:57,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 475 [2018-10-24 14:39:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:39:57,192 INFO L225 Difference]: With dead ends: 53359 [2018-10-24 14:39:57,192 INFO L226 Difference]: Without dead ends: 31149 [2018-10-24 14:39:57,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:39:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31149 states. [2018-10-24 14:39:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31149 to 31149. [2018-10-24 14:39:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31149 states. [2018-10-24 14:39:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31149 states to 31149 states and 34335 transitions. [2018-10-24 14:39:57,665 INFO L78 Accepts]: Start accepts. Automaton has 31149 states and 34335 transitions. Word has length 475 [2018-10-24 14:39:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:39:57,666 INFO L481 AbstractCegarLoop]: Abstraction has 31149 states and 34335 transitions. [2018-10-24 14:39:57,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:39:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 31149 states and 34335 transitions. [2018-10-24 14:39:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-24 14:39:57,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:39:57,677 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:39:57,678 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:39:57,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:39:57,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1700628360, now seen corresponding path program 1 times [2018-10-24 14:39:57,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:39:57,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:39:57,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:57,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:39:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-24 14:39:58,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:39:58,471 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:39:58,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:39:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:39:58,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:39:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-10-24 14:39:58,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:39:58,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-10-24 14:39:58,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:39:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:39:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:39:58,864 INFO L87 Difference]: Start difference. First operand 31149 states and 34335 transitions. Second operand 5 states. [2018-10-24 14:40:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:03,966 INFO L93 Difference]: Finished difference Result 72661 states and 80531 transitions. [2018-10-24 14:40:03,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:40:03,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 486 [2018-10-24 14:40:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:04,022 INFO L225 Difference]: With dead ends: 72661 [2018-10-24 14:40:04,022 INFO L226 Difference]: Without dead ends: 41514 [2018-10-24 14:40:04,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:40:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41514 states. [2018-10-24 14:40:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41514 to 41514. [2018-10-24 14:40:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41514 states. [2018-10-24 14:40:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41514 states to 41514 states and 44884 transitions. [2018-10-24 14:40:04,770 INFO L78 Accepts]: Start accepts. Automaton has 41514 states and 44884 transitions. Word has length 486 [2018-10-24 14:40:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:04,771 INFO L481 AbstractCegarLoop]: Abstraction has 41514 states and 44884 transitions. [2018-10-24 14:40:04,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:40:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 41514 states and 44884 transitions. [2018-10-24 14:40:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-10-24 14:40:04,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:04,786 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:40:04,786 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:04,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:04,786 INFO L82 PathProgramCache]: Analyzing trace with hash 549928523, now seen corresponding path program 1 times [2018-10-24 14:40:04,787 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:04,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:04,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-10-24 14:40:05,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:40:05,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:40:05,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:40:05,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:40:05,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:40:05,250 INFO L87 Difference]: Start difference. First operand 41514 states and 44884 transitions. Second operand 3 states. [2018-10-24 14:40:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:08,972 INFO L93 Difference]: Finished difference Result 83026 states and 89766 transitions. [2018-10-24 14:40:08,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:40:08,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 500 [2018-10-24 14:40:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:09,032 INFO L225 Difference]: With dead ends: 83026 [2018-10-24 14:40:09,032 INFO L226 Difference]: Without dead ends: 41514 [2018-10-24 14:40:09,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:40:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41514 states. [2018-10-24 14:40:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41514 to 41514. [2018-10-24 14:40:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41514 states. [2018-10-24 14:40:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41514 states to 41514 states and 44211 transitions. [2018-10-24 14:40:09,562 INFO L78 Accepts]: Start accepts. Automaton has 41514 states and 44211 transitions. Word has length 500 [2018-10-24 14:40:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:09,563 INFO L481 AbstractCegarLoop]: Abstraction has 41514 states and 44211 transitions. [2018-10-24 14:40:09,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:40:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 41514 states and 44211 transitions. [2018-10-24 14:40:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-24 14:40:09,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:09,587 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:40:09,587 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:09,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:09,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1283912118, now seen corresponding path program 1 times [2018-10-24 14:40:09,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:09,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:09,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:10,382 WARN L179 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-24 14:40:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-24 14:40:11,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:40:11,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:40:11,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:40:11,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:40:11,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:11,168 INFO L87 Difference]: Start difference. First operand 41514 states and 44211 transitions. Second operand 4 states. [2018-10-24 14:40:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:16,823 INFO L93 Difference]: Finished difference Result 112739 states and 120109 transitions. [2018-10-24 14:40:16,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:40:16,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 672 [2018-10-24 14:40:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:16,914 INFO L225 Difference]: With dead ends: 112739 [2018-10-24 14:40:16,914 INFO L226 Difference]: Without dead ends: 71227 [2018-10-24 14:40:16,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71227 states. [2018-10-24 14:40:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71227 to 69154. [2018-10-24 14:40:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69154 states. [2018-10-24 14:40:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69154 states to 69154 states and 73060 transitions. [2018-10-24 14:40:17,740 INFO L78 Accepts]: Start accepts. Automaton has 69154 states and 73060 transitions. Word has length 672 [2018-10-24 14:40:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:17,741 INFO L481 AbstractCegarLoop]: Abstraction has 69154 states and 73060 transitions. [2018-10-24 14:40:17,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:40:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 69154 states and 73060 transitions. [2018-10-24 14:40:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2018-10-24 14:40:17,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:17,766 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:40:17,767 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:17,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:17,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1436147149, now seen corresponding path program 1 times [2018-10-24 14:40:17,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:17,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:17,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:17,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:17,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2018-10-24 14:40:18,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:40:18,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:40:18,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:40:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:40:18,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:18,828 INFO L87 Difference]: Start difference. First operand 69154 states and 73060 transitions. Second operand 4 states. [2018-10-24 14:40:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:23,773 INFO L93 Difference]: Finished difference Result 138306 states and 146118 transitions. [2018-10-24 14:40:23,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:40:23,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 691 [2018-10-24 14:40:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:23,855 INFO L225 Difference]: With dead ends: 138306 [2018-10-24 14:40:23,855 INFO L226 Difference]: Without dead ends: 61534 [2018-10-24 14:40:23,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:23,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61534 states. [2018-10-24 14:40:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61534 to 60843. [2018-10-24 14:40:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60843 states. [2018-10-24 14:40:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60843 states to 60843 states and 63409 transitions. [2018-10-24 14:40:24,586 INFO L78 Accepts]: Start accepts. Automaton has 60843 states and 63409 transitions. Word has length 691 [2018-10-24 14:40:24,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:24,587 INFO L481 AbstractCegarLoop]: Abstraction has 60843 states and 63409 transitions. [2018-10-24 14:40:24,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:40:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 60843 states and 63409 transitions. [2018-10-24 14:40:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-10-24 14:40:24,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:24,633 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:40:24,634 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:24,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2075316396, now seen corresponding path program 1 times [2018-10-24 14:40:24,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:24,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:24,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:25,244 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 14:40:25,572 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-10-24 14:40:26,004 WARN L179 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-10-24 14:40:26,184 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 4 [2018-10-24 14:40:26,372 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 4 [2018-10-24 14:40:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 485 proven. 634 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-10-24 14:40:28,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:40:28,116 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:40:28,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:28,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:40:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2018-10-24 14:40:28,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:40:28,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2018-10-24 14:40:28,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 14:40:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 14:40:28,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:40:28,748 INFO L87 Difference]: Start difference. First operand 60843 states and 63409 transitions. Second operand 10 states. [2018-10-24 14:40:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:41,254 INFO L93 Difference]: Finished difference Result 146011 states and 152186 transitions. [2018-10-24 14:40:41,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 14:40:41,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 880 [2018-10-24 14:40:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:41,340 INFO L225 Difference]: With dead ends: 146011 [2018-10-24 14:40:41,340 INFO L226 Difference]: Without dead ends: 85170 [2018-10-24 14:40:41,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 888 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-10-24 14:40:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85170 states. [2018-10-24 14:40:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85170 to 57388. [2018-10-24 14:40:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57388 states. [2018-10-24 14:40:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57388 states to 57388 states and 59278 transitions. [2018-10-24 14:40:41,989 INFO L78 Accepts]: Start accepts. Automaton has 57388 states and 59278 transitions. Word has length 880 [2018-10-24 14:40:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:41,989 INFO L481 AbstractCegarLoop]: Abstraction has 57388 states and 59278 transitions. [2018-10-24 14:40:41,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 14:40:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 57388 states and 59278 transitions. [2018-10-24 14:40:42,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1459 [2018-10-24 14:40:42,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:42,047 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:40:42,047 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:42,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:42,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1606200496, now seen corresponding path program 1 times [2018-10-24 14:40:42,048 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:42,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:42,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:42,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:42,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 968 proven. 0 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2018-10-24 14:40:44,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:40:44,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:40:44,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:40:44,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:40:44,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:44,438 INFO L87 Difference]: Start difference. First operand 57388 states and 59278 transitions. Second operand 4 states. [2018-10-24 14:40:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:48,983 INFO L93 Difference]: Finished difference Result 118919 states and 122781 transitions. [2018-10-24 14:40:48,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:40:48,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1458 [2018-10-24 14:40:48,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:49,061 INFO L225 Difference]: With dead ends: 118919 [2018-10-24 14:40:49,062 INFO L226 Difference]: Without dead ends: 62224 [2018-10-24 14:40:49,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62224 states. [2018-10-24 14:40:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62224 to 58077. [2018-10-24 14:40:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58077 states. [2018-10-24 14:40:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58077 states to 58077 states and 59663 transitions. [2018-10-24 14:40:49,681 INFO L78 Accepts]: Start accepts. Automaton has 58077 states and 59663 transitions. Word has length 1458 [2018-10-24 14:40:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:49,683 INFO L481 AbstractCegarLoop]: Abstraction has 58077 states and 59663 transitions. [2018-10-24 14:40:49,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:40:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 58077 states and 59663 transitions. [2018-10-24 14:40:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1461 [2018-10-24 14:40:49,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:49,712 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:40:49,712 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:49,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash 112847083, now seen corresponding path program 1 times [2018-10-24 14:40:49,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:49,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:49,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:49,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:49,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:40:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 1426 proven. 0 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2018-10-24 14:40:52,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:40:52,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:40:52,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:40:52,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:40:52,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:52,112 INFO L87 Difference]: Start difference. First operand 58077 states and 59663 transitions. Second operand 4 states. [2018-10-24 14:40:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:40:57,176 INFO L93 Difference]: Finished difference Result 155541 states and 160298 transitions. [2018-10-24 14:40:57,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:40:57,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1460 [2018-10-24 14:40:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:40:57,268 INFO L225 Difference]: With dead ends: 155541 [2018-10-24 14:40:57,268 INFO L226 Difference]: Without dead ends: 96769 [2018-10-24 14:40:57,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:40:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96769 states. [2018-10-24 14:40:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96769 to 92623. [2018-10-24 14:40:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92623 states. [2018-10-24 14:40:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92623 states to 92623 states and 95239 transitions. [2018-10-24 14:40:58,139 INFO L78 Accepts]: Start accepts. Automaton has 92623 states and 95239 transitions. Word has length 1460 [2018-10-24 14:40:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:40:58,140 INFO L481 AbstractCegarLoop]: Abstraction has 92623 states and 95239 transitions. [2018-10-24 14:40:58,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:40:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 92623 states and 95239 transitions. [2018-10-24 14:40:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1470 [2018-10-24 14:40:58,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:40:58,168 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:40:58,168 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:40:58,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:40:58,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1179951149, now seen corresponding path program 1 times [2018-10-24 14:40:58,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:40:58,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:40:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:58,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:40:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:40:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:41:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 1313 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2018-10-24 14:41:00,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:41:00,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:41:00,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:41:00,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:41:00,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:41:00,250 INFO L87 Difference]: Start difference. First operand 92623 states and 95239 transitions. Second operand 4 states. [2018-10-24 14:41:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:41:05,147 INFO L93 Difference]: Finished difference Result 196989 states and 202787 transitions. [2018-10-24 14:41:05,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:41:05,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1469 [2018-10-24 14:41:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:41:05,275 INFO L225 Difference]: With dead ends: 196989 [2018-10-24 14:41:05,276 INFO L226 Difference]: Without dead ends: 104367 [2018-10-24 14:41:05,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:41:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104367 states. [2018-10-24 14:41:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104367 to 100912. [2018-10-24 14:41:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100912 states. [2018-10-24 14:41:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100912 states to 100912 states and 103518 transitions. [2018-10-24 14:41:06,149 INFO L78 Accepts]: Start accepts. Automaton has 100912 states and 103518 transitions. Word has length 1469 [2018-10-24 14:41:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:41:06,150 INFO L481 AbstractCegarLoop]: Abstraction has 100912 states and 103518 transitions. [2018-10-24 14:41:06,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:41:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 100912 states and 103518 transitions. [2018-10-24 14:41:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1602 [2018-10-24 14:41:06,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:41:06,190 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:41:06,190 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:41:06,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:41:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2087794636, now seen corresponding path program 1 times [2018-10-24 14:41:06,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:41:06,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:41:06,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:41:06,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:41:06,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:41:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:41:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 1819 proven. 0 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2018-10-24 14:41:08,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:41:08,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:41:08,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:41:08,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:41:08,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:41:08,543 INFO L87 Difference]: Start difference. First operand 100912 states and 103518 transitions. Second operand 3 states. [2018-10-24 14:41:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:41:11,689 INFO L93 Difference]: Finished difference Result 203204 states and 208454 transitions. [2018-10-24 14:41:11,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:41:11,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1601 [2018-10-24 14:41:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:41:11,785 INFO L225 Difference]: With dead ends: 203204 [2018-10-24 14:41:11,785 INFO L226 Difference]: Without dead ends: 102985 [2018-10-24 14:41:11,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:41:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102985 states. [2018-10-24 14:41:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102985 to 102294. [2018-10-24 14:41:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102294 states. [2018-10-24 14:41:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102294 states to 102294 states and 104901 transitions. [2018-10-24 14:41:12,672 INFO L78 Accepts]: Start accepts. Automaton has 102294 states and 104901 transitions. Word has length 1601 [2018-10-24 14:41:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:41:12,673 INFO L481 AbstractCegarLoop]: Abstraction has 102294 states and 104901 transitions. [2018-10-24 14:41:12,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:41:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 102294 states and 104901 transitions. [2018-10-24 14:41:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2018-10-24 14:41:12,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:41:12,715 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:41:12,715 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:41:12,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:41:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash -503979299, now seen corresponding path program 1 times [2018-10-24 14:41:12,716 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:41:12,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:41:12,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:41:12,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:41:12,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:41:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:41:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 1867 proven. 216 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-10-24 14:41:15,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:41:15,603 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:41:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:41:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:41:15,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:41:16,392 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2018-10-24 14:41:21,226 WARN L179 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-10-24 14:41:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 1867 proven. 216 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-10-24 14:41:29,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:41:29,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-10-24 14:41:29,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 14:41:29,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 14:41:29,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-24 14:41:29,709 INFO L87 Difference]: Start difference. First operand 102294 states and 104901 transitions. Second operand 9 states. [2018-10-24 14:41:41,025 WARN L179 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2018-10-24 14:42:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:42:00,398 INFO L93 Difference]: Finished difference Result 243974 states and 250340 transitions. [2018-10-24 14:42:00,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 14:42:00,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1621 [2018-10-24 14:42:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:42:00,542 INFO L225 Difference]: With dead ends: 243974 [2018-10-24 14:42:00,542 INFO L226 Difference]: Without dead ends: 142373 [2018-10-24 14:42:00,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1632 GetRequests, 1622 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-10-24 14:42:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142373 states. [2018-10-24 14:42:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142373 to 107820. [2018-10-24 14:42:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107820 states. [2018-10-24 14:42:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107820 states to 107820 states and 110537 transitions. [2018-10-24 14:42:01,636 INFO L78 Accepts]: Start accepts. Automaton has 107820 states and 110537 transitions. Word has length 1621 [2018-10-24 14:42:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:42:01,637 INFO L481 AbstractCegarLoop]: Abstraction has 107820 states and 110537 transitions. [2018-10-24 14:42:01,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 14:42:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 107820 states and 110537 transitions. [2018-10-24 14:42:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1730 [2018-10-24 14:42:01,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:42:01,678 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:42:01,678 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:42:01,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:42:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1476599274, now seen corresponding path program 2 times [2018-10-24 14:42:01,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:42:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:42:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:42:01,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:42:01,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:42:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:42:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 2210 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-10-24 14:42:04,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:42:04,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:42:04,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:42:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:42:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:42:04,009 INFO L87 Difference]: Start difference. First operand 107820 states and 110537 transitions. Second operand 4 states. [2018-10-24 14:42:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:42:09,169 INFO L93 Difference]: Finished difference Result 214947 states and 220380 transitions. [2018-10-24 14:42:09,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:42:09,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1729 [2018-10-24 14:42:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:42:09,296 INFO L225 Difference]: With dead ends: 214947 [2018-10-24 14:42:09,296 INFO L226 Difference]: Without dead ends: 105050 [2018-10-24 14:42:09,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:42:09,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105050 states. [2018-10-24 14:42:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105050 to 103668. [2018-10-24 14:42:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103668 states. [2018-10-24 14:42:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103668 states to 103668 states and 105712 transitions. [2018-10-24 14:42:10,255 INFO L78 Accepts]: Start accepts. Automaton has 103668 states and 105712 transitions. Word has length 1729 [2018-10-24 14:42:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:42:10,256 INFO L481 AbstractCegarLoop]: Abstraction has 103668 states and 105712 transitions. [2018-10-24 14:42:10,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:42:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 103668 states and 105712 transitions. [2018-10-24 14:42:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1758 [2018-10-24 14:42:10,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:42:10,310 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:42:10,310 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:42:10,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:42:10,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1828532863, now seen corresponding path program 1 times [2018-10-24 14:42:10,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:42:10,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:42:10,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:42:10,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 14:42:10,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:42:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:42:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 823 proven. 1793 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-10-24 14:42:16,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:42:16,928 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:42:16,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:42:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:42:17,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:42:17,829 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-10-24 14:42:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 963 proven. 1653 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-10-24 14:42:21,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 14:42:21,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 12 [2018-10-24 14:42:21,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 14:42:21,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 14:42:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-24 14:42:21,808 INFO L87 Difference]: Start difference. First operand 103668 states and 105712 transitions. Second operand 13 states. Received shutdown request... [2018-10-24 14:42:41,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 14:42:41,494 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:42:41,500 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:42:41,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:42:41 BoogieIcfgContainer [2018-10-24 14:42:41,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:42:41,501 INFO L168 Benchmark]: Toolchain (without parser) took 227179.84 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -511.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-24 14:42:41,502 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:42:41,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1768.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-24 14:42:41,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 526.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -913.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:42:41,505 INFO L168 Benchmark]: Boogie Preprocessor took 208.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2018-10-24 14:42:41,506 INFO L168 Benchmark]: RCFGBuilder took 9523.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 538.7 MB). Peak memory consumption was 538.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:42:41,506 INFO L168 Benchmark]: TraceAbstraction took 215147.05 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 1.6 GB in the beginning and 1.9 GB in the end (delta: -314.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-10-24 14:42:41,512 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1768.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 526.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -913.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 208.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9523.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 538.7 MB). Peak memory consumption was 538.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 215147.05 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 1.6 GB in the beginning and 1.9 GB in the end (delta: -314.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (103668states) and FLOYD_HOARE automaton (currently 20 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (53324 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 758 locations, 1 error locations. TIMEOUT Result, 215.0s OverallTime, 18 OverallIterations, 8 TraceHistogramMax, 152.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8014 SDtfs, 37870 SDslu, 1600 SDs, 0 SdLazy, 94078 SolverSat, 11953 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 119.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5262 GetRequests, 5155 SyntacticMatches, 24 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107820occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 83773 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 20951 NumberOfCodeBlocks, 20951 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 20928 ConstructedInterpolants, 549 QuantifiedInterpolants, 123492211 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5964 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 24747/29266 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown