java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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_label34_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:19:57,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:19:57,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:19:57,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:19:57,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:19:57,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:19:57,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:19:57,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:19:57,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:19:57,343 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:19:57,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:19:57,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:19:57,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:19:57,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:19:57,347 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:19:57,348 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:19:57,349 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:19:57,354 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:19:57,359 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:19:57,361 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:19:57,362 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:19:57,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:19:57,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:19:57,366 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:19:57,366 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:19:57,367 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:19:57,367 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:19:57,368 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:19:57,369 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:19:57,370 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:19:57,370 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:19:57,371 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:19:57,371 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:19:57,371 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:19:57,372 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:19:57,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:19:57,373 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:19:57,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:19:57,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:19:57,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:19:57,390 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:19:57,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:19:57,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:19:57,391 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:19:57,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:19:57,391 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:19:57,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:19:57,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:19:57,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:19:57,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:19:57,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:19:57,393 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:19:57,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:19:57,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:19:57,393 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:19:57,393 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:19:57,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:19:57,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:19:57,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:19:57,394 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:19:57,394 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:19:57,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:19:57,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:19:57,395 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:19:57,395 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:19:57,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:19:57,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:19:57,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:19:57,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:19:57,465 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:19:57,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label34_true-unreach-call.c [2018-11-06 21:19:57,536 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6806419/01e33a32a4c14181b7193aa33b42081c/FLAGc57c43c0e [2018-11-06 21:19:58,392 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:19:58,393 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label34_true-unreach-call.c [2018-11-06 21:19:58,431 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6806419/01e33a32a4c14181b7193aa33b42081c/FLAGc57c43c0e [2018-11-06 21:19:58,453 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba6806419/01e33a32a4c14181b7193aa33b42081c [2018-11-06 21:19:58,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:19:58,468 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:19:58,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:19:58,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:19:58,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:19:58,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:19:58" (1/1) ... [2018-11-06 21:19:58,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71eebf32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:58, skipping insertion in model container [2018-11-06 21:19:58,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:19:58" (1/1) ... [2018-11-06 21:19:58,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:19:58,678 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:20:00,067 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:20:00,071 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:20:00,794 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:20:00,832 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:20:00,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00 WrapperNode [2018-11-06 21:20:00,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:20:00,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:20:00,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:20:00,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:20:00,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (1/1) ... [2018-11-06 21:20:01,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (1/1) ... [2018-11-06 21:20:01,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:20:01,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:20:01,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:20:01,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:20:01,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (1/1) ... [2018-11-06 21:20:01,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (1/1) ... [2018-11-06 21:20:01,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (1/1) ... [2018-11-06 21:20:01,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (1/1) ... [2018-11-06 21:20:01,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (1/1) ... [2018-11-06 21:20:02,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (1/1) ... [2018-11-06 21:20:02,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (1/1) ... [2018-11-06 21:20:02,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:20:02,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:20:02,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:20:02,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:20:02,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:20:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:20:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:20:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:20:15,250 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:20:15,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:20:15 BoogieIcfgContainer [2018-11-06 21:20:15,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:20:15,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:20:15,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:20:15,255 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:20:15,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:19:58" (1/3) ... [2018-11-06 21:20:15,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b40fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:20:15, skipping insertion in model container [2018-11-06 21:20:15,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:00" (2/3) ... [2018-11-06 21:20:15,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b40fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:20:15, skipping insertion in model container [2018-11-06 21:20:15,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:20:15" (3/3) ... [2018-11-06 21:20:15,259 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label34_true-unreach-call.c [2018-11-06 21:20:15,269 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:20:15,279 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:20:15,298 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:20:15,345 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:20:15,346 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:20:15,346 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:20:15,346 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:20:15,346 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:20:15,347 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:20:15,347 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:20:15,347 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:20:15,347 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:20:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 21:20:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-06 21:20:15,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:20:15,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:20:15,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:20:15,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:20:15,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1848943538, now seen corresponding path program 1 times [2018-11-06 21:20:15,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:20:15,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:20:15,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:15,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:20:15,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:20:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:20:15,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:20:15,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:20:15,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:20:15,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:20:15,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:20:15,941 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 21:20:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:20:28,968 INFO L93 Difference]: Finished difference Result 3896 states and 7286 transitions. [2018-11-06 21:20:28,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:20:28,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-06 21:20:28,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:20:29,023 INFO L225 Difference]: With dead ends: 3896 [2018-11-06 21:20:29,023 INFO L226 Difference]: Without dead ends: 2790 [2018-11-06 21:20:29,032 INFO L604 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-11-06 21:20:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2018-11-06 21:20:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1945. [2018-11-06 21:20:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-06 21:20:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3412 transitions. [2018-11-06 21:20:29,187 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3412 transitions. Word has length 57 [2018-11-06 21:20:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:20:29,188 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 3412 transitions. [2018-11-06 21:20:29,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:20:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3412 transitions. [2018-11-06 21:20:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-06 21:20:29,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:20:29,194 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:20:29,194 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:20:29,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:20:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash 591180937, now seen corresponding path program 1 times [2018-11-06 21:20:29,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:20:29,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:20:29,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:29,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:20:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:20:29,588 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:20:29,866 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 4 [2018-11-06 21:20:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:20:30,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:20:30,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:20:30,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:20:30,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:20:30,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:20:30,100 INFO L87 Difference]: Start difference. First operand 1945 states and 3412 transitions. Second operand 5 states. [2018-11-06 21:20:30,363 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-06 21:20:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:20:45,462 INFO L93 Difference]: Finished difference Result 7061 states and 12475 transitions. [2018-11-06 21:20:45,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:20:45,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2018-11-06 21:20:45,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:20:45,491 INFO L225 Difference]: With dead ends: 7061 [2018-11-06 21:20:45,492 INFO L226 Difference]: Without dead ends: 5118 [2018-11-06 21:20:45,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:20:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2018-11-06 21:20:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 5117. [2018-11-06 21:20:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2018-11-06 21:20:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 7612 transitions. [2018-11-06 21:20:45,600 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 7612 transitions. Word has length 123 [2018-11-06 21:20:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:20:45,601 INFO L480 AbstractCegarLoop]: Abstraction has 5117 states and 7612 transitions. [2018-11-06 21:20:45,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:20:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 7612 transitions. [2018-11-06 21:20:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-06 21:20:45,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:20:45,606 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:20:45,606 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:20:45,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:20:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2132882266, now seen corresponding path program 1 times [2018-11-06 21:20:45,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:20:45,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:20:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:45,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:20:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:20:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:20:45,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:20:45,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:20:45,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:20:45,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:20:45,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:20:45,817 INFO L87 Difference]: Start difference. First operand 5117 states and 7612 transitions. Second operand 3 states. [2018-11-06 21:20:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:20:50,349 INFO L93 Difference]: Finished difference Result 10220 states and 15517 transitions. [2018-11-06 21:20:50,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:20:50,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-11-06 21:20:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:20:50,379 INFO L225 Difference]: With dead ends: 10220 [2018-11-06 21:20:50,379 INFO L226 Difference]: Without dead ends: 5893 [2018-11-06 21:20:50,387 INFO L604 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-11-06 21:20:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5893 states. [2018-11-06 21:20:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5893 to 5892. [2018-11-06 21:20:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5892 states. [2018-11-06 21:20:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5892 states to 5892 states and 7437 transitions. [2018-11-06 21:20:50,495 INFO L78 Accepts]: Start accepts. Automaton has 5892 states and 7437 transitions. Word has length 183 [2018-11-06 21:20:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:20:50,496 INFO L480 AbstractCegarLoop]: Abstraction has 5892 states and 7437 transitions. [2018-11-06 21:20:50,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:20:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5892 states and 7437 transitions. [2018-11-06 21:20:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-06 21:20:50,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:20:50,499 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:20:50,500 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:20:50,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:20:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1133001011, now seen corresponding path program 1 times [2018-11-06 21:20:50,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:20:50,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:20:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:50,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:20:50,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:20:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 109 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-06 21:20:50,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:20:50,774 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:20:50,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:20:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:20:50,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:20:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:20:51,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:20:51,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-11-06 21:20:51,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:20:51,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:20:51,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:20:51,012 INFO L87 Difference]: Start difference. First operand 5892 states and 7437 transitions. Second operand 5 states. [2018-11-06 21:21:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:05,142 INFO L93 Difference]: Finished difference Result 20501 states and 27031 transitions. [2018-11-06 21:21:05,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:21:05,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2018-11-06 21:21:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:05,201 INFO L225 Difference]: With dead ends: 20501 [2018-11-06 21:21:05,202 INFO L226 Difference]: Without dead ends: 15399 [2018-11-06 21:21:05,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 221 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-11-06 21:21:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15399 states. [2018-11-06 21:21:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15399 to 10627. [2018-11-06 21:21:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2018-11-06 21:21:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 13141 transitions. [2018-11-06 21:21:05,454 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 13141 transitions. Word has length 222 [2018-11-06 21:21:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:05,454 INFO L480 AbstractCegarLoop]: Abstraction has 10627 states and 13141 transitions. [2018-11-06 21:21:05,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:21:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 13141 transitions. [2018-11-06 21:21:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-06 21:21:05,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:05,459 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, 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, 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-11-06 21:21:05,459 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:05,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 268993022, now seen corresponding path program 1 times [2018-11-06 21:21:05,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:05,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:05,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-06 21:21:05,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:21:05,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:21:05,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:21:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:21:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:21:05,702 INFO L87 Difference]: Start difference. First operand 10627 states and 13141 transitions. Second operand 3 states. [2018-11-06 21:21:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:12,893 INFO L93 Difference]: Finished difference Result 28343 states and 35767 transitions. [2018-11-06 21:21:12,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:21:12,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-11-06 21:21:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:12,932 INFO L225 Difference]: With dead ends: 28343 [2018-11-06 21:21:12,932 INFO L226 Difference]: Without dead ends: 18506 [2018-11-06 21:21:12,947 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:21:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18506 states. [2018-11-06 21:21:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18506 to 18505. [2018-11-06 21:21:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18505 states. [2018-11-06 21:21:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18505 states to 18505 states and 22008 transitions. [2018-11-06 21:21:13,219 INFO L78 Accepts]: Start accepts. Automaton has 18505 states and 22008 transitions. Word has length 233 [2018-11-06 21:21:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:13,219 INFO L480 AbstractCegarLoop]: Abstraction has 18505 states and 22008 transitions. [2018-11-06 21:21:13,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:21:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 18505 states and 22008 transitions. [2018-11-06 21:21:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-06 21:21:13,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:13,225 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, 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, 1, 1, 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-11-06 21:21:13,226 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:13,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:13,226 INFO L82 PathProgramCache]: Analyzing trace with hash 787888975, now seen corresponding path program 1 times [2018-11-06 21:21:13,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:13,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:13,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:13,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:13,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 109 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-06 21:21:13,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:21:13,674 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:21:13,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:13,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:21:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:21:13,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:21:13,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:21:13,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:21:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:21:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:21:13,954 INFO L87 Difference]: Start difference. First operand 18505 states and 22008 transitions. Second operand 4 states. [2018-11-06 21:21:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:22,903 INFO L93 Difference]: Finished difference Result 44141 states and 51712 transitions. [2018-11-06 21:21:22,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:21:22,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 271 [2018-11-06 21:21:22,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:22,950 INFO L225 Difference]: With dead ends: 44141 [2018-11-06 21:21:22,950 INFO L226 Difference]: Without dead ends: 21648 [2018-11-06 21:21:22,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 271 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-11-06 21:21:22,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21648 states. [2018-11-06 21:21:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21648 to 19266. [2018-11-06 21:21:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19266 states. [2018-11-06 21:21:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19266 states to 19266 states and 22668 transitions. [2018-11-06 21:21:23,230 INFO L78 Accepts]: Start accepts. Automaton has 19266 states and 22668 transitions. Word has length 271 [2018-11-06 21:21:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:23,230 INFO L480 AbstractCegarLoop]: Abstraction has 19266 states and 22668 transitions. [2018-11-06 21:21:23,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:21:23,231 INFO L276 IsEmpty]: Start isEmpty. Operand 19266 states and 22668 transitions. [2018-11-06 21:21:23,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-06 21:21:23,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:23,237 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:21:23,237 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:23,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:23,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2055948998, now seen corresponding path program 1 times [2018-11-06 21:21:23,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:23,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:23,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:23,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:23,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:21:23,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:21:23,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:21:23,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:21:23,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:21:23,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:21:23,587 INFO L87 Difference]: Start difference. First operand 19266 states and 22668 transitions. Second operand 4 states. [2018-11-06 21:21:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:31,803 INFO L93 Difference]: Finished difference Result 41683 states and 48797 transitions. [2018-11-06 21:21:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:21:31,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2018-11-06 21:21:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:31,838 INFO L225 Difference]: With dead ends: 41683 [2018-11-06 21:21:31,838 INFO L226 Difference]: Without dead ends: 21594 [2018-11-06 21:21:31,861 INFO L604 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-11-06 21:21:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21594 states. [2018-11-06 21:21:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21594 to 19229. [2018-11-06 21:21:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19229 states. [2018-11-06 21:21:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19229 states to 19229 states and 22239 transitions. [2018-11-06 21:21:32,097 INFO L78 Accepts]: Start accepts. Automaton has 19229 states and 22239 transitions. Word has length 300 [2018-11-06 21:21:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:32,097 INFO L480 AbstractCegarLoop]: Abstraction has 19229 states and 22239 transitions. [2018-11-06 21:21:32,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:21:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 19229 states and 22239 transitions. [2018-11-06 21:21:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-11-06 21:21:32,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:32,104 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:21:32,104 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:32,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:32,104 INFO L82 PathProgramCache]: Analyzing trace with hash -424530140, now seen corresponding path program 1 times [2018-11-06 21:21:32,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:32,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:32,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:32,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:32,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-06 21:21:32,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:21:32,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:21:32,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:21:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:21:32,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:21:32,542 INFO L87 Difference]: Start difference. First operand 19229 states and 22239 transitions. Second operand 4 states. [2018-11-06 21:21:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:41,409 INFO L93 Difference]: Finished difference Result 68437 states and 79694 transitions. [2018-11-06 21:21:41,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:21:41,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 305 [2018-11-06 21:21:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:41,484 INFO L225 Difference]: With dead ends: 68437 [2018-11-06 21:21:41,484 INFO L226 Difference]: Without dead ends: 49206 [2018-11-06 21:21:41,509 INFO L604 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-11-06 21:21:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49206 states. [2018-11-06 21:21:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49206 to 47597. [2018-11-06 21:21:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47597 states. [2018-11-06 21:21:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47597 states to 47597 states and 53239 transitions. [2018-11-06 21:21:42,353 INFO L78 Accepts]: Start accepts. Automaton has 47597 states and 53239 transitions. Word has length 305 [2018-11-06 21:21:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:42,354 INFO L480 AbstractCegarLoop]: Abstraction has 47597 states and 53239 transitions. [2018-11-06 21:21:42,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:21:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 47597 states and 53239 transitions. [2018-11-06 21:21:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-06 21:21:42,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:42,370 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, 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, 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-11-06 21:21:42,370 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:42,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash 966754319, now seen corresponding path program 1 times [2018-11-06 21:21:42,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:42,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:42,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-11-06 21:21:42,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:21:42,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:21:42,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:21:42,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:21:42,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:21:42,784 INFO L87 Difference]: Start difference. First operand 47597 states and 53239 transitions. Second operand 3 states. [2018-11-06 21:21:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:47,445 INFO L93 Difference]: Finished difference Result 94403 states and 105685 transitions. [2018-11-06 21:21:47,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:21:47,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2018-11-06 21:21:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:47,509 INFO L225 Difference]: With dead ends: 94403 [2018-11-06 21:21:47,509 INFO L226 Difference]: Without dead ends: 47596 [2018-11-06 21:21:47,544 INFO L604 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-11-06 21:21:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47596 states. [2018-11-06 21:21:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47596 to 47595. [2018-11-06 21:21:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47595 states. [2018-11-06 21:21:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47595 states to 47595 states and 51851 transitions. [2018-11-06 21:21:48,142 INFO L78 Accepts]: Start accepts. Automaton has 47595 states and 51851 transitions. Word has length 413 [2018-11-06 21:21:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:48,143 INFO L480 AbstractCegarLoop]: Abstraction has 47595 states and 51851 transitions. [2018-11-06 21:21:48,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:21:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 47595 states and 51851 transitions. [2018-11-06 21:21:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2018-11-06 21:21:48,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:48,173 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 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-11-06 21:21:48,173 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:48,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:48,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1667699618, now seen corresponding path program 1 times [2018-11-06 21:21:48,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:48,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:48,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-11-06 21:21:49,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:21:49,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:21:49,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:21:49,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:21:49,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:21:49,420 INFO L87 Difference]: Start difference. First operand 47595 states and 51851 transitions. Second operand 4 states. [2018-11-06 21:21:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:57,666 INFO L93 Difference]: Finished difference Result 125942 states and 137702 transitions. [2018-11-06 21:21:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:21:57,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 654 [2018-11-06 21:21:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:57,780 INFO L225 Difference]: With dead ends: 125942 [2018-11-06 21:21:57,780 INFO L226 Difference]: Without dead ends: 78344 [2018-11-06 21:21:57,827 INFO L604 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-11-06 21:21:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78344 states. [2018-11-06 21:21:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78344 to 74382. [2018-11-06 21:21:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74382 states. [2018-11-06 21:21:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74382 states to 74382 states and 80017 transitions. [2018-11-06 21:21:58,622 INFO L78 Accepts]: Start accepts. Automaton has 74382 states and 80017 transitions. Word has length 654 [2018-11-06 21:21:58,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:58,628 INFO L480 AbstractCegarLoop]: Abstraction has 74382 states and 80017 transitions. [2018-11-06 21:21:58,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:21:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 74382 states and 80017 transitions. [2018-11-06 21:21:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2018-11-06 21:21:59,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:59,322 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:21:59,322 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:59,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:59,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1561064601, now seen corresponding path program 1 times [2018-11-06 21:21:59,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:59,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:59,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:59,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-06 21:22:00,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:00,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:22:00,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:22:00,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:22:00,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:22:00,169 INFO L87 Difference]: Start difference. First operand 74382 states and 80017 transitions. Second operand 5 states. [2018-11-06 21:22:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:22:13,042 INFO L93 Difference]: Finished difference Result 267979 states and 287847 transitions. [2018-11-06 21:22:13,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:22:13,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1113 [2018-11-06 21:22:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:22:13,250 INFO L225 Difference]: With dead ends: 267979 [2018-11-06 21:22:13,250 INFO L226 Difference]: Without dead ends: 194386 [2018-11-06 21:22:13,314 INFO L604 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-11-06 21:22:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194386 states. [2018-11-06 21:22:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194386 to 183983. [2018-11-06 21:22:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183983 states. [2018-11-06 21:22:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183983 states to 183983 states and 195494 transitions. [2018-11-06 21:22:15,987 INFO L78 Accepts]: Start accepts. Automaton has 183983 states and 195494 transitions. Word has length 1113 [2018-11-06 21:22:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:22:15,988 INFO L480 AbstractCegarLoop]: Abstraction has 183983 states and 195494 transitions. [2018-11-06 21:22:15,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:22:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 183983 states and 195494 transitions. [2018-11-06 21:22:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2018-11-06 21:22:16,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:16,126 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:22:16,126 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:16,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash 79212995, now seen corresponding path program 1 times [2018-11-06 21:22:16,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:16,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:16,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:16,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:16,897 WARN L179 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:22:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-06 21:22:17,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:17,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:22:17,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:22:17,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:22:17,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:17,757 INFO L87 Difference]: Start difference. First operand 183983 states and 195494 transitions. Second operand 4 states. [2018-11-06 21:22:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:22:27,396 INFO L93 Difference]: Finished difference Result 366417 states and 389449 transitions. [2018-11-06 21:22:27,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:22:27,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1189 [2018-11-06 21:22:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:22:27,627 INFO L225 Difference]: With dead ends: 366417 [2018-11-06 21:22:27,627 INFO L226 Difference]: Without dead ends: 183223 [2018-11-06 21:22:27,734 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183223 states. [2018-11-06 21:22:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183223 to 168998. [2018-11-06 21:22:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168998 states. [2018-11-06 21:22:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168998 states to 168998 states and 174937 transitions. [2018-11-06 21:22:30,477 INFO L78 Accepts]: Start accepts. Automaton has 168998 states and 174937 transitions. Word has length 1189 [2018-11-06 21:22:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:22:30,478 INFO L480 AbstractCegarLoop]: Abstraction has 168998 states and 174937 transitions. [2018-11-06 21:22:30,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:22:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 168998 states and 174937 transitions. [2018-11-06 21:22:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1197 [2018-11-06 21:22:30,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:30,570 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, 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:22:30,571 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:30,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:30,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1653764469, now seen corresponding path program 1 times [2018-11-06 21:22:30,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:30,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:30,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:30,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:30,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:31,268 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:22:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 882 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-06 21:22:33,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:33,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:22:33,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:22:33,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:22:33,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:33,634 INFO L87 Difference]: Start difference. First operand 168998 states and 174937 transitions. Second operand 4 states. [2018-11-06 21:22:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:22:42,081 INFO L93 Difference]: Finished difference Result 342731 states and 354686 transitions. [2018-11-06 21:22:42,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:22:42,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1196 [2018-11-06 21:22:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:22:42,245 INFO L225 Difference]: With dead ends: 342731 [2018-11-06 21:22:42,245 INFO L226 Difference]: Without dead ends: 174523 [2018-11-06 21:22:42,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174523 states. [2018-11-06 21:22:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174523 to 170574. [2018-11-06 21:22:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170574 states. [2018-11-06 21:22:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170574 states to 170574 states and 176410 transitions. [2018-11-06 21:22:45,460 INFO L78 Accepts]: Start accepts. Automaton has 170574 states and 176410 transitions. Word has length 1196 [2018-11-06 21:22:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:22:45,461 INFO L480 AbstractCegarLoop]: Abstraction has 170574 states and 176410 transitions. [2018-11-06 21:22:45,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:22:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 170574 states and 176410 transitions. [2018-11-06 21:22:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2018-11-06 21:22:45,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:45,526 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, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:22:45,526 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:45,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:45,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1387546168, now seen corresponding path program 1 times [2018-11-06 21:22:45,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:45,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:45,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-06 21:22:47,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:47,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:22:47,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:22:47,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:22:47,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:47,977 INFO L87 Difference]: Start difference. First operand 170574 states and 176410 transitions. Second operand 4 states. [2018-11-06 21:23:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:00,710 INFO L93 Difference]: Finished difference Result 376707 states and 389804 transitions. [2018-11-06 21:23:00,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:23:00,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1220 [2018-11-06 21:23:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:00,957 INFO L225 Difference]: With dead ends: 376707 [2018-11-06 21:23:00,958 INFO L226 Difference]: Without dead ends: 206923 [2018-11-06 21:23:01,035 INFO L604 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-11-06 21:23:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206923 states. [2018-11-06 21:23:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206923 to 199733. [2018-11-06 21:23:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199733 states. [2018-11-06 21:23:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199733 states to 199733 states and 206495 transitions. [2018-11-06 21:23:03,241 INFO L78 Accepts]: Start accepts. Automaton has 199733 states and 206495 transitions. Word has length 1220 [2018-11-06 21:23:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:23:03,242 INFO L480 AbstractCegarLoop]: Abstraction has 199733 states and 206495 transitions. [2018-11-06 21:23:03,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:23:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 199733 states and 206495 transitions. [2018-11-06 21:23:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1418 [2018-11-06 21:23:03,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:23:03,365 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:23:03,365 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:23:03,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:23:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash 138000160, now seen corresponding path program 1 times [2018-11-06 21:23:03,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:23:03,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:23:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:03,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:23:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:05,185 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 21:23:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 542 proven. 411 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2018-11-06 21:23:09,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:23:09,227 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:23:09,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:23:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:23:09,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:23:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 953 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2018-11-06 21:23:10,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:23:10,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-11-06 21:23:10,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:23:10,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:23:10,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:23:10,866 INFO L87 Difference]: Start difference. First operand 199733 states and 206495 transitions. Second operand 11 states. [2018-11-06 21:23:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:23:40,432 INFO L93 Difference]: Finished difference Result 463288 states and 479629 transitions. [2018-11-06 21:23:40,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-06 21:23:40,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1417 [2018-11-06 21:23:40,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:23:40,760 INFO L225 Difference]: With dead ends: 463288 [2018-11-06 21:23:40,760 INFO L226 Difference]: Without dead ends: 263553 Received shutdown request... [2018-11-06 21:23:40,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1459 GetRequests, 1432 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-11-06 21:23:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263553 states. [2018-11-06 21:23:41,049 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:23:41,053 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:23:41,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:23:41 BoogieIcfgContainer [2018-11-06 21:23:41,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:23:41,055 INFO L168 Benchmark]: Toolchain (without parser) took 222588.32 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-06 21:23:41,056 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:23:41,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2364.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:23:41,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 856.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 798.0 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -996.2 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:23:41,059 INFO L168 Benchmark]: Boogie Preprocessor took 465.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 61.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:23:41,060 INFO L168 Benchmark]: RCFGBuilder took 13093.28 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 238.6 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 38.6 MB). Peak memory consumption was 592.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:23:41,061 INFO L168 Benchmark]: TraceAbstraction took 205801.69 ms. Allocated memory was 2.6 GB in the beginning and 4.2 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.9 GB in the end (delta: -821.6 MB). Peak memory consumption was 848.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:23:41,069 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2364.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 856.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 798.0 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -996.2 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 465.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 61.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 13093.28 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 238.6 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 38.6 MB). Peak memory consumption was 592.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205801.69 ms. Allocated memory was 2.6 GB in the beginning and 4.2 GB in the end (delta: 1.7 GB). Free memory was 2.0 GB in the beginning and 2.9 GB in the end (delta: -821.6 MB). Peak memory consumption was 848.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 180]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 180). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 205.7s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 168.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12182 SDtfs, 40184 SDslu, 3918 SDs, 0 SdLazy, 77624 SolverSat, 19504 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 131.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2008 GetRequests, 1944 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199733occurred in iteration=14, 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: 14.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 51706 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 10806 NumberOfCodeBlocks, 10806 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 10788 ConstructedInterpolants, 0 QuantifiedInterpolants, 33439904 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2296 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 10680/11161 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown