java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label46_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 20:33:31,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 20:33:31,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 20:33:31,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 20:33:31,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 20:33:31,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 20:33:31,566 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 20:33:31,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 20:33:31,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 20:33:31,574 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 20:33:31,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 20:33:31,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 20:33:31,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 20:33:31,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 20:33:31,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 20:33:31,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 20:33:31,592 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 20:33:31,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 20:33:31,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 20:33:31,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 20:33:31,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 20:33:31,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 20:33:31,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 20:33:31,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 20:33:31,609 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 20:33:31,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 20:33:31,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 20:33:31,613 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 20:33:31,614 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 20:33:31,616 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 20:33:31,616 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 20:33:31,617 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 20:33:31,617 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 20:33:31,617 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 20:33:31,620 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 20:33:31,620 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 20:33:31,622 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 20:33:31,650 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 20:33:31,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 20:33:31,651 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 20:33:31,652 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 20:33:31,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 20:33:31,652 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 20:33:31,653 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 20:33:31,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 20:33:31,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 20:33:31,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 20:33:31,656 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 20:33:31,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 20:33:31,657 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 20:33:31,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 20:33:31,657 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 20:33:31,657 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 20:33:31,658 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 20:33:31,658 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 20:33:31,658 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 20:33:31,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:33:31,658 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 20:33:31,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 20:33:31,660 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 20:33:31,660 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 20:33:31,660 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 20:33:31,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 20:33:31,661 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 20:33:31,661 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 20:33:31,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 20:33:31,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 20:33:31,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 20:33:31,748 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 20:33:31,748 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 20:33:31,749 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label46_true-unreach-call.c [2018-10-23 20:33:31,812 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/52e0406d2/ab30da3c46cf4c98aafbd745546fc1e1/FLAGeaaa2f0db [2018-10-23 20:33:32,561 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 20:33:32,562 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label46_true-unreach-call.c [2018-10-23 20:33:32,589 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/52e0406d2/ab30da3c46cf4c98aafbd745546fc1e1/FLAGeaaa2f0db [2018-10-23 20:33:32,608 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/52e0406d2/ab30da3c46cf4c98aafbd745546fc1e1 [2018-10-23 20:33:32,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 20:33:32,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 20:33:32,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 20:33:32,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 20:33:32,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 20:33:32,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:33:32" (1/1) ... [2018-10-23 20:33:32,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa98528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:32, skipping insertion in model container [2018-10-23 20:33:32,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:33:32" (1/1) ... [2018-10-23 20:33:32,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 20:33:32,745 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 20:33:33,571 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:33:33,575 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 20:33:33,889 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 20:33:33,912 INFO L193 MainTranslator]: Completed translation [2018-10-23 20:33:33,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33 WrapperNode [2018-10-23 20:33:33,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 20:33:33,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 20:33:33,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 20:33:33,914 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 20:33:33,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (1/1) ... [2018-10-23 20:33:33,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (1/1) ... [2018-10-23 20:33:34,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 20:33:34,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 20:33:34,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 20:33:34,318 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 20:33:34,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (1/1) ... [2018-10-23 20:33:34,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (1/1) ... [2018-10-23 20:33:34,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (1/1) ... [2018-10-23 20:33:34,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (1/1) ... [2018-10-23 20:33:34,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (1/1) ... [2018-10-23 20:33:34,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (1/1) ... [2018-10-23 20:33:34,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (1/1) ... [2018-10-23 20:33:34,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 20:33:34,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 20:33:34,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 20:33:34,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 20:33:34,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 20:33:34,631 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 20:33:34,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 20:33:34,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 20:33:44,323 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 20:33:44,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:33:44 BoogieIcfgContainer [2018-10-23 20:33:44,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 20:33:44,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 20:33:44,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 20:33:44,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 20:33:44,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:33:32" (1/3) ... [2018-10-23 20:33:44,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498d1f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:33:44, skipping insertion in model container [2018-10-23 20:33:44,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:33:33" (2/3) ... [2018-10-23 20:33:44,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498d1f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:33:44, skipping insertion in model container [2018-10-23 20:33:44,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:33:44" (3/3) ... [2018-10-23 20:33:44,336 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label46_true-unreach-call.c [2018-10-23 20:33:44,347 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 20:33:44,356 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 20:33:44,374 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 20:33:44,415 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 20:33:44,416 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 20:33:44,416 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 20:33:44,416 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 20:33:44,416 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 20:33:44,416 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 20:33:44,416 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 20:33:44,417 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 20:33:44,417 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 20:33:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states. [2018-10-23 20:33:44,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-23 20:33:44,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:33:44,461 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] [2018-10-23 20:33:44,464 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:33:44,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:33:44,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1934902334, now seen corresponding path program 1 times [2018-10-23 20:33:44,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:33:44,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:33:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:44,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:33:44,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:33:44,938 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 20:33:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:33:44,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:33:44,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:33:44,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:33:44,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:33:44,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:33:44,977 INFO L87 Difference]: Start difference. First operand 425 states. Second operand 4 states. [2018-10-23 20:33:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:33:52,696 INFO L93 Difference]: Finished difference Result 1473 states and 2723 transitions. [2018-10-23 20:33:52,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:33:52,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-10-23 20:33:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:33:52,732 INFO L225 Difference]: With dead ends: 1473 [2018-10-23 20:33:52,733 INFO L226 Difference]: Without dead ends: 1041 [2018-10-23 20:33:52,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:33:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-10-23 20:33:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1037. [2018-10-23 20:33:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-10-23 20:33:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1674 transitions. [2018-10-23 20:33:52,845 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1674 transitions. Word has length 44 [2018-10-23 20:33:52,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:33:52,846 INFO L481 AbstractCegarLoop]: Abstraction has 1037 states and 1674 transitions. [2018-10-23 20:33:52,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:33:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1674 transitions. [2018-10-23 20:33:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-23 20:33:52,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:33:52,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:33:52,856 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:33:52,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:33:52,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1247411675, now seen corresponding path program 1 times [2018-10-23 20:33:52,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:33:52,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:33:52,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:52,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:33:52,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:33:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:33:53,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:33:53,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:33:53,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:33:53,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:33:53,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:33:53,232 INFO L87 Difference]: Start difference. First operand 1037 states and 1674 transitions. Second operand 4 states. [2018-10-23 20:33:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:33:59,741 INFO L93 Difference]: Finished difference Result 3940 states and 6434 transitions. [2018-10-23 20:33:59,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:33:59,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-10-23 20:33:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:33:59,771 INFO L225 Difference]: With dead ends: 3940 [2018-10-23 20:33:59,771 INFO L226 Difference]: Without dead ends: 2905 [2018-10-23 20:33:59,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:33:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2018-10-23 20:33:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1939. [2018-10-23 20:33:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2018-10-23 20:33:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2819 transitions. [2018-10-23 20:33:59,853 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2819 transitions. Word has length 164 [2018-10-23 20:33:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:33:59,855 INFO L481 AbstractCegarLoop]: Abstraction has 1939 states and 2819 transitions. [2018-10-23 20:33:59,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:33:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2819 transitions. [2018-10-23 20:33:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-23 20:33:59,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:33:59,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:33:59,876 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:33:59,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:33:59,876 INFO L82 PathProgramCache]: Analyzing trace with hash 390759141, now seen corresponding path program 1 times [2018-10-23 20:33:59,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:33:59,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:33:59,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:59,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:33:59,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:33:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-23 20:34:00,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:34:00,543 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:34:00,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:00,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:34:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:34:00,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:34:00,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-10-23 20:34:00,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:34:00,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:34:00,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:34:00,830 INFO L87 Difference]: Start difference. First operand 1939 states and 2819 transitions. Second operand 4 states. [2018-10-23 20:34:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:08,690 INFO L93 Difference]: Finished difference Result 5981 states and 8477 transitions. [2018-10-23 20:34:08,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:34:08,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2018-10-23 20:34:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:08,718 INFO L225 Difference]: With dead ends: 5981 [2018-10-23 20:34:08,718 INFO L226 Difference]: Without dead ends: 4044 [2018-10-23 20:34:08,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:34:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2018-10-23 20:34:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 2539. [2018-10-23 20:34:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2539 states. [2018-10-23 20:34:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 3487 transitions. [2018-10-23 20:34:08,794 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 3487 transitions. Word has length 315 [2018-10-23 20:34:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:08,795 INFO L481 AbstractCegarLoop]: Abstraction has 2539 states and 3487 transitions. [2018-10-23 20:34:08,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:34:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3487 transitions. [2018-10-23 20:34:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-23 20:34:08,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:08,802 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:34:08,803 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:08,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1752514879, now seen corresponding path program 1 times [2018-10-23 20:34:08,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:08,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:08,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:09,474 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-23 20:34:09,803 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-10-23 20:34:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-23 20:34:10,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:34:10,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:34:10,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:34:10,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:34:10,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:34:10,417 INFO L87 Difference]: Start difference. First operand 2539 states and 3487 transitions. Second operand 5 states. [2018-10-23 20:34:17,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:17,071 INFO L93 Difference]: Finished difference Result 6278 states and 8294 transitions. [2018-10-23 20:34:17,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:34:17,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 323 [2018-10-23 20:34:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:17,090 INFO L225 Difference]: With dead ends: 6278 [2018-10-23 20:34:17,091 INFO L226 Difference]: Without dead ends: 3741 [2018-10-23 20:34:17,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:34:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2018-10-23 20:34:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3440. [2018-10-23 20:34:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3440 states. [2018-10-23 20:34:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4448 transitions. [2018-10-23 20:34:17,163 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4448 transitions. Word has length 323 [2018-10-23 20:34:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:17,164 INFO L481 AbstractCegarLoop]: Abstraction has 3440 states and 4448 transitions. [2018-10-23 20:34:17,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:34:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4448 transitions. [2018-10-23 20:34:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-23 20:34:17,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:17,172 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:34:17,172 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:17,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:17,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1215908209, now seen corresponding path program 1 times [2018-10-23 20:34:17,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:17,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:17,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:17,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:17,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:17,725 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-23 20:34:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 93 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:34:18,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:34:18,544 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:34:18,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:18,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:34:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 20:34:18,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 20:34:18,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-10-23 20:34:18,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:34:18,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:34:18,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-23 20:34:18,893 INFO L87 Difference]: Start difference. First operand 3440 states and 4448 transitions. Second operand 9 states. [2018-10-23 20:34:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:32,720 INFO L93 Difference]: Finished difference Result 8444 states and 10930 transitions. [2018-10-23 20:34:32,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 20:34:32,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 397 [2018-10-23 20:34:32,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:32,748 INFO L225 Difference]: With dead ends: 8444 [2018-10-23 20:34:32,749 INFO L226 Difference]: Without dead ends: 5006 [2018-10-23 20:34:32,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 400 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-10-23 20:34:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5006 states. [2018-10-23 20:34:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5006 to 4645. [2018-10-23 20:34:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4645 states. [2018-10-23 20:34:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4645 states to 4645 states and 5663 transitions. [2018-10-23 20:34:32,858 INFO L78 Accepts]: Start accepts. Automaton has 4645 states and 5663 transitions. Word has length 397 [2018-10-23 20:34:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:32,860 INFO L481 AbstractCegarLoop]: Abstraction has 4645 states and 5663 transitions. [2018-10-23 20:34:32,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:34:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4645 states and 5663 transitions. [2018-10-23 20:34:32,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-23 20:34:32,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:32,873 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:34:32,873 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:32,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1106948331, now seen corresponding path program 1 times [2018-10-23 20:34:32,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:32,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-23 20:34:33,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:34:33,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 20:34:33,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 20:34:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 20:34:33,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:34:33,496 INFO L87 Difference]: Start difference. First operand 4645 states and 5663 transitions. Second operand 4 states. [2018-10-23 20:34:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:37,637 INFO L93 Difference]: Finished difference Result 10191 states and 12538 transitions. [2018-10-23 20:34:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 20:34:37,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 416 [2018-10-23 20:34:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:37,661 INFO L225 Difference]: With dead ends: 10191 [2018-10-23 20:34:37,661 INFO L226 Difference]: Without dead ends: 5548 [2018-10-23 20:34:37,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 20:34:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2018-10-23 20:34:37,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5546. [2018-10-23 20:34:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5546 states. [2018-10-23 20:34:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5546 states to 5546 states and 6603 transitions. [2018-10-23 20:34:37,772 INFO L78 Accepts]: Start accepts. Automaton has 5546 states and 6603 transitions. Word has length 416 [2018-10-23 20:34:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:37,773 INFO L481 AbstractCegarLoop]: Abstraction has 5546 states and 6603 transitions. [2018-10-23 20:34:37,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 20:34:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 6603 transitions. [2018-10-23 20:34:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2018-10-23 20:34:37,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:37,788 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:34:37,789 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:37,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1134081088, now seen corresponding path program 1 times [2018-10-23 20:34:37,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:37,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:37,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:37,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:37,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-10-23 20:34:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:34:38,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:34:38,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:34:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:34:38,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:34:38,274 INFO L87 Difference]: Start difference. First operand 5546 states and 6603 transitions. Second operand 3 states. [2018-10-23 20:34:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:42,076 INFO L93 Difference]: Finished difference Result 12889 states and 15642 transitions. [2018-10-23 20:34:42,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:34:42,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2018-10-23 20:34:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:42,106 INFO L225 Difference]: With dead ends: 12889 [2018-10-23 20:34:42,106 INFO L226 Difference]: Without dead ends: 7345 [2018-10-23 20:34:42,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:34:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7345 states. [2018-10-23 20:34:42,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7345 to 7345. [2018-10-23 20:34:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7345 states. [2018-10-23 20:34:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7345 states to 7345 states and 8785 transitions. [2018-10-23 20:34:42,246 INFO L78 Accepts]: Start accepts. Automaton has 7345 states and 8785 transitions. Word has length 511 [2018-10-23 20:34:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:42,247 INFO L481 AbstractCegarLoop]: Abstraction has 7345 states and 8785 transitions. [2018-10-23 20:34:42,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:34:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 7345 states and 8785 transitions. [2018-10-23 20:34:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-10-23 20:34:42,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:42,269 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:34:42,269 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:42,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1637939412, now seen corresponding path program 1 times [2018-10-23 20:34:42,270 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:42,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:42,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:42,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:42,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 620 proven. 4 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-23 20:34:43,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:34:43,482 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:34:43,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:43,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:34:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 585 proven. 39 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-23 20:34:44,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:34:44,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-23 20:34:44,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:34:44,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:34:44,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-23 20:34:44,628 INFO L87 Difference]: Start difference. First operand 7345 states and 8785 transitions. Second operand 9 states. [2018-10-23 20:34:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:34:57,268 INFO L93 Difference]: Finished difference Result 20557 states and 24375 transitions. [2018-10-23 20:34:57,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-23 20:34:57,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 603 [2018-10-23 20:34:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:34:57,286 INFO L225 Difference]: With dead ends: 20557 [2018-10-23 20:34:57,286 INFO L226 Difference]: Without dead ends: 8495 [2018-10-23 20:34:57,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 600 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-23 20:34:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8495 states. [2018-10-23 20:34:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8495 to 5494. [2018-10-23 20:34:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2018-10-23 20:34:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 5979 transitions. [2018-10-23 20:34:57,397 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 5979 transitions. Word has length 603 [2018-10-23 20:34:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:34:57,397 INFO L481 AbstractCegarLoop]: Abstraction has 5494 states and 5979 transitions. [2018-10-23 20:34:57,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:34:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 5979 transitions. [2018-10-23 20:34:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2018-10-23 20:34:57,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:34:57,417 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:34:57,417 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:34:57,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:34:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1980651932, now seen corresponding path program 1 times [2018-10-23 20:34:57,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:34:57,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:34:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:57,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:34:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:34:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:34:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-10-23 20:34:57,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:34:57,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:34:57,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:34:57,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:34:57,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:34:57,952 INFO L87 Difference]: Start difference. First operand 5494 states and 5979 transitions. Second operand 3 states. [2018-10-23 20:35:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:35:01,890 INFO L93 Difference]: Finished difference Result 10984 states and 11954 transitions. [2018-10-23 20:35:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:35:01,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 645 [2018-10-23 20:35:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:35:01,901 INFO L225 Difference]: With dead ends: 10984 [2018-10-23 20:35:01,901 INFO L226 Difference]: Without dead ends: 5492 [2018-10-23 20:35:01,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:35:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2018-10-23 20:35:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 5492. [2018-10-23 20:35:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5492 states. [2018-10-23 20:35:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 5975 transitions. [2018-10-23 20:35:01,979 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 5975 transitions. Word has length 645 [2018-10-23 20:35:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:35:01,980 INFO L481 AbstractCegarLoop]: Abstraction has 5492 states and 5975 transitions. [2018-10-23 20:35:01,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:35:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 5975 transitions. [2018-10-23 20:35:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-23 20:35:01,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:35:01,989 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:35:01,989 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:35:01,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:35:01,989 INFO L82 PathProgramCache]: Analyzing trace with hash 280923292, now seen corresponding path program 1 times [2018-10-23 20:35:01,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:35:01,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:35:01,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:01,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:01,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2018-10-23 20:35:02,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:35:02,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:35:02,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:35:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:35:02,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:35:02,562 INFO L87 Difference]: Start difference. First operand 5492 states and 5975 transitions. Second operand 3 states. [2018-10-23 20:35:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:35:05,188 INFO L93 Difference]: Finished difference Result 13994 states and 15196 transitions. [2018-10-23 20:35:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:35:05,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 672 [2018-10-23 20:35:05,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:35:05,206 INFO L225 Difference]: With dead ends: 13994 [2018-10-23 20:35:05,206 INFO L226 Difference]: Without dead ends: 8195 [2018-10-23 20:35:05,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:35:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8195 states. [2018-10-23 20:35:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8195 to 7283. [2018-10-23 20:35:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7283 states. [2018-10-23 20:35:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 7851 transitions. [2018-10-23 20:35:05,465 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 7851 transitions. Word has length 672 [2018-10-23 20:35:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:35:05,467 INFO L481 AbstractCegarLoop]: Abstraction has 7283 states and 7851 transitions. [2018-10-23 20:35:05,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:35:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 7851 transitions. [2018-10-23 20:35:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2018-10-23 20:35:05,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:35:05,478 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:35:05,478 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:35:05,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:35:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1634190814, now seen corresponding path program 1 times [2018-10-23 20:35:05,479 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:35:05,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:35:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:05,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2018-10-23 20:35:06,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:35:06,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 20:35:06,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 20:35:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 20:35:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:35:06,098 INFO L87 Difference]: Start difference. First operand 7283 states and 7851 transitions. Second operand 5 states. [2018-10-23 20:35:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:35:09,171 INFO L93 Difference]: Finished difference Result 15733 states and 16913 transitions. [2018-10-23 20:35:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 20:35:09,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 705 [2018-10-23 20:35:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:35:09,183 INFO L225 Difference]: With dead ends: 15733 [2018-10-23 20:35:09,183 INFO L226 Difference]: Without dead ends: 8150 [2018-10-23 20:35:09,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 20:35:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8150 states. [2018-10-23 20:35:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8150 to 6650. [2018-10-23 20:35:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6650 states. [2018-10-23 20:35:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6650 states to 6650 states and 6936 transitions. [2018-10-23 20:35:09,286 INFO L78 Accepts]: Start accepts. Automaton has 6650 states and 6936 transitions. Word has length 705 [2018-10-23 20:35:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:35:09,287 INFO L481 AbstractCegarLoop]: Abstraction has 6650 states and 6936 transitions. [2018-10-23 20:35:09,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 20:35:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6650 states and 6936 transitions. [2018-10-23 20:35:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2018-10-23 20:35:09,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:35:09,305 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:35:09,306 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:35:09,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:35:09,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2037198302, now seen corresponding path program 1 times [2018-10-23 20:35:09,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:35:09,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:35:09,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:09,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2018-10-23 20:35:10,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 20:35:10,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 20:35:10,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 20:35:10,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 20:35:10,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:35:10,353 INFO L87 Difference]: Start difference. First operand 6650 states and 6936 transitions. Second operand 3 states. [2018-10-23 20:35:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:35:11,647 INFO L93 Difference]: Finished difference Result 15097 states and 15800 transitions. [2018-10-23 20:35:11,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 20:35:11,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 920 [2018-10-23 20:35:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:35:11,655 INFO L225 Difference]: With dead ends: 15097 [2018-10-23 20:35:11,656 INFO L226 Difference]: Without dead ends: 8749 [2018-10-23 20:35:11,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 20:35:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8749 states. [2018-10-23 20:35:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8749 to 8149. [2018-10-23 20:35:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8149 states. [2018-10-23 20:35:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8149 states to 8149 states and 8478 transitions. [2018-10-23 20:35:11,762 INFO L78 Accepts]: Start accepts. Automaton has 8149 states and 8478 transitions. Word has length 920 [2018-10-23 20:35:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:35:11,763 INFO L481 AbstractCegarLoop]: Abstraction has 8149 states and 8478 transitions. [2018-10-23 20:35:11,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 20:35:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8149 states and 8478 transitions. [2018-10-23 20:35:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2018-10-23 20:35:11,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 20:35:11,786 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 20:35:11,787 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 20:35:11,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 20:35:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash 103677985, now seen corresponding path program 1 times [2018-10-23 20:35:11,787 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 20:35:11,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 20:35:11,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:11,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:11,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 20:35:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 42 proven. 717 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-10-23 20:35:13,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 20:35:13,959 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 20:35:13,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 20:35:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 20:35:14,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 20:35:15,521 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_825 Int)) (and (<= (+ v_~a0~0_825 44) 0) (<= (mod v_~a0~0_825 299926) (+ c_~a0~0 300074)) (<= 0 v_~a0~0_825))) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 299926))) (and (not (= .cse0 0)) (< v_prenex_1 0) (<= (+ v_prenex_1 44) 0) (<= .cse0 (+ c_~a0~0 600000))))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (= .cse1 0) (<= (+ v_prenex_2 44) 0) (<= .cse1 (+ c_~a0~0 300074)))))) is different from true [2018-10-23 20:35:16,235 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2018-10-23 20:35:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 483 trivial. 634 not checked. [2018-10-23 20:35:19,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-23 20:35:19,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-10-23 20:35:19,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 20:35:19,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 20:35:19,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2018-10-23 20:35:19,653 INFO L87 Difference]: Start difference. First operand 8149 states and 8478 transitions. Second operand 9 states. [2018-10-23 20:35:28,896 WARN L179 SmtUtils]: Spent 5.37 s on a formula simplification. DAG size of input: 39 DAG size of output: 19 [2018-10-23 20:35:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 20:35:35,651 INFO L93 Difference]: Finished difference Result 15611 states and 16209 transitions. [2018-10-23 20:35:35,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-23 20:35:35,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 941 [2018-10-23 20:35:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 20:35:35,653 INFO L225 Difference]: With dead ends: 15611 [2018-10-23 20:35:35,653 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 20:35:35,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 938 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=35, Invalid=57, Unknown=2, NotChecked=16, Total=110 [2018-10-23 20:35:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 20:35:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 20:35:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 20:35:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 20:35:35,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 941 [2018-10-23 20:35:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 20:35:35,663 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 20:35:35,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 20:35:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 20:35:35,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 20:35:35,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 20:35:35,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:35,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:35,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:35,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:35,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:35,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:35,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:35,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:35,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:35,970 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 201 [2018-10-23 20:35:35,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,246 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 201 [2018-10-23 20:35:36,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 20:35:36,435 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 174 [2018-10-23 20:37:13,435 WARN L179 SmtUtils]: Spent 1.62 m on a formula simplification. DAG size of input: 185 DAG size of output: 69 Received shutdown request... [2018-10-23 20:37:41,439 WARN L187 SmtUtils]: Removed 29 from assertion stack [2018-10-23 20:37:41,440 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-10-23 20:37:41,441 INFO L168 Benchmark]: Toolchain (without parser) took 248820.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.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-23 20:37:41,442 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 20:37:41,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1290.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2018-10-23 20:37:41,443 INFO L168 Benchmark]: Boogie Procedure Inliner took 403.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -866.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2018-10-23 20:37:41,444 INFO L168 Benchmark]: Boogie Preprocessor took 245.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2018-10-23 20:37:41,445 INFO L168 Benchmark]: RCFGBuilder took 9760.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 327.0 MB). Peak memory consumption was 327.0 MB. Max. memory is 7.1 GB. [2018-10-23 20:37:41,446 INFO L168 Benchmark]: TraceAbstraction took 237114.77 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.8 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 723.3 MB. Max. memory is 7.1 GB. [2018-10-23 20:37:41,451 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1290.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 403.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -866.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 245.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9760.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 327.0 MB). Peak memory consumption was 327.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237114.77 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 1.8 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 723.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 185. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown