java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label05_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:02:00,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:02:00,329 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:02:00,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:02:00,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:02:00,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:02:00,348 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:02:00,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:02:00,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:02:00,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:02:00,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:02:00,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:02:00,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:02:00,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:02:00,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:02:00,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:02:00,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:02:00,360 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:02:00,362 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:02:00,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:02:00,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:02:00,369 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:02:00,372 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:02:00,372 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:02:00,373 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:02:00,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:02:00,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:02:00,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:02:00,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:02:00,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:02:00,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:02:00,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:02:00,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:02:00,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:02:00,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:02:00,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:02:00,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:02:00,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:02:00,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:02:00,419 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:02:00,420 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:02:00,421 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:02:00,421 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:02:00,421 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:02:00,421 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:02:00,421 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:02:00,422 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:02:00,422 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:02:00,422 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:02:00,422 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:02:00,422 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:02:00,423 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:02:00,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:02:00,424 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:02:00,424 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:02:00,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:02:00,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:02:00,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:02:00,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:02:00,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:02:00,427 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:02:00,427 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:02:00,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:02:00,427 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:02:00,428 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:02:00,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:02:00,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:02:00,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:02:00,510 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:02:00,511 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:02:00,511 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label05_true-unreach-call.c [2018-11-06 21:02:00,572 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc2bf1605/8c9022932d4b42eba92a2b2b353f2db3/FLAG4b75816d2 [2018-11-06 21:02:01,271 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:02:01,272 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label05_true-unreach-call.c [2018-11-06 21:02:01,293 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc2bf1605/8c9022932d4b42eba92a2b2b353f2db3/FLAG4b75816d2 [2018-11-06 21:02:01,316 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc2bf1605/8c9022932d4b42eba92a2b2b353f2db3 [2018-11-06 21:02:01,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:02:01,331 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:02:01,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:02:01,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:02:01,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:02:01,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:02:01" (1/1) ... [2018-11-06 21:02:01,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531eb58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:01, skipping insertion in model container [2018-11-06 21:02:01,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:02:01" (1/1) ... [2018-11-06 21:02:01,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:02:01,430 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:02:02,003 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:02:02,012 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:02:02,223 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:02:02,246 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:02:02,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02 WrapperNode [2018-11-06 21:02:02,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:02:02,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:02:02,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:02:02,248 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:02:02,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (1/1) ... [2018-11-06 21:02:02,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (1/1) ... [2018-11-06 21:02:02,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:02:02,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:02:02,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:02:02,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:02:02,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (1/1) ... [2018-11-06 21:02:02,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (1/1) ... [2018-11-06 21:02:02,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (1/1) ... [2018-11-06 21:02:02,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (1/1) ... [2018-11-06 21:02:02,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (1/1) ... [2018-11-06 21:02:02,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (1/1) ... [2018-11-06 21:02:02,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (1/1) ... [2018-11-06 21:02:02,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:02:02,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:02:02,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:02:02,682 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:02:02,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:02:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:02:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:02:02,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:02:07,364 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:02:07,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:02:07 BoogieIcfgContainer [2018-11-06 21:02:07,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:02:07,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:02:07,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:02:07,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:02:07,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:02:01" (1/3) ... [2018-11-06 21:02:07,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6451cc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:02:07, skipping insertion in model container [2018-11-06 21:02:07,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:02" (2/3) ... [2018-11-06 21:02:07,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6451cc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:02:07, skipping insertion in model container [2018-11-06 21:02:07,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:02:07" (3/3) ... [2018-11-06 21:02:07,374 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label05_true-unreach-call.c [2018-11-06 21:02:07,385 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:02:07,393 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:02:07,414 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:02:07,466 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:02:07,467 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:02:07,467 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:02:07,467 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:02:07,467 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:02:07,468 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:02:07,468 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:02:07,468 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:02:07,468 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:02:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:02:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-06 21:02:07,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:07,517 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] [2018-11-06 21:02:07,520 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:07,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:07,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2101344302, now seen corresponding path program 1 times [2018-11-06 21:02:07,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:07,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:07,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:07,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:07,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:08,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:08,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:08,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:08,142 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:02:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:11,469 INFO L93 Difference]: Finished difference Result 972 states and 1744 transitions. [2018-11-06 21:02:11,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:11,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-06 21:02:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:11,496 INFO L225 Difference]: With dead ends: 972 [2018-11-06 21:02:11,496 INFO L226 Difference]: Without dead ends: 681 [2018-11-06 21:02:11,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-06 21:02:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 469. [2018-11-06 21:02:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-11-06 21:02:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 728 transitions. [2018-11-06 21:02:11,619 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 728 transitions. Word has length 65 [2018-11-06 21:02:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:11,621 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 728 transitions. [2018-11-06 21:02:11,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 728 transitions. [2018-11-06 21:02:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-06 21:02:11,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:11,632 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:11,632 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:11,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1112990086, now seen corresponding path program 1 times [2018-11-06 21:02:11,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:11,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:11,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:11,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:11,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:11,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:11,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:11,923 INFO L87 Difference]: Start difference. First operand 469 states and 728 transitions. Second operand 4 states. [2018-11-06 21:02:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:14,938 INFO L93 Difference]: Finished difference Result 1695 states and 2717 transitions. [2018-11-06 21:02:14,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:14,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-11-06 21:02:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:14,947 INFO L225 Difference]: With dead ends: 1695 [2018-11-06 21:02:14,947 INFO L226 Difference]: Without dead ends: 1228 [2018-11-06 21:02:14,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-11-06 21:02:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1214. [2018-11-06 21:02:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-11-06 21:02:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1784 transitions. [2018-11-06 21:02:14,991 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1784 transitions. Word has length 134 [2018-11-06 21:02:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:14,991 INFO L480 AbstractCegarLoop]: Abstraction has 1214 states and 1784 transitions. [2018-11-06 21:02:14,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1784 transitions. [2018-11-06 21:02:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-06 21:02:14,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:14,997 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:14,997 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:14,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1350667100, now seen corresponding path program 1 times [2018-11-06 21:02:14,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:14,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:14,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:15,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:15,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:15,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:15,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:15,299 INFO L87 Difference]: Start difference. First operand 1214 states and 1784 transitions. Second operand 4 states. [2018-11-06 21:02:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:19,269 INFO L93 Difference]: Finished difference Result 4657 states and 6912 transitions. [2018-11-06 21:02:19,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:19,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-11-06 21:02:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:19,286 INFO L225 Difference]: With dead ends: 4657 [2018-11-06 21:02:19,287 INFO L226 Difference]: Without dead ends: 3445 [2018-11-06 21:02:19,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2018-11-06 21:02:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3445. [2018-11-06 21:02:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3445 states. [2018-11-06 21:02:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 4375 transitions. [2018-11-06 21:02:19,356 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 4375 transitions. Word has length 137 [2018-11-06 21:02:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:19,356 INFO L480 AbstractCegarLoop]: Abstraction has 3445 states and 4375 transitions. [2018-11-06 21:02:19,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 4375 transitions. [2018-11-06 21:02:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-06 21:02:19,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:19,361 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:19,361 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:19,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1831025348, now seen corresponding path program 1 times [2018-11-06 21:02:19,362 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:19,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:19,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:19,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:19,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:19,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:19,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:19,696 INFO L87 Difference]: Start difference. First operand 3445 states and 4375 transitions. Second operand 4 states. [2018-11-06 21:02:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:24,489 INFO L93 Difference]: Finished difference Result 8946 states and 11898 transitions. [2018-11-06 21:02:24,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:24,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2018-11-06 21:02:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:24,515 INFO L225 Difference]: With dead ends: 8946 [2018-11-06 21:02:24,515 INFO L226 Difference]: Without dead ends: 5688 [2018-11-06 21:02:24,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2018-11-06 21:02:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 4553. [2018-11-06 21:02:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4553 states. [2018-11-06 21:02:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 5726 transitions. [2018-11-06 21:02:24,611 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 5726 transitions. Word has length 193 [2018-11-06 21:02:24,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:24,611 INFO L480 AbstractCegarLoop]: Abstraction has 4553 states and 5726 transitions. [2018-11-06 21:02:24,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 5726 transitions. [2018-11-06 21:02:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-06 21:02:24,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:24,618 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:02:24,618 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:24,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:24,619 INFO L82 PathProgramCache]: Analyzing trace with hash 85662971, now seen corresponding path program 1 times [2018-11-06 21:02:24,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:24,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:24,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:24,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:24,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-06 21:02:25,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:25,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:02:25,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:25,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:25,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:25,090 INFO L87 Difference]: Start difference. First operand 4553 states and 5726 transitions. Second operand 4 states. [2018-11-06 21:02:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:27,479 INFO L93 Difference]: Finished difference Result 10416 states and 13222 transitions. [2018-11-06 21:02:27,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:27,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2018-11-06 21:02:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:27,504 INFO L225 Difference]: With dead ends: 10416 [2018-11-06 21:02:27,505 INFO L226 Difference]: Without dead ends: 6050 [2018-11-06 21:02:27,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2018-11-06 21:02:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 6033. [2018-11-06 21:02:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6033 states. [2018-11-06 21:02:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6033 states to 6033 states and 7378 transitions. [2018-11-06 21:02:27,604 INFO L78 Accepts]: Start accepts. Automaton has 6033 states and 7378 transitions. Word has length 248 [2018-11-06 21:02:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:27,605 INFO L480 AbstractCegarLoop]: Abstraction has 6033 states and 7378 transitions. [2018-11-06 21:02:27,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6033 states and 7378 transitions. [2018-11-06 21:02:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-06 21:02:27,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:27,612 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:27,612 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:27,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash 327685741, now seen corresponding path program 1 times [2018-11-06 21:02:27,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:27,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:28,227 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:02:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 125 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:28,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:02:28,326 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:02:28,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:28,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:02:29,218 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 28 [2018-11-06 21:02:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 125 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:29,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:02:29,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-11-06 21:02:29,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:02:29,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:02:29,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:02:29,922 INFO L87 Difference]: Start difference. First operand 6033 states and 7378 transitions. Second operand 7 states. [2018-11-06 21:02:31,705 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2018-11-06 21:02:35,001 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 10 [2018-11-06 21:02:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:43,268 INFO L93 Difference]: Finished difference Result 19328 states and 23715 transitions. [2018-11-06 21:02:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 21:02:43,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 269 [2018-11-06 21:02:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:43,312 INFO L225 Difference]: With dead ends: 19328 [2018-11-06 21:02:43,313 INFO L226 Difference]: Without dead ends: 12362 [2018-11-06 21:02:43,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:02:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12362 states. [2018-11-06 21:02:43,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12362 to 12164. [2018-11-06 21:02:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12164 states. [2018-11-06 21:02:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12164 states to 12164 states and 14041 transitions. [2018-11-06 21:02:43,597 INFO L78 Accepts]: Start accepts. Automaton has 12164 states and 14041 transitions. Word has length 269 [2018-11-06 21:02:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:43,598 INFO L480 AbstractCegarLoop]: Abstraction has 12164 states and 14041 transitions. [2018-11-06 21:02:43,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:02:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 12164 states and 14041 transitions. [2018-11-06 21:02:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-06 21:02:43,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:43,610 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:02:43,610 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:43,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:43,611 INFO L82 PathProgramCache]: Analyzing trace with hash 689386222, now seen corresponding path program 1 times [2018-11-06 21:02:43,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:43,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:43,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:43,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:43,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:44,165 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:02:44,823 WARN L179 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-11-06 21:02:45,204 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-06 21:02:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 124 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:45,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:02:45,607 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:02:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:45,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:02:46,107 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:02:46,394 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 13 [2018-11-06 21:02:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 75 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:46,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:02:46,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-11-06 21:02:46,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 21:02:46,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 21:02:46,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:02:46,737 INFO L87 Difference]: Start difference. First operand 12164 states and 14041 transitions. Second operand 13 states. [2018-11-06 21:03:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:01,766 INFO L93 Difference]: Finished difference Result 30652 states and 35555 transitions. [2018-11-06 21:03:01,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-06 21:03:01,766 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 281 [2018-11-06 21:03:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:01,802 INFO L225 Difference]: With dead ends: 30652 [2018-11-06 21:03:01,802 INFO L226 Difference]: Without dead ends: 18117 [2018-11-06 21:03:01,815 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 277 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2018-11-06 21:03:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18117 states. [2018-11-06 21:03:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18117 to 14921. [2018-11-06 21:03:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14921 states. [2018-11-06 21:03:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14921 states to 14921 states and 17053 transitions. [2018-11-06 21:03:02,047 INFO L78 Accepts]: Start accepts. Automaton has 14921 states and 17053 transitions. Word has length 281 [2018-11-06 21:03:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:02,048 INFO L480 AbstractCegarLoop]: Abstraction has 14921 states and 17053 transitions. [2018-11-06 21:03:02,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 21:03:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 14921 states and 17053 transitions. [2018-11-06 21:03:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-06 21:03:02,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:02,059 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:02,059 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:02,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:02,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1558528585, now seen corresponding path program 1 times [2018-11-06 21:03:02,059 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:02,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:02,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:02,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:02,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:02,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:02,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:03:02,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:02,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:02,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:02,481 INFO L87 Difference]: Start difference. First operand 14921 states and 17053 transitions. Second operand 4 states. [2018-11-06 21:03:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:04,265 INFO L93 Difference]: Finished difference Result 29843 states and 34114 transitions. [2018-11-06 21:03:04,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:04,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2018-11-06 21:03:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:04,288 INFO L225 Difference]: With dead ends: 29843 [2018-11-06 21:03:04,288 INFO L226 Difference]: Without dead ends: 15109 [2018-11-06 21:03:04,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15109 states. [2018-11-06 21:03:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15109 to 14551. [2018-11-06 21:03:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14551 states. [2018-11-06 21:03:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14551 states to 14551 states and 16531 transitions. [2018-11-06 21:03:04,507 INFO L78 Accepts]: Start accepts. Automaton has 14551 states and 16531 transitions. Word has length 300 [2018-11-06 21:03:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:04,508 INFO L480 AbstractCegarLoop]: Abstraction has 14551 states and 16531 transitions. [2018-11-06 21:03:04,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 14551 states and 16531 transitions. [2018-11-06 21:03:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-06 21:03:04,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:04,524 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:03:04,524 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:04,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash -615858705, now seen corresponding path program 1 times [2018-11-06 21:03:04,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:04,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:04,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:05,128 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 21:03:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-06 21:03:05,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:05,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:03:05,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:05,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:05,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:05,212 INFO L87 Difference]: Start difference. First operand 14551 states and 16531 transitions. Second operand 4 states. [2018-11-06 21:03:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:07,128 INFO L93 Difference]: Finished difference Result 28931 states and 32888 transitions. [2018-11-06 21:03:07,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:07,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2018-11-06 21:03:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:07,157 INFO L225 Difference]: With dead ends: 28931 [2018-11-06 21:03:07,157 INFO L226 Difference]: Without dead ends: 14567 [2018-11-06 21:03:07,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14567 states. [2018-11-06 21:03:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14567 to 13808. [2018-11-06 21:03:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13808 states. [2018-11-06 21:03:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13808 states to 13808 states and 15503 transitions. [2018-11-06 21:03:07,357 INFO L78 Accepts]: Start accepts. Automaton has 13808 states and 15503 transitions. Word has length 350 [2018-11-06 21:03:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:07,358 INFO L480 AbstractCegarLoop]: Abstraction has 13808 states and 15503 transitions. [2018-11-06 21:03:07,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 13808 states and 15503 transitions. [2018-11-06 21:03:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-06 21:03:07,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:07,376 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:07,376 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:07,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:07,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1002755243, now seen corresponding path program 1 times [2018-11-06 21:03:07,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:07,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:07,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:08,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:08,187 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:08,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:08,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 125 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:08,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:08,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-06 21:03:08,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:03:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:03:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:03:08,772 INFO L87 Difference]: Start difference. First operand 13808 states and 15503 transitions. Second operand 9 states. [2018-11-06 21:03:13,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:13,661 INFO L93 Difference]: Finished difference Result 44512 states and 50268 transitions. [2018-11-06 21:03:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 21:03:13,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 365 [2018-11-06 21:03:13,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:13,700 INFO L225 Difference]: With dead ends: 44512 [2018-11-06 21:03:13,700 INFO L226 Difference]: Without dead ends: 28836 [2018-11-06 21:03:13,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 361 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:03:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28836 states. [2018-11-06 21:03:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28836 to 22160. [2018-11-06 21:03:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22160 states. [2018-11-06 21:03:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22160 states to 22160 states and 24560 transitions. [2018-11-06 21:03:14,035 INFO L78 Accepts]: Start accepts. Automaton has 22160 states and 24560 transitions. Word has length 365 [2018-11-06 21:03:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:14,036 INFO L480 AbstractCegarLoop]: Abstraction has 22160 states and 24560 transitions. [2018-11-06 21:03:14,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:03:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 22160 states and 24560 transitions. [2018-11-06 21:03:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-11-06 21:03:14,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:14,057 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:14,057 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:14,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1409294431, now seen corresponding path program 1 times [2018-11-06 21:03:14,058 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:14,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:14,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:14,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:14,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-06 21:03:14,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:14,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:03:14,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:03:14,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:03:14,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:03:14,645 INFO L87 Difference]: Start difference. First operand 22160 states and 24560 transitions. Second operand 5 states. [2018-11-06 21:03:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:18,528 INFO L93 Difference]: Finished difference Result 47098 states and 52558 transitions. [2018-11-06 21:03:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:03:18,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2018-11-06 21:03:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:18,558 INFO L225 Difference]: With dead ends: 47098 [2018-11-06 21:03:18,558 INFO L226 Difference]: Without dead ends: 25125 [2018-11-06 21:03:18,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:03:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25125 states. [2018-11-06 21:03:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25125 to 23638. [2018-11-06 21:03:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23638 states. [2018-11-06 21:03:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23638 states to 23638 states and 25738 transitions. [2018-11-06 21:03:18,826 INFO L78 Accepts]: Start accepts. Automaton has 23638 states and 25738 transitions. Word has length 373 [2018-11-06 21:03:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:18,826 INFO L480 AbstractCegarLoop]: Abstraction has 23638 states and 25738 transitions. [2018-11-06 21:03:18,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:03:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 23638 states and 25738 transitions. [2018-11-06 21:03:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-06 21:03:18,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:18,843 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:18,843 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:18,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1929324361, now seen corresponding path program 1 times [2018-11-06 21:03:18,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:18,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:18,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:18,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:18,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 188 proven. 181 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 21:03:19,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:19,263 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:19,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:19,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:19,997 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 38 [2018-11-06 21:03:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 97 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:21,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:21,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-06 21:03:21,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:03:21,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:03:21,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:03:21,018 INFO L87 Difference]: Start difference. First operand 23638 states and 25738 transitions. Second operand 9 states. [2018-11-06 21:03:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:39,309 INFO L93 Difference]: Finished difference Result 58211 states and 63562 transitions. [2018-11-06 21:03:39,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-06 21:03:39,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 377 [2018-11-06 21:03:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:39,342 INFO L225 Difference]: With dead ends: 58211 [2018-11-06 21:03:39,342 INFO L226 Difference]: Without dead ends: 31583 [2018-11-06 21:03:39,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-06 21:03:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31583 states. [2018-11-06 21:03:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31583 to 24167. [2018-11-06 21:03:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24167 states. [2018-11-06 21:03:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24167 states to 24167 states and 25854 transitions. [2018-11-06 21:03:39,621 INFO L78 Accepts]: Start accepts. Automaton has 24167 states and 25854 transitions. Word has length 377 [2018-11-06 21:03:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:39,622 INFO L480 AbstractCegarLoop]: Abstraction has 24167 states and 25854 transitions. [2018-11-06 21:03:39,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:03:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24167 states and 25854 transitions. [2018-11-06 21:03:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-11-06 21:03:39,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:39,639 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:03:39,639 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:39,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:39,640 INFO L82 PathProgramCache]: Analyzing trace with hash 151943040, now seen corresponding path program 1 times [2018-11-06 21:03:39,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:39,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:39,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:39,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:39,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 278 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:40,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:40,666 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:40,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:40,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:41,304 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:03:41,866 WARN L179 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 22 [2018-11-06 21:03:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 287 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:42,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:42,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-06 21:03:42,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:03:42,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:03:42,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:03:42,612 INFO L87 Difference]: Start difference. First operand 24167 states and 25854 transitions. Second operand 12 states. [2018-11-06 21:03:42,988 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 23 [2018-11-06 21:03:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:50,149 INFO L93 Difference]: Finished difference Result 50130 states and 53543 transitions. [2018-11-06 21:03:50,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-06 21:03:50,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 419 [2018-11-06 21:03:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:50,178 INFO L225 Difference]: With dead ends: 50130 [2018-11-06 21:03:50,178 INFO L226 Difference]: Without dead ends: 29300 [2018-11-06 21:03:50,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2018-11-06 21:03:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29300 states. [2018-11-06 21:03:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29300 to 23051. [2018-11-06 21:03:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23051 states. [2018-11-06 21:03:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23051 states to 23051 states and 24600 transitions. [2018-11-06 21:03:50,456 INFO L78 Accepts]: Start accepts. Automaton has 23051 states and 24600 transitions. Word has length 419 [2018-11-06 21:03:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:50,456 INFO L480 AbstractCegarLoop]: Abstraction has 23051 states and 24600 transitions. [2018-11-06 21:03:50,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:03:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 23051 states and 24600 transitions. [2018-11-06 21:03:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-06 21:03:50,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:50,474 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:50,474 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:50,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:50,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1564812022, now seen corresponding path program 1 times [2018-11-06 21:03:50,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:50,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:50,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:50,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:50,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 154 proven. 358 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:50,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:50,988 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:50,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:51,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 279 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:52,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:52,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 21:03:52,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:03:52,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:03:52,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:03:52,901 INFO L87 Difference]: Start difference. First operand 23051 states and 24600 transitions. Second operand 10 states. [2018-11-06 21:03:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:59,343 INFO L93 Difference]: Finished difference Result 46488 states and 49682 transitions. [2018-11-06 21:03:59,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 21:03:59,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 463 [2018-11-06 21:03:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:59,369 INFO L225 Difference]: With dead ends: 46488 [2018-11-06 21:03:59,370 INFO L226 Difference]: Without dead ends: 26962 [2018-11-06 21:03:59,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-11-06 21:03:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26962 states. [2018-11-06 21:03:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26962 to 23425. [2018-11-06 21:03:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23425 states. [2018-11-06 21:03:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23425 states to 23425 states and 24985 transitions. [2018-11-06 21:03:59,647 INFO L78 Accepts]: Start accepts. Automaton has 23425 states and 24985 transitions. Word has length 463 [2018-11-06 21:03:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:59,647 INFO L480 AbstractCegarLoop]: Abstraction has 23425 states and 24985 transitions. [2018-11-06 21:03:59,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-06 21:03:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23425 states and 24985 transitions. [2018-11-06 21:03:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-11-06 21:03:59,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:59,663 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:59,663 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:59,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:59,664 INFO L82 PathProgramCache]: Analyzing trace with hash 227926468, now seen corresponding path program 1 times [2018-11-06 21:03:59,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:59,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:59,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:59,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:00,084 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 21:04:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 559 proven. 162 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-06 21:04:00,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:00,830 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:00,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:00,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-11-06 21:04:01,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:04:01,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 21:04:01,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:04:01,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:04:01,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:04:01,395 INFO L87 Difference]: Start difference. First operand 23425 states and 24985 transitions. Second operand 11 states. [2018-11-06 21:04:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:08,520 INFO L93 Difference]: Finished difference Result 62020 states and 66307 transitions. [2018-11-06 21:04:08,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-06 21:04:08,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 540 [2018-11-06 21:04:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:08,556 INFO L225 Difference]: With dead ends: 62020 [2018-11-06 21:04:08,556 INFO L226 Difference]: Without dead ends: 40266 [2018-11-06 21:04:08,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 538 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=355, Unknown=0, NotChecked=0, Total=552 [2018-11-06 21:04:08,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40266 states. [2018-11-06 21:04:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40266 to 20068. [2018-11-06 21:04:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20068 states. [2018-11-06 21:04:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20068 states to 20068 states and 21462 transitions. [2018-11-06 21:04:08,863 INFO L78 Accepts]: Start accepts. Automaton has 20068 states and 21462 transitions. Word has length 540 [2018-11-06 21:04:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:08,863 INFO L480 AbstractCegarLoop]: Abstraction has 20068 states and 21462 transitions. [2018-11-06 21:04:08,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:04:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 20068 states and 21462 transitions. [2018-11-06 21:04:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-11-06 21:04:08,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:08,877 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:08,877 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:08,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:08,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1969058300, now seen corresponding path program 1 times [2018-11-06 21:04:08,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:08,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:08,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:08,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:08,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-11-06 21:04:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:09,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-06 21:04:09,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:04:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:04:09,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:04:09,894 INFO L87 Difference]: Start difference. First operand 20068 states and 21462 transitions. Second operand 7 states. [2018-11-06 21:04:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:13,104 INFO L93 Difference]: Finished difference Result 41996 states and 44888 transitions. [2018-11-06 21:04:13,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:04:13,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 672 [2018-11-06 21:04:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:13,127 INFO L225 Difference]: With dead ends: 41996 [2018-11-06 21:04:13,127 INFO L226 Difference]: Without dead ends: 24707 [2018-11-06 21:04:13,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:04:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24707 states. [2018-11-06 21:04:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24707 to 19138. [2018-11-06 21:04:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19138 states. [2018-11-06 21:04:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19138 states to 19138 states and 20392 transitions. [2018-11-06 21:04:13,366 INFO L78 Accepts]: Start accepts. Automaton has 19138 states and 20392 transitions. Word has length 672 [2018-11-06 21:04:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:13,367 INFO L480 AbstractCegarLoop]: Abstraction has 19138 states and 20392 transitions. [2018-11-06 21:04:13,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:04:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 19138 states and 20392 transitions. [2018-11-06 21:04:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-11-06 21:04:13,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:13,382 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-11-06 21:04:13,382 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:13,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:13,383 INFO L82 PathProgramCache]: Analyzing trace with hash 254381055, now seen corresponding path program 1 times [2018-11-06 21:04:13,383 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:13,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:13,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:13,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:13,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1349 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-11-06 21:04:14,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:14,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 21:04:14,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:04:14,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:04:14,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:04:14,103 INFO L87 Difference]: Start difference. First operand 19138 states and 20392 transitions. Second operand 6 states. [2018-11-06 21:04:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:16,997 INFO L93 Difference]: Finished difference Result 41444 states and 44117 transitions. [2018-11-06 21:04:16,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:04:16,997 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 679 [2018-11-06 21:04:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:17,021 INFO L225 Difference]: With dead ends: 41444 [2018-11-06 21:04:17,021 INFO L226 Difference]: Without dead ends: 25085 [2018-11-06 21:04:17,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:04:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25085 states. [2018-11-06 21:04:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25085 to 18764. [2018-11-06 21:04:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18764 states. [2018-11-06 21:04:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18764 states to 18764 states and 19998 transitions. [2018-11-06 21:04:17,258 INFO L78 Accepts]: Start accepts. Automaton has 18764 states and 19998 transitions. Word has length 679 [2018-11-06 21:04:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:17,259 INFO L480 AbstractCegarLoop]: Abstraction has 18764 states and 19998 transitions. [2018-11-06 21:04:17,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:04:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18764 states and 19998 transitions. [2018-11-06 21:04:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2018-11-06 21:04:17,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:17,282 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:17,283 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:17,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash 864422703, now seen corresponding path program 1 times [2018-11-06 21:04:17,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:17,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:17,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:17,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:17,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:18,652 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-11-06 21:04:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 63 proven. 1075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:19,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:19,342 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:19,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:19,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:20,217 WARN L179 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 17 [2018-11-06 21:04:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 188 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:21,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:04:21,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-06 21:04:21,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:04:21,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:04:21,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:04:21,814 INFO L87 Difference]: Start difference. First operand 18764 states and 19998 transitions. Second operand 12 states. [2018-11-06 21:04:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:30,031 INFO L93 Difference]: Finished difference Result 53314 states and 56704 transitions. [2018-11-06 21:04:30,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 21:04:30,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 710 [2018-11-06 21:04:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:30,070 INFO L225 Difference]: With dead ends: 53314 [2018-11-06 21:04:30,071 INFO L226 Difference]: Without dead ends: 35476 [2018-11-06 21:04:30,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 704 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:04:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35476 states. [2018-11-06 21:04:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35476 to 23781. [2018-11-06 21:04:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23781 states. [2018-11-06 21:04:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23781 states to 23781 states and 25309 transitions. [2018-11-06 21:04:30,423 INFO L78 Accepts]: Start accepts. Automaton has 23781 states and 25309 transitions. Word has length 710 [2018-11-06 21:04:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:30,424 INFO L480 AbstractCegarLoop]: Abstraction has 23781 states and 25309 transitions. [2018-11-06 21:04:30,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:04:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 23781 states and 25309 transitions. [2018-11-06 21:04:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2018-11-06 21:04:30,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:30,438 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:30,438 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:30,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:30,439 INFO L82 PathProgramCache]: Analyzing trace with hash 303720429, now seen corresponding path program 1 times [2018-11-06 21:04:30,439 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:30,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:30,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 63 proven. 1074 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:31,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:31,928 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:31,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:32,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:58,794 WARN L179 SmtUtils]: Spent 26.40 s on a formula simplification. DAG size of input: 199 DAG size of output: 104 [2018-11-06 21:05:23,811 WARN L179 SmtUtils]: Spent 24.26 s on a formula simplification that was a NOOP. DAG size: 110 [2018-11-06 21:05:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 779 proven. 233 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-06 21:05:28,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:28,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-06 21:05:28,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 21:05:28,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 21:05:28,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:05:28,744 INFO L87 Difference]: Start difference. First operand 23781 states and 25309 transitions. Second operand 13 states. Received shutdown request... [2018-11-06 21:06:00,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-06 21:06:00,335 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:06:00,341 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:06:00,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:06:00 BoogieIcfgContainer [2018-11-06 21:06:00,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:06:00,342 INFO L168 Benchmark]: Toolchain (without parser) took 239012.47 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 688.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:00,343 INFO L168 Benchmark]: CDTParser took 0.26 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-11-06 21:06:00,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 915.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:00,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 288.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -857.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:00,345 INFO L168 Benchmark]: Boogie Preprocessor took 144.22 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:00,345 INFO L168 Benchmark]: RCFGBuilder took 4683.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 169.5 MB). Peak memory consumption was 169.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:00,346 INFO L168 Benchmark]: TraceAbstraction took 232974.80 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 542.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:00,351 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 915.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 288.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -857.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.22 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4683.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 169.5 MB). Peak memory consumption was 169.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232974.80 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 3.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 542.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 198]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 198). Cancelled while BasicCegarLoop was constructing difference of abstraction (23781states) and FLOYD_HOARE automaton (currently 15 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (37053 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. TIMEOUT Result, 232.8s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 144.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3048 SDtfs, 25280 SDslu, 3964 SDs, 0 SdLazy, 69398 SolverSat, 9063 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 121.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4320 GetRequests, 4125 SyntacticMatches, 21 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 64.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24167occurred in iteration=12, 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: 3.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 75237 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 77.6s InterpolantComputationTime, 11435 NumberOfCodeBlocks, 11435 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 11407 ConstructedInterpolants, 1343 QuantifiedInterpolants, 67126095 SizeOfPredicates, 14 NumberOfNonLiveVariables, 5274 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 8493/14331 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown