java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label19_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:01:29,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:01:29,324 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:01:29,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:01:29,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:01:29,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:01:29,344 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:01:29,346 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:01:29,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:01:29,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:01:29,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:01:29,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:01:29,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:01:29,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:01:29,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:01:29,356 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:01:29,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:01:29,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:01:29,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:01:29,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:01:29,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:01:29,376 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:01:29,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:01:29,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:01:29,381 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:01:29,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:01:29,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:01:29,384 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:01:29,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:01:29,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:01:29,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:01:29,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:01:29,389 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:01:29,389 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:01:29,390 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:01:29,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:01:29,393 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 20:01:29,423 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:01:29,423 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:01:29,424 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:01:29,424 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:01:29,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:01:29,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:01:29,425 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:01:29,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:01:29,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:01:29,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:01:29,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:01:29,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:01:29,426 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:01:29,426 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:01:29,427 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:01:29,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:01:29,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:01:29,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:01:29,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:01:29,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:01:29,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:01:29,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:01:29,428 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:01:29,428 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:01:29,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:01:29,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:01:29,429 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:01:29,429 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 20:01:29,496 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:01:29,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:01:29,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:01:29,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:01:29,523 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:01:29,524 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label19_true-unreach-call.c [2018-10-26 20:01:29,592 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/201ead93a/a3a680e3e0384939a775819a1cfdd602/FLAGa48b4fd29 [2018-10-26 20:01:30,372 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:01:30,375 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label19_true-unreach-call.c [2018-10-26 20:01:30,405 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/201ead93a/a3a680e3e0384939a775819a1cfdd602/FLAGa48b4fd29 [2018-10-26 20:01:30,421 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/201ead93a/a3a680e3e0384939a775819a1cfdd602 [2018-10-26 20:01:30,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:01:30,435 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:01:30,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:01:30,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:01:30,441 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:01:30,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:01:30" (1/1) ... [2018-10-26 20:01:30,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f49102c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:30, skipping insertion in model container [2018-10-26 20:01:30,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:01:30" (1/1) ... [2018-10-26 20:01:30,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:01:30,568 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:01:31,350 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:01:31,355 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:01:31,670 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:01:31,697 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:01:31,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31 WrapperNode [2018-10-26 20:01:31,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:01:31,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:01:31,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:01:31,699 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:01:31,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (1/1) ... [2018-10-26 20:01:31,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (1/1) ... [2018-10-26 20:01:32,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:01:32,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:01:32,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:01:32,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:01:32,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (1/1) ... [2018-10-26 20:01:32,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (1/1) ... [2018-10-26 20:01:32,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (1/1) ... [2018-10-26 20:01:32,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (1/1) ... [2018-10-26 20:01:32,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (1/1) ... [2018-10-26 20:01:32,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (1/1) ... [2018-10-26 20:01:32,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (1/1) ... [2018-10-26 20:01:32,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:01:32,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:01:32,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:01:32,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:01:32,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:01:32,225 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:01:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:01:32,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:01:37,407 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:01:37,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:01:37 BoogieIcfgContainer [2018-10-26 20:01:37,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:01:37,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:01:37,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:01:37,413 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:01:37,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:01:30" (1/3) ... [2018-10-26 20:01:37,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63460cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:01:37, skipping insertion in model container [2018-10-26 20:01:37,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:01:31" (2/3) ... [2018-10-26 20:01:37,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63460cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:01:37, skipping insertion in model container [2018-10-26 20:01:37,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:01:37" (3/3) ... [2018-10-26 20:01:37,417 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label19_true-unreach-call.c [2018-10-26 20:01:37,428 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:01:37,438 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:01:37,457 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:01:37,495 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:01:37,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:01:37,496 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:01:37,496 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:01:37,496 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:01:37,497 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:01:37,497 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:01:37,497 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:01:37,497 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:01:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 20:01:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 20:01:37,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:37,553 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:37,555 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:37,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1651979548, now seen corresponding path program 1 times [2018-10-26 20:01:37,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:37,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:37,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:38,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:38,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:38,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:38,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:38,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:38,640 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 20:01:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:42,354 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-26 20:01:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:42,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-26 20:01:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:42,385 INFO L225 Difference]: With dead ends: 1075 [2018-10-26 20:01:42,385 INFO L226 Difference]: Without dead ends: 765 [2018-10-26 20:01:42,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-26 20:01:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-26 20:01:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-26 20:01:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-26 20:01:42,556 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 188 [2018-10-26 20:01:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:42,557 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-26 20:01:42,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:01:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-26 20:01:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 20:01:42,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:42,572 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:42,572 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:42,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash -415975069, now seen corresponding path program 1 times [2018-10-26 20:01:42,579 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:42,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:42,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:42,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:42,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:42,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:42,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:01:42,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:01:42,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:01:42,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:42,760 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-26 20:01:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:44,531 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-26 20:01:44,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:44,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-26 20:01:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:44,540 INFO L225 Difference]: With dead ends: 1465 [2018-10-26 20:01:44,541 INFO L226 Difference]: Without dead ends: 947 [2018-10-26 20:01:44,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-26 20:01:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-26 20:01:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-26 20:01:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-26 20:01:44,595 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 197 [2018-10-26 20:01:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:44,595 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-26 20:01:44,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:01:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-26 20:01:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-26 20:01:44,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:44,602 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:44,602 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:44,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:44,603 INFO L82 PathProgramCache]: Analyzing trace with hash -386544841, now seen corresponding path program 1 times [2018-10-26 20:01:44,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:44,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:44,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:44,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:44,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:01:44,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:44,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:44,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:01:44,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:01:44,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:44,938 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-26 20:01:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:49,694 INFO L93 Difference]: Finished difference Result 2683 states and 4400 transitions. [2018-10-26 20:01:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:49,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-26 20:01:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:49,706 INFO L225 Difference]: With dead ends: 2683 [2018-10-26 20:01:49,706 INFO L226 Difference]: Without dead ends: 1754 [2018-10-26 20:01:49,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-10-26 20:01:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1753. [2018-10-26 20:01:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-10-26 20:01:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2648 transitions. [2018-10-26 20:01:49,744 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2648 transitions. Word has length 205 [2018-10-26 20:01:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:49,745 INFO L481 AbstractCegarLoop]: Abstraction has 1753 states and 2648 transitions. [2018-10-26 20:01:49,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:01:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2648 transitions. [2018-10-26 20:01:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-26 20:01:49,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:49,751 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:49,752 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:49,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:49,752 INFO L82 PathProgramCache]: Analyzing trace with hash -151169027, now seen corresponding path program 1 times [2018-10-26 20:01:49,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:49,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:49,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:49,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:49,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:01:49,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:49,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:49,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:01:49,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:01:49,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:49,916 INFO L87 Difference]: Start difference. First operand 1753 states and 2648 transitions. Second operand 3 states. [2018-10-26 20:01:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:51,630 INFO L93 Difference]: Finished difference Result 5139 states and 7808 transitions. [2018-10-26 20:01:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:51,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-10-26 20:01:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:51,648 INFO L225 Difference]: With dead ends: 5139 [2018-10-26 20:01:51,649 INFO L226 Difference]: Without dead ends: 3388 [2018-10-26 20:01:51,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2018-10-26 20:01:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3385. [2018-10-26 20:01:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-26 20:01:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4616 transitions. [2018-10-26 20:01:51,728 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4616 transitions. Word has length 212 [2018-10-26 20:01:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:51,729 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4616 transitions. [2018-10-26 20:01:51,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:01:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4616 transitions. [2018-10-26 20:01:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-26 20:01:51,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:51,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:51,741 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:51,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1536549167, now seen corresponding path program 1 times [2018-10-26 20:01:51,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:51,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:51,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:52,009 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 20:01:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:52,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:52,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:52,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:52,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:52,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:52,141 INFO L87 Difference]: Start difference. First operand 3385 states and 4616 transitions. Second operand 4 states. [2018-10-26 20:01:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:55,227 INFO L93 Difference]: Finished difference Result 13364 states and 18287 transitions. [2018-10-26 20:01:55,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:55,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2018-10-26 20:01:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:55,269 INFO L225 Difference]: With dead ends: 13364 [2018-10-26 20:01:55,269 INFO L226 Difference]: Without dead ends: 9981 [2018-10-26 20:01:55,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9981 states. [2018-10-26 20:01:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9981 to 6649. [2018-10-26 20:01:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-26 20:01:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8879 transitions. [2018-10-26 20:01:55,424 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8879 transitions. Word has length 215 [2018-10-26 20:01:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:55,424 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8879 transitions. [2018-10-26 20:01:55,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:01:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8879 transitions. [2018-10-26 20:01:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-26 20:01:55,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:55,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:55,443 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:55,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:55,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1248571006, now seen corresponding path program 1 times [2018-10-26 20:01:55,443 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:55,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:55,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:55,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:55,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:55,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:55,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:55,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:55,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:55,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:55,759 INFO L87 Difference]: Start difference. First operand 6649 states and 8879 transitions. Second operand 4 states. [2018-10-26 20:01:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:57,596 INFO L93 Difference]: Finished difference Result 16563 states and 22621 transitions. [2018-10-26 20:01:57,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:57,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2018-10-26 20:01:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:57,630 INFO L225 Difference]: With dead ends: 16563 [2018-10-26 20:01:57,630 INFO L226 Difference]: Without dead ends: 9916 [2018-10-26 20:01:57,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9916 states. [2018-10-26 20:01:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9916 to 9913. [2018-10-26 20:01:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9913 states. [2018-10-26 20:01:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9913 states to 9913 states and 12603 transitions. [2018-10-26 20:01:57,797 INFO L78 Accepts]: Start accepts. Automaton has 9913 states and 12603 transitions. Word has length 216 [2018-10-26 20:01:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:57,798 INFO L481 AbstractCegarLoop]: Abstraction has 9913 states and 12603 transitions. [2018-10-26 20:01:57,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:01:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 9913 states and 12603 transitions. [2018-10-26 20:01:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-26 20:01:57,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:57,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:57,817 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:57,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:57,818 INFO L82 PathProgramCache]: Analyzing trace with hash 20567018, now seen corresponding path program 1 times [2018-10-26 20:01:57,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:57,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:57,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:57,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:57,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:01:57,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:57,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:01:57,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:01:57,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:01:57,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:57,996 INFO L87 Difference]: Start difference. First operand 9913 states and 12603 transitions. Second operand 3 states. [2018-10-26 20:01:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:59,936 INFO L93 Difference]: Finished difference Result 24787 states and 31363 transitions. [2018-10-26 20:01:59,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:01:59,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2018-10-26 20:01:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:59,967 INFO L225 Difference]: With dead ends: 24787 [2018-10-26 20:01:59,967 INFO L226 Difference]: Without dead ends: 14876 [2018-10-26 20:01:59,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:01:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14876 states. [2018-10-26 20:02:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14876 to 14871. [2018-10-26 20:02:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14871 states. [2018-10-26 20:02:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 18725 transitions. [2018-10-26 20:02:00,196 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 18725 transitions. Word has length 217 [2018-10-26 20:02:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:00,196 INFO L481 AbstractCegarLoop]: Abstraction has 14871 states and 18725 transitions. [2018-10-26 20:02:00,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:02:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 18725 transitions. [2018-10-26 20:02:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-26 20:02:00,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:00,225 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:02:00,225 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:00,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:00,226 INFO L82 PathProgramCache]: Analyzing trace with hash 796111806, now seen corresponding path program 1 times [2018-10-26 20:02:00,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:00,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:00,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:00,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:00,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:00,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:02:00,557 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:02:00,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:00,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:01,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:02:01,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-26 20:02:01,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:02:01,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:02:01,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:02:01,008 INFO L87 Difference]: Start difference. First operand 14871 states and 18725 transitions. Second operand 7 states. [2018-10-26 20:02:01,183 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 20:02:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:11,394 INFO L93 Difference]: Finished difference Result 85717 states and 107159 transitions. [2018-10-26 20:02:11,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 20:02:11,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2018-10-26 20:02:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:11,543 INFO L225 Difference]: With dead ends: 85717 [2018-10-26 20:02:11,543 INFO L226 Difference]: Without dead ends: 70847 [2018-10-26 20:02:11,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:02:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70847 states. [2018-10-26 20:02:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70847 to 70816. [2018-10-26 20:02:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70816 states. [2018-10-26 20:02:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70816 states to 70816 states and 83436 transitions. [2018-10-26 20:02:12,714 INFO L78 Accepts]: Start accepts. Automaton has 70816 states and 83436 transitions. Word has length 225 [2018-10-26 20:02:12,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:12,714 INFO L481 AbstractCegarLoop]: Abstraction has 70816 states and 83436 transitions. [2018-10-26 20:02:12,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:02:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 70816 states and 83436 transitions. [2018-10-26 20:02:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-26 20:02:12,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:12,797 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2018-10-26 20:02:12,797 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:12,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:12,798 INFO L82 PathProgramCache]: Analyzing trace with hash 314218943, now seen corresponding path program 1 times [2018-10-26 20:02:12,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:12,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:12,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:12,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:12,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 20:02:12,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:12,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:02:12,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:02:12,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:02:12,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:12,988 INFO L87 Difference]: Start difference. First operand 70816 states and 83436 transitions. Second operand 3 states. [2018-10-26 20:02:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:15,444 INFO L93 Difference]: Finished difference Result 133770 states and 157213 transitions. [2018-10-26 20:02:15,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:02:15,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-10-26 20:02:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:15,534 INFO L225 Difference]: With dead ends: 133770 [2018-10-26 20:02:15,534 INFO L226 Difference]: Without dead ends: 62956 [2018-10-26 20:02:15,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62956 states. [2018-10-26 20:02:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62956 to 62956. [2018-10-26 20:02:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62956 states. [2018-10-26 20:02:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62956 states to 62956 states and 72561 transitions. [2018-10-26 20:02:16,366 INFO L78 Accepts]: Start accepts. Automaton has 62956 states and 72561 transitions. Word has length 233 [2018-10-26 20:02:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:16,366 INFO L481 AbstractCegarLoop]: Abstraction has 62956 states and 72561 transitions. [2018-10-26 20:02:16,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:02:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 62956 states and 72561 transitions. [2018-10-26 20:02:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-26 20:02:16,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:16,383 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:02:16,384 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:16,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash 919990258, now seen corresponding path program 1 times [2018-10-26 20:02:16,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:16,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:16,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:16,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:16,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:02:16,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:16,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:16,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:02:16,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:02:16,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:16,555 INFO L87 Difference]: Start difference. First operand 62956 states and 72561 transitions. Second operand 3 states. [2018-10-26 20:02:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:18,075 INFO L93 Difference]: Finished difference Result 125920 states and 145137 transitions. [2018-10-26 20:02:18,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:02:18,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2018-10-26 20:02:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:18,157 INFO L225 Difference]: With dead ends: 125920 [2018-10-26 20:02:18,157 INFO L226 Difference]: Without dead ends: 62966 [2018-10-26 20:02:18,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:02:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62966 states. [2018-10-26 20:02:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62966 to 62956. [2018-10-26 20:02:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62956 states. [2018-10-26 20:02:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62956 states to 62956 states and 70389 transitions. [2018-10-26 20:02:19,483 INFO L78 Accepts]: Start accepts. Automaton has 62956 states and 70389 transitions. Word has length 236 [2018-10-26 20:02:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:19,484 INFO L481 AbstractCegarLoop]: Abstraction has 62956 states and 70389 transitions. [2018-10-26 20:02:19,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:02:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 62956 states and 70389 transitions. [2018-10-26 20:02:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-26 20:02:19,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:19,500 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:02:19,501 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:19,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:19,501 INFO L82 PathProgramCache]: Analyzing trace with hash 746073851, now seen corresponding path program 1 times [2018-10-26 20:02:19,501 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:19,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:19,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:19,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:19,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 20:02:19,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:19,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:19,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:19,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:19,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:19,768 INFO L87 Difference]: Start difference. First operand 62956 states and 70389 transitions. Second operand 4 states. [2018-10-26 20:02:21,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:21,511 INFO L93 Difference]: Finished difference Result 125910 states and 140776 transitions. [2018-10-26 20:02:21,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:21,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2018-10-26 20:02:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:21,576 INFO L225 Difference]: With dead ends: 125910 [2018-10-26 20:02:21,576 INFO L226 Difference]: Without dead ends: 62956 [2018-10-26 20:02:21,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62956 states. [2018-10-26 20:02:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62956 to 62956. [2018-10-26 20:02:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62956 states. [2018-10-26 20:02:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62956 states to 62956 states and 69803 transitions. [2018-10-26 20:02:22,302 INFO L78 Accepts]: Start accepts. Automaton has 62956 states and 69803 transitions. Word has length 268 [2018-10-26 20:02:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:22,302 INFO L481 AbstractCegarLoop]: Abstraction has 62956 states and 69803 transitions. [2018-10-26 20:02:22,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 62956 states and 69803 transitions. [2018-10-26 20:02:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-26 20:02:22,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:22,317 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:02:22,318 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:22,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:22,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1304177161, now seen corresponding path program 1 times [2018-10-26 20:02:22,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:22,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:22,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:22,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:22,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:22,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:22,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:02:22,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:02:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:02:22,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:02:22,680 INFO L87 Difference]: Start difference. First operand 62956 states and 69803 transitions. Second operand 6 states. [2018-10-26 20:02:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:26,713 INFO L93 Difference]: Finished difference Result 247568 states and 271778 transitions. [2018-10-26 20:02:26,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:02:26,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2018-10-26 20:02:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:26,949 INFO L225 Difference]: With dead ends: 247568 [2018-10-26 20:02:26,949 INFO L226 Difference]: Without dead ends: 184614 [2018-10-26 20:02:27,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:02:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184614 states. [2018-10-26 20:02:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184614 to 184601. [2018-10-26 20:02:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184601 states. [2018-10-26 20:02:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184601 states to 184601 states and 201709 transitions. [2018-10-26 20:02:29,751 INFO L78 Accepts]: Start accepts. Automaton has 184601 states and 201709 transitions. Word has length 269 [2018-10-26 20:02:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:29,751 INFO L481 AbstractCegarLoop]: Abstraction has 184601 states and 201709 transitions. [2018-10-26 20:02:29,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:02:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 184601 states and 201709 transitions. [2018-10-26 20:02:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-26 20:02:29,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:29,779 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:02:29,779 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:29,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1987275286, now seen corresponding path program 1 times [2018-10-26 20:02:29,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:29,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:29,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 20:02:30,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:30,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:30,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:30,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:30,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:30,123 INFO L87 Difference]: Start difference. First operand 184601 states and 201709 transitions. Second operand 4 states. [2018-10-26 20:02:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:35,267 INFO L93 Difference]: Finished difference Result 676072 states and 737797 transitions. [2018-10-26 20:02:35,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:35,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-10-26 20:02:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:36,051 INFO L225 Difference]: With dead ends: 676072 [2018-10-26 20:02:36,051 INFO L226 Difference]: Without dead ends: 491473 [2018-10-26 20:02:38,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491473 states. [2018-10-26 20:02:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491473 to 491469. [2018-10-26 20:02:53,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491469 states. [2018-10-26 20:02:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491469 states to 491469 states and 535446 transitions. [2018-10-26 20:02:53,778 INFO L78 Accepts]: Start accepts. Automaton has 491469 states and 535446 transitions. Word has length 270 [2018-10-26 20:02:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:53,778 INFO L481 AbstractCegarLoop]: Abstraction has 491469 states and 535446 transitions. [2018-10-26 20:02:53,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 491469 states and 535446 transitions. [2018-10-26 20:02:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-26 20:02:53,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:53,799 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:02:53,800 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:53,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1412233061, now seen corresponding path program 1 times [2018-10-26 20:02:53,800 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:02:53,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:02:53,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:53,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:53,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:54,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:54,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:02:54,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:54,083 INFO L87 Difference]: Start difference. First operand 491469 states and 535446 transitions. Second operand 4 states. [2018-10-26 20:03:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:00,038 INFO L93 Difference]: Finished difference Result 1033233 states and 1126792 transitions. [2018-10-26 20:03:00,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:03:00,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2018-10-26 20:03:00,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:00,774 INFO L225 Difference]: With dead ends: 1033233 [2018-10-26 20:03:00,774 INFO L226 Difference]: Without dead ends: 541766 [2018-10-26 20:03:00,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541766 states. [2018-10-26 20:03:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541766 to 535109. [2018-10-26 20:03:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535109 states. [2018-10-26 20:03:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535109 states to 535109 states and 577854 transitions. [2018-10-26 20:03:10,608 INFO L78 Accepts]: Start accepts. Automaton has 535109 states and 577854 transitions. Word has length 292 [2018-10-26 20:03:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:10,608 INFO L481 AbstractCegarLoop]: Abstraction has 535109 states and 577854 transitions. [2018-10-26 20:03:10,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 535109 states and 577854 transitions. [2018-10-26 20:03:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-26 20:03:10,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:10,641 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 20:03:10,641 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:10,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:10,641 INFO L82 PathProgramCache]: Analyzing trace with hash 19981777, now seen corresponding path program 1 times [2018-10-26 20:03:10,641 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:10,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:10,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:10,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:10,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 156 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:12,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:03:12,612 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:03:12,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:12,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:03:12,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:03:12,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-26 20:03:12,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:03:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:03:12,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:03:12,959 INFO L87 Difference]: Start difference. First operand 535109 states and 577854 transitions. Second operand 7 states. [2018-10-26 20:03:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:31,098 INFO L93 Difference]: Finished difference Result 1321746 states and 1433809 transitions. [2018-10-26 20:03:31,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 20:03:31,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 344 [2018-10-26 20:03:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:32,327 INFO L225 Difference]: With dead ends: 1321746 [2018-10-26 20:03:32,328 INFO L226 Difference]: Without dead ends: 786639 [2018-10-26 20:03:32,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-10-26 20:03:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786639 states. [2018-10-26 20:03:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786639 to 712980. [2018-10-26 20:03:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712980 states. [2018-10-26 20:03:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712980 states to 712980 states and 761918 transitions. [2018-10-26 20:03:45,148 INFO L78 Accepts]: Start accepts. Automaton has 712980 states and 761918 transitions. Word has length 344 [2018-10-26 20:03:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:45,149 INFO L481 AbstractCegarLoop]: Abstraction has 712980 states and 761918 transitions. [2018-10-26 20:03:45,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:03:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 712980 states and 761918 transitions. [2018-10-26 20:03:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-26 20:03:45,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:45,225 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:03:45,225 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:45,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:45,225 INFO L82 PathProgramCache]: Analyzing trace with hash 221744449, now seen corresponding path program 1 times [2018-10-26 20:03:45,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:45,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:45,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:45,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:45,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-10-26 20:03:47,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:47,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:03:47,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:47,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:47,233 INFO L87 Difference]: Start difference. First operand 712980 states and 761918 transitions. Second operand 3 states. [2018-10-26 20:04:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:01,761 INFO L93 Difference]: Finished difference Result 1745912 states and 1861654 transitions. [2018-10-26 20:04:01,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:01,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2018-10-26 20:04:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:03,180 INFO L225 Difference]: With dead ends: 1745912 [2018-10-26 20:04:03,180 INFO L226 Difference]: Without dead ends: 1032934 [2018-10-26 20:04:03,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:04,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032934 states. [2018-10-26 20:04:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032934 to 1030429. [2018-10-26 20:04:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030429 states. [2018-10-26 20:04:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030429 states to 1030429 states and 1097027 transitions. [2018-10-26 20:04:23,121 INFO L78 Accepts]: Start accepts. Automaton has 1030429 states and 1097027 transitions. Word has length 437 [2018-10-26 20:04:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:23,121 INFO L481 AbstractCegarLoop]: Abstraction has 1030429 states and 1097027 transitions. [2018-10-26 20:04:23,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:04:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1030429 states and 1097027 transitions. [2018-10-26 20:04:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-10-26 20:04:23,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:23,234 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:04:23,234 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:23,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:23,235 INFO L82 PathProgramCache]: Analyzing trace with hash 310016055, now seen corresponding path program 1 times [2018-10-26 20:04:23,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:04:23,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:04:23,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:23,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:23,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:04:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-26 20:04:23,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:23,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:04:23,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:04:23,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:04:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:23,594 INFO L87 Difference]: Start difference. First operand 1030429 states and 1097027 transitions. Second operand 3 states. [2018-10-26 20:04:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:40,008 INFO L93 Difference]: Finished difference Result 1821846 states and 1939170 transitions. [2018-10-26 20:04:40,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:04:40,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2018-10-26 20:04:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:41,225 INFO L225 Difference]: With dead ends: 1821846 [2018-10-26 20:04:41,225 INFO L226 Difference]: Without dead ends: 791419 [2018-10-26 20:04:41,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:04:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791419 states. Received shutdown request... [2018-10-26 20:04:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791419 to 791402. [2018-10-26 20:04:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791402 states. [2018-10-26 20:04:53,884 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:04:53,889 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:04:53,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:04:53 BoogieIcfgContainer [2018-10-26 20:04:53,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:04:53,891 INFO L168 Benchmark]: Toolchain (without parser) took 203456.78 ms. Allocated memory was 1.5 GB in the beginning and 6.5 GB in the end (delta: 4.9 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,892 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:04:53,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1262.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 321.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -847.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,894 INFO L168 Benchmark]: Boogie Preprocessor took 135.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,895 INFO L168 Benchmark]: RCFGBuilder took 5251.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 250.3 MB). Peak memory consumption was 250.3 MB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,896 INFO L168 Benchmark]: TraceAbstraction took 196480.02 ms. Allocated memory was 2.3 GB in the beginning and 6.5 GB in the end (delta: 4.2 GB). Free memory was 1.9 GB in the beginning and 2.7 GB in the end (delta: -778.6 MB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. [2018-10-26 20:04:53,904 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1262.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 321.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -847.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5251.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 250.3 MB). Peak memory consumption was 250.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196480.02 ms. Allocated memory was 2.3 GB in the beginning and 6.5 GB in the end (delta: 4.2 GB). Free memory was 1.9 GB in the beginning and 2.7 GB in the end (delta: -778.6 MB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1596]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1596). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 196.4s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 109.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4884 SDtfs, 12368 SDslu, 3581 SDs, 0 SdLazy, 20517 SolverSat, 4725 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 594 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1030429occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 77.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 86484 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 5069 NumberOfCodeBlocks, 5069 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5050 ConstructedInterpolants, 0 QuantifiedInterpolants, 2921064 SizeOfPredicates, 7 NumberOfNonLiveVariables, 973 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 2261/2278 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown