java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 20:23:34,326 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 20:23:34,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 20:23:34,346 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 20:23:34,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 20:23:34,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 20:23:34,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 20:23:34,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 20:23:34,354 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 20:23:34,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 20:23:34,365 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 20:23:34,365 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 20:23:34,366 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 20:23:34,370 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 20:23:34,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 20:23:34,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 20:23:34,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 20:23:34,380 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 20:23:34,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 20:23:34,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 20:23:34,391 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 20:23:34,392 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 20:23:34,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 20:23:34,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 20:23:34,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 20:23:34,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 20:23:34,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 20:23:34,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 20:23:34,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 20:23:34,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 20:23:34,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 20:23:34,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 20:23:34,406 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 20:23:34,406 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 20:23:34,407 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 20:23:34,408 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 20:23:34,409 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-23 20:23:34,436 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 20:23:34,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 20:23:34,438 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 20:23:34,438 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 20:23:34,439 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 20:23:34,439 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 20:23:34,439 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 20:23:34,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 20:23:34,440 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 20:23:34,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 20:23:34,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 20:23:34,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 20:23:34,441 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 20:23:34,441 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 20:23:34,442 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 20:23:34,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 20:23:34,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 20:23:34,442 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 20:23:34,442 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 20:23:34,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:23:34,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 20:23:34,444 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 20:23:34,444 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 20:23:34,445 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 20:23:34,445 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 20:23:34,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 20:23:34,445 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 20:23:34,445 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 20:23:34,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 20:23:34,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 20:23:34,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 20:23:34,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 20:23:34,541 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 20:23:34,542 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label59_true-unreach-call.c [2018-10-23 20:23:34,607 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/159af5c53/b84109aeddf34c3aacc6c3fa0e99dbf2/FLAG035f19a7f [2018-10-23 20:23:35,397 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 20:23:35,398 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label59_true-unreach-call.c [2018-10-23 20:23:35,436 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/159af5c53/b84109aeddf34c3aacc6c3fa0e99dbf2/FLAG035f19a7f [2018-10-23 20:23:35,458 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/159af5c53/b84109aeddf34c3aacc6c3fa0e99dbf2 [2018-10-23 20:23:35,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 20:23:35,473 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 20:23:35,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 20:23:35,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 20:23:35,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 20:23:35,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:23:35" (1/1) ... [2018-10-23 20:23:35,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0e4d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:35, skipping insertion in model container [2018-10-23 20:23:35,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:23:35" (1/1) ... [2018-10-23 20:23:35,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 20:23:35,679 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 20:23:37,317 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:23:37,321 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 20:23:38,008 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:23:38,046 INFO L193 MainTranslator]: Completed translation [2018-10-23 20:23:38,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38 WrapperNode [2018-10-23 20:23:38,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 20:23:38,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 20:23:38,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 20:23:38,048 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 20:23:38,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (1/1) ... [2018-10-23 20:23:38,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (1/1) ... [2018-10-23 20:23:38,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 20:23:38,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 20:23:38,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 20:23:38,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 20:23:38,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (1/1) ... [2018-10-23 20:23:38,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (1/1) ... [2018-10-23 20:23:38,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (1/1) ... [2018-10-23 20:23:38,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (1/1) ... [2018-10-23 20:23:39,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (1/1) ... [2018-10-23 20:23:39,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (1/1) ... [2018-10-23 20:23:39,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (1/1) ... [2018-10-23 20:23:39,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 20:23:39,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 20:23:39,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 20:23:39,308 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 20:23:39,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:23:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 20:23:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 20:23:39,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 20:23:58,750 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 20:23:58,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:23:58 BoogieIcfgContainer [2018-10-23 20:23:58,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 20:23:58,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 20:23:58,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 20:23:58,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 20:23:58,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:23:35" (1/3) ... [2018-10-23 20:23:58,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4f76ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:23:58, skipping insertion in model container [2018-10-23 20:23:58,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:23:38" (2/3) ... [2018-10-23 20:23:58,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4f76ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:23:58, skipping insertion in model container [2018-10-23 20:23:58,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:23:58" (3/3) ... [2018-10-23 20:23:58,760 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label59_true-unreach-call.c [2018-10-23 20:23:58,770 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 20:23:58,780 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 20:23:58,797 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 20:23:58,839 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 20:23:58,840 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 20:23:58,840 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 20:23:58,841 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 20:23:58,841 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 20:23:58,841 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 20:23:58,841 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 20:23:58,841 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 20:23:58,841 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 20:23:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-10-23 20:23:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-23 20:23:58,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:23:58,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:23:58,892 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:23:58,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:23:58,898 INFO L82 PathProgramCache]: Analyzing trace with hash 84973194, now seen corresponding path program 1 times [2018-10-23 20:23:58,901 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:23:58,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:23:58,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:23:58,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:23:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:23:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:23:59,363 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-23 20:23:59,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:23:59,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:23:59,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:23:59,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:23:59,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:23:59,391 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-10-23 20:24:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:24:15,257 INFO L93 Difference]: Finished difference Result 3993 states and 7498 transitions. [2018-10-23 20:24:15,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:24:15,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-10-23 20:24:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:24:15,308 INFO L225 Difference]: With dead ends: 3993 [2018-10-23 20:24:15,308 INFO L226 Difference]: Without dead ends: 2887 [2018-10-23 20:24:15,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:24:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-23 20:24:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1936. [2018-10-23 20:24:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-10-23 20:24:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 3550 transitions. [2018-10-23 20:24:15,483 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 3550 transitions. Word has length 47 [2018-10-23 20:24:15,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:24:15,486 INFO L481 AbstractCegarLoop]: Abstraction has 1936 states and 3550 transitions. [2018-10-23 20:24:15,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:24:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 3550 transitions. [2018-10-23 20:24:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-23 20:24:15,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:24:15,492 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-23 20:24:15,492 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:24:15,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:24:15,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1478720018, now seen corresponding path program 1 times [2018-10-23 20:24:15,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:24:15,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:24:15,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:24:15,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:24:15,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:24:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:24:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:24:15,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:24:15,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:24:15,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:24:15,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:24:15,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:24:15,704 INFO L87 Difference]: Start difference. First operand 1936 states and 3550 transitions. Second operand 4 states. [2018-10-23 20:24:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:24:29,883 INFO L93 Difference]: Finished difference Result 7121 states and 13344 transitions. [2018-10-23 20:24:29,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:24:29,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-10-23 20:24:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:24:29,922 INFO L225 Difference]: With dead ends: 7121 [2018-10-23 20:24:29,922 INFO L226 Difference]: Without dead ends: 5187 [2018-10-23 20:24:29,927 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-23 20:24:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2018-10-23 20:24:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 3554. [2018-10-23 20:24:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3554 states. [2018-10-23 20:24:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 6248 transitions. [2018-10-23 20:24:30,027 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 6248 transitions. Word has length 116 [2018-10-23 20:24:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:24:30,027 INFO L481 AbstractCegarLoop]: Abstraction has 3554 states and 6248 transitions. [2018-10-23 20:24:30,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:24:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 6248 transitions. [2018-10-23 20:24:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-23 20:24:30,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:24:30,043 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:24:30,043 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:24:30,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:24:30,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1173691703, now seen corresponding path program 1 times [2018-10-23 20:24:30,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:24:30,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:24:30,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:24:30,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:24:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:24:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:24:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:24:30,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:24:30,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:24:30,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:24:30,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:24:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:24:30,394 INFO L87 Difference]: Start difference. First operand 3554 states and 6248 transitions. Second operand 4 states. [2018-10-23 20:24:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:24:40,775 INFO L93 Difference]: Finished difference Result 12675 states and 22438 transitions. [2018-10-23 20:24:40,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:24:40,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-10-23 20:24:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:24:40,820 INFO L225 Difference]: With dead ends: 12675 [2018-10-23 20:24:40,820 INFO L226 Difference]: Without dead ends: 9123 [2018-10-23 20:24:40,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:24:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9123 states. [2018-10-23 20:24:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9123 to 9114. [2018-10-23 20:24:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9114 states. [2018-10-23 20:24:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9114 states to 9114 states and 14198 transitions. [2018-10-23 20:24:40,999 INFO L78 Accepts]: Start accepts. Automaton has 9114 states and 14198 transitions. Word has length 129 [2018-10-23 20:24:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:24:41,002 INFO L481 AbstractCegarLoop]: Abstraction has 9114 states and 14198 transitions. [2018-10-23 20:24:41,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:24:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 9114 states and 14198 transitions. [2018-10-23 20:24:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-23 20:24:41,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:24:41,005 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:24:41,008 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:24:41,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:24:41,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1646340827, now seen corresponding path program 1 times [2018-10-23 20:24:41,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:24:41,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:24:41,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:24:41,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:24:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:24:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:24:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:24:41,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:24:41,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:24:41,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:24:41,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:24:41,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:24:41,369 INFO L87 Difference]: Start difference. First operand 9114 states and 14198 transitions. Second operand 4 states. [2018-10-23 20:24:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:24:52,230 INFO L93 Difference]: Finished difference Result 34810 states and 54374 transitions. [2018-10-23 20:24:52,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:24:52,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-10-23 20:24:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:24:52,319 INFO L225 Difference]: With dead ends: 34810 [2018-10-23 20:24:52,319 INFO L226 Difference]: Without dead ends: 25698 [2018-10-23 20:24:52,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:24:52,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25698 states. [2018-10-23 20:24:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25698 to 25672. [2018-10-23 20:24:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25672 states. [2018-10-23 20:24:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25672 states to 25672 states and 35622 transitions. [2018-10-23 20:24:52,744 INFO L78 Accepts]: Start accepts. Automaton has 25672 states and 35622 transitions. Word has length 149 [2018-10-23 20:24:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:24:52,745 INFO L481 AbstractCegarLoop]: Abstraction has 25672 states and 35622 transitions. [2018-10-23 20:24:52,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:24:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 25672 states and 35622 transitions. [2018-10-23 20:24:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-23 20:24:52,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:24:52,749 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:24:52,749 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:24:52,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:24:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1360927528, now seen corresponding path program 1 times [2018-10-23 20:24:52,750 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:24:52,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:24:52,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:24:52,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:24:52,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:24:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:24:53,208 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 20:24:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:24:53,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:24:53,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:24:53,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:24:53,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:24:53,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:24:53,305 INFO L87 Difference]: Start difference. First operand 25672 states and 35622 transitions. Second operand 5 states. [2018-10-23 20:25:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:25:09,218 INFO L93 Difference]: Finished difference Result 70396 states and 95032 transitions. [2018-10-23 20:25:09,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:25:09,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2018-10-23 20:25:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:25:09,299 INFO L225 Difference]: With dead ends: 70396 [2018-10-23 20:25:09,299 INFO L226 Difference]: Without dead ends: 44726 [2018-10-23 20:25:09,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:25:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44726 states. [2018-10-23 20:25:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44726 to 35970. [2018-10-23 20:25:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35970 states. [2018-10-23 20:25:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35970 states to 35970 states and 48841 transitions. [2018-10-23 20:25:10,298 INFO L78 Accepts]: Start accepts. Automaton has 35970 states and 48841 transitions. Word has length 164 [2018-10-23 20:25:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:25:10,298 INFO L481 AbstractCegarLoop]: Abstraction has 35970 states and 48841 transitions. [2018-10-23 20:25:10,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:25:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 35970 states and 48841 transitions. [2018-10-23 20:25:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-23 20:25:10,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:25:10,303 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:25:10,304 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:25:10,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:25:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1467180770, now seen corresponding path program 1 times [2018-10-23 20:25:10,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:25:10,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:25:10,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:25:10,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:25:10,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:25:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:25:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:25:10,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:25:10,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:25:10,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:25:10,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:25:10,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:25:10,485 INFO L87 Difference]: Start difference. First operand 35970 states and 48841 transitions. Second operand 3 states. [2018-10-23 20:25:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:25:19,872 INFO L93 Difference]: Finished difference Result 99513 states and 135532 transitions. [2018-10-23 20:25:19,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:25:19,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-10-23 20:25:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:25:19,976 INFO L225 Difference]: With dead ends: 99513 [2018-10-23 20:25:19,976 INFO L226 Difference]: Without dead ends: 63545 [2018-10-23 20:25:20,023 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-23 20:25:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63545 states. [2018-10-23 20:25:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63545 to 63540. [2018-10-23 20:25:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63540 states. [2018-10-23 20:25:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63540 states to 63540 states and 81292 transitions. [2018-10-23 20:25:20,740 INFO L78 Accepts]: Start accepts. Automaton has 63540 states and 81292 transitions. Word has length 173 [2018-10-23 20:25:20,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:25:20,741 INFO L481 AbstractCegarLoop]: Abstraction has 63540 states and 81292 transitions. [2018-10-23 20:25:20,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:25:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 63540 states and 81292 transitions. [2018-10-23 20:25:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-23 20:25:20,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:25:20,748 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:25:20,748 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:25:20,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:25:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash -861895457, now seen corresponding path program 1 times [2018-10-23 20:25:20,749 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:25:20,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:25:20,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:25:20,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:25:20,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:25:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:25:21,103 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-23 20:25:21,767 WARN L179 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-10-23 20:25:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-23 20:25:21,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:25:21,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:25:21,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:25:21,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:25:21,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:25:21,867 INFO L87 Difference]: Start difference. First operand 63540 states and 81292 transitions. Second operand 5 states. [2018-10-23 20:25:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:25:33,830 INFO L93 Difference]: Finished difference Result 131795 states and 167772 transitions. [2018-10-23 20:25:33,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:25:33,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2018-10-23 20:25:33,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:25:33,932 INFO L225 Difference]: With dead ends: 131795 [2018-10-23 20:25:33,933 INFO L226 Difference]: Without dead ends: 68257 [2018-10-23 20:25:33,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-23 20:25:34,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68257 states. [2018-10-23 20:25:34,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68257 to 68254. [2018-10-23 20:25:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68254 states. [2018-10-23 20:25:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68254 states to 68254 states and 80958 transitions. [2018-10-23 20:25:35,454 INFO L78 Accepts]: Start accepts. Automaton has 68254 states and 80958 transitions. Word has length 238 [2018-10-23 20:25:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:25:35,455 INFO L481 AbstractCegarLoop]: Abstraction has 68254 states and 80958 transitions. [2018-10-23 20:25:35,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:25:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 68254 states and 80958 transitions. [2018-10-23 20:25:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-23 20:25:35,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:25:35,463 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:25:35,463 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:25:35,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:25:35,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1508609838, now seen corresponding path program 1 times [2018-10-23 20:25:35,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:25:35,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:25:35,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:25:35,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:25:35,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:25:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:25:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:25:35,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:25:35,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:25:35,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:25:35,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:25:35,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:25:35,860 INFO L87 Difference]: Start difference. First operand 68254 states and 80958 transitions. Second operand 4 states. [2018-10-23 20:25:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:25:46,521 INFO L93 Difference]: Finished difference Result 184564 states and 219554 transitions. [2018-10-23 20:25:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:25:46,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2018-10-23 20:25:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:25:46,645 INFO L225 Difference]: With dead ends: 184564 [2018-10-23 20:25:46,646 INFO L226 Difference]: Without dead ends: 103656 [2018-10-23 20:25:46,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:25:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103656 states. [2018-10-23 20:25:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103656 to 94193. [2018-10-23 20:25:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94193 states. [2018-10-23 20:25:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94193 states to 94193 states and 106655 transitions. [2018-10-23 20:25:48,275 INFO L78 Accepts]: Start accepts. Automaton has 94193 states and 106655 transitions. Word has length 290 [2018-10-23 20:25:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:25:48,275 INFO L481 AbstractCegarLoop]: Abstraction has 94193 states and 106655 transitions. [2018-10-23 20:25:48,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:25:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 94193 states and 106655 transitions. [2018-10-23 20:25:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-23 20:25:48,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:25:48,282 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 20:25:48,283 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:25:48,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:25:48,283 INFO L82 PathProgramCache]: Analyzing trace with hash 940705466, now seen corresponding path program 1 times [2018-10-23 20:25:48,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:25:48,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:25:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:25:48,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:25:48,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:25:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:25:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-23 20:25:48,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:25:48,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:25:48,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:25:48,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:25:48,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:25:48,549 INFO L87 Difference]: Start difference. First operand 94193 states and 106655 transitions. Second operand 5 states. [2018-10-23 20:26:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:26:10,257 INFO L93 Difference]: Finished difference Result 279319 states and 315591 transitions. [2018-10-23 20:26:10,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:26:10,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2018-10-23 20:26:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:26:10,490 INFO L225 Difference]: With dead ends: 279319 [2018-10-23 20:26:10,490 INFO L226 Difference]: Without dead ends: 185916 [2018-10-23 20:26:10,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:26:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185916 states. [2018-10-23 20:26:12,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185916 to 177837. [2018-10-23 20:26:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177837 states. [2018-10-23 20:26:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177837 states to 177837 states and 198078 transitions. [2018-10-23 20:26:12,218 INFO L78 Accepts]: Start accepts. Automaton has 177837 states and 198078 transitions. Word has length 313 [2018-10-23 20:26:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:26:12,219 INFO L481 AbstractCegarLoop]: Abstraction has 177837 states and 198078 transitions. [2018-10-23 20:26:12,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:26:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 177837 states and 198078 transitions. [2018-10-23 20:26:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-23 20:26:12,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:26:12,227 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:26:12,227 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:26:12,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:26:12,228 INFO L82 PathProgramCache]: Analyzing trace with hash -696697732, now seen corresponding path program 1 times [2018-10-23 20:26:12,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:26:12,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:26:12,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:26:12,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:26:12,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:26:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:26:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-23 20:26:12,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:26:12,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:26:12,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:26:12,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:26:12,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:26:12,545 INFO L87 Difference]: Start difference. First operand 177837 states and 198078 transitions. Second operand 4 states. [2018-10-23 20:26:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:26:24,499 INFO L93 Difference]: Finished difference Result 401425 states and 448238 transitions. [2018-10-23 20:26:24,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:26:24,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2018-10-23 20:26:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:26:24,745 INFO L225 Difference]: With dead ends: 401425 [2018-10-23 20:26:24,746 INFO L226 Difference]: Without dead ends: 223589 [2018-10-23 20:26:24,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:26:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223589 states. [2018-10-23 20:26:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223589 to 219591. [2018-10-23 20:26:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219591 states. [2018-10-23 20:26:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219591 states to 219591 states and 238651 transitions. [2018-10-23 20:26:27,805 INFO L78 Accepts]: Start accepts. Automaton has 219591 states and 238651 transitions. Word has length 371 [2018-10-23 20:26:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:26:27,806 INFO L481 AbstractCegarLoop]: Abstraction has 219591 states and 238651 transitions. [2018-10-23 20:26:27,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:26:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 219591 states and 238651 transitions. [2018-10-23 20:26:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-10-23 20:26:27,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:26:27,811 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:26:27,811 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:26:27,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:26:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash -128696857, now seen corresponding path program 1 times [2018-10-23 20:26:27,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:26:27,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:26:27,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:26:27,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:26:27,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:26:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:26:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-10-23 20:26:28,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:26:28,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:26:28,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:26:28,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:26:28,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:26:28,367 INFO L87 Difference]: Start difference. First operand 219591 states and 238651 transitions. Second operand 4 states. [2018-10-23 20:26:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:26:42,970 INFO L93 Difference]: Finished difference Result 477050 states and 519257 transitions. [2018-10-23 20:26:42,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:26:42,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2018-10-23 20:26:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:26:43,299 INFO L225 Difference]: With dead ends: 477050 [2018-10-23 20:26:43,299 INFO L226 Difference]: Without dead ends: 258249 [2018-10-23 20:26:43,394 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-23 20:26:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258249 states. [2018-10-23 20:26:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258249 to 255039. [2018-10-23 20:26:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255039 states. [2018-10-23 20:26:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255039 states to 255039 states and 272700 transitions. [2018-10-23 20:26:52,822 INFO L78 Accepts]: Start accepts. Automaton has 255039 states and 272700 transitions. Word has length 403 [2018-10-23 20:26:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:26:52,823 INFO L481 AbstractCegarLoop]: Abstraction has 255039 states and 272700 transitions. [2018-10-23 20:26:52,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:26:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 255039 states and 272700 transitions. [2018-10-23 20:26:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-23 20:26:52,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:26:52,830 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:26:52,830 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:26:52,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:26:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash 333666565, now seen corresponding path program 1 times [2018-10-23 20:26:52,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:26:52,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:26:52,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:26:52,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:26:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:26:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:26:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 568 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-10-23 20:26:53,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:26:53,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:26:53,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:26:53,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:26:53,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:26:53,157 INFO L87 Difference]: Start difference. First operand 255039 states and 272700 transitions. Second operand 4 states. [2018-10-23 20:27:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:27:03,847 INFO L93 Difference]: Finished difference Result 503789 states and 538759 transitions. [2018-10-23 20:27:03,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:27:03,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2018-10-23 20:27:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:27:04,144 INFO L225 Difference]: With dead ends: 503789 [2018-10-23 20:27:04,145 INFO L226 Difference]: Without dead ends: 247959 [2018-10-23 20:27:04,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:27:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247959 states. [2018-10-23 20:27:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247959 to 236884. [2018-10-23 20:27:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236884 states. [2018-10-23 20:27:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236884 states to 236884 states and 248068 transitions. [2018-10-23 20:27:07,757 INFO L78 Accepts]: Start accepts. Automaton has 236884 states and 248068 transitions. Word has length 434 [2018-10-23 20:27:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:27:07,758 INFO L481 AbstractCegarLoop]: Abstraction has 236884 states and 248068 transitions. [2018-10-23 20:27:07,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:27:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 236884 states and 248068 transitions. [2018-10-23 20:27:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-10-23 20:27:07,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:27:07,764 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-23 20:27:07,765 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:27:07,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:27:07,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1677922735, now seen corresponding path program 1 times [2018-10-23 20:27:07,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:27:07,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:27:07,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:07,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:27:07,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:27:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-10-23 20:27:08,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:27:08,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:27:08,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:27:08,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:27:08,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:27:08,159 INFO L87 Difference]: Start difference. First operand 236884 states and 248068 transitions. Second operand 3 states. [2018-10-23 20:27:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:27:17,632 INFO L93 Difference]: Finished difference Result 467454 states and 489746 transitions. [2018-10-23 20:27:17,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:27:17,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 483 [2018-10-23 20:27:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:27:17,872 INFO L225 Difference]: With dead ends: 467454 [2018-10-23 20:27:17,872 INFO L226 Difference]: Without dead ends: 231360 [2018-10-23 20:27:17,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:27:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231360 states. [2018-10-23 20:27:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231360 to 225050. [2018-10-23 20:27:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225050 states. [2018-10-23 20:27:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225050 states to 225050 states and 233235 transitions. [2018-10-23 20:27:20,975 INFO L78 Accepts]: Start accepts. Automaton has 225050 states and 233235 transitions. Word has length 483 [2018-10-23 20:27:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:27:20,976 INFO L481 AbstractCegarLoop]: Abstraction has 225050 states and 233235 transitions. [2018-10-23 20:27:20,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:27:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 225050 states and 233235 transitions. [2018-10-23 20:27:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-10-23 20:27:20,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:27:20,995 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:27:20,996 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:27:20,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:27:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash -748852460, now seen corresponding path program 1 times [2018-10-23 20:27:20,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:27:20,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:27:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:20,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:27:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:27:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:27:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 844 proven. 105 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-10-23 20:27:22,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:27:22,564 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-23 20:27:22,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:27:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:27:22,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:27:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 844 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-10-23 20:27:23,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:27:23,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-23 20:27:23,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:27:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:27:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:27:23,192 INFO L87 Difference]: Start difference. First operand 225050 states and 233235 transitions. Second operand 5 states. Received shutdown request... [2018-10-23 20:27:26,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:27:26,835 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 20:27:26,841 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 20:27:26,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:27:26 BoogieIcfgContainer [2018-10-23 20:27:26,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 20:27:26,844 INFO L168 Benchmark]: Toolchain (without parser) took 231372.21 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.3 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-23 20:27:26,845 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-23 20:27:26,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2573.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 232.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 7.1 GB. [2018-10-23 20:27:26,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 856.08 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 822.6 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2018-10-23 20:27:26,847 INFO L168 Benchmark]: Boogie Preprocessor took 403.39 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 74.4 MB). Peak memory consumption was 74.4 MB. Max. memory is 7.1 GB. [2018-10-23 20:27:26,849 INFO L168 Benchmark]: RCFGBuilder took 19443.76 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 241.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 42.7 MB). Peak memory consumption was 588.3 MB. Max. memory is 7.1 GB. [2018-10-23 20:27:26,850 INFO L168 Benchmark]: TraceAbstraction took 208090.30 ms. Allocated memory was 2.6 GB in the beginning and 4.8 GB in the end (delta: 2.2 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -115.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-23 20:27:26,857 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 2573.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 232.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 856.08 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 822.6 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 403.39 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 74.4 MB). Peak memory consumption was 74.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 19443.76 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 241.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 42.7 MB). Peak memory consumption was 588.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 208090.30 ms. Allocated memory was 2.6 GB in the beginning and 4.8 GB in the end (delta: 2.2 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -115.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 150). Cancelled while BasicCegarLoop was constructing difference of abstraction (225050states) and FLOYD_HOARE automaton (currently 4 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (13647 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 208.0s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 174.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10857 SDtfs, 29346 SDslu, 3248 SDs, 0 SdLazy, 62842 SolverSat, 16826 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 138.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 714 GetRequests, 670 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255039occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 26.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 53518 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 4606 NumberOfCodeBlocks, 4606 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4591 ConstructedInterpolants, 0 QuantifiedInterpolants, 3882253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 832 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 5877/5982 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown