java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:58:11,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:58:11,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:58:11,868 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:58:11,868 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:58:11,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:58:11,871 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:58:11,873 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:58:11,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:58:11,877 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:58:11,878 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:58:11,878 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:58:11,879 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:58:11,880 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:58:11,881 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:58:11,882 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:58:11,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:58:11,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:58:11,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:58:11,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:58:11,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:58:11,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:58:11,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:58:11,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:58:11,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:58:11,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:58:11,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:58:11,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:58:11,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:58:11,921 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:58:11,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:58:11,923 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:58:11,923 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:58:11,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:58:11,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:58:11,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:58:11,928 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 19:58:11,958 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:58:11,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:58:11,959 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:58:11,960 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:58:11,960 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:58:11,960 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:58:11,961 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:58:11,962 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:58:11,962 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:58:11,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:58:11,962 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:58:11,963 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:58:11,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:58:11,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:58:11,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:58:11,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:58:11,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:58:11,965 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:58:11,965 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:58:11,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:58:11,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:58:11,966 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:58:11,966 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:58:11,966 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:58:11,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:58:11,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:58:11,967 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:58:11,967 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 19:58:12,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:58:12,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:58:12,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:58:12,062 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:58:12,063 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:58:12,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c [2018-10-26 19:58:12,143 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2f5ad4fff/6d00fc9800fd401fb601a913090f11b8/FLAGf5a9c100a [2018-10-26 19:58:12,810 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:58:12,811 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label07_true-unreach-call.c [2018-10-26 19:58:12,837 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2f5ad4fff/6d00fc9800fd401fb601a913090f11b8/FLAGf5a9c100a [2018-10-26 19:58:12,852 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2f5ad4fff/6d00fc9800fd401fb601a913090f11b8 [2018-10-26 19:58:12,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:58:12,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:58:12,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:12,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:58:12,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:58:12,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:12" (1/1) ... [2018-10-26 19:58:12,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@121c62cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:12, skipping insertion in model container [2018-10-26 19:58:12,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:58:12" (1/1) ... [2018-10-26 19:58:12,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:58:12,986 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:58:13,770 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:13,775 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:58:14,024 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:58:14,048 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:58:14,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14 WrapperNode [2018-10-26 19:58:14,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:58:14,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:14,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:58:14,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:58:14,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (1/1) ... [2018-10-26 19:58:14,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (1/1) ... [2018-10-26 19:58:14,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:58:14,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:58:14,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:58:14,357 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:58:14,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (1/1) ... [2018-10-26 19:58:14,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (1/1) ... [2018-10-26 19:58:14,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (1/1) ... [2018-10-26 19:58:14,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (1/1) ... [2018-10-26 19:58:14,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (1/1) ... [2018-10-26 19:58:14,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (1/1) ... [2018-10-26 19:58:14,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (1/1) ... [2018-10-26 19:58:14,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:58:14,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:58:14,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:58:14,491 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:58:14,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:58:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:58:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:58:14,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:58:20,156 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:58:20,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:20 BoogieIcfgContainer [2018-10-26 19:58:20,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:58:20,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:58:20,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:58:20,166 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:58:20,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:58:12" (1/3) ... [2018-10-26 19:58:20,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3763d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:20, skipping insertion in model container [2018-10-26 19:58:20,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:58:14" (2/3) ... [2018-10-26 19:58:20,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3763d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:58:20, skipping insertion in model container [2018-10-26 19:58:20,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:58:20" (3/3) ... [2018-10-26 19:58:20,172 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label07_true-unreach-call.c [2018-10-26 19:58:20,182 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:58:20,196 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:58:20,216 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:58:20,270 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:58:20,271 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:58:20,271 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:58:20,271 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:58:20,272 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:58:20,272 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:58:20,272 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:58:20,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:58:20,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:58:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-26 19:58:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-26 19:58:20,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:20,330 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:20,333 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:20,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash 418458546, now seen corresponding path program 1 times [2018-10-26 19:58:20,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:20,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:20,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:20,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:20,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:21,097 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 19:58:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:21,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:21,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:21,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:21,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:21,206 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-26 19:58:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:24,866 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-10-26 19:58:24,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:24,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-10-26 19:58:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:24,894 INFO L225 Difference]: With dead ends: 1027 [2018-10-26 19:58:24,895 INFO L226 Difference]: Without dead ends: 717 [2018-10-26 19:58:24,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-26 19:58:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-10-26 19:58:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-26 19:58:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-10-26 19:58:24,994 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 173 [2018-10-26 19:58:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:24,995 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-10-26 19:58:24,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-10-26 19:58:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 19:58:25,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:25,003 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:25,004 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:25,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:25,004 INFO L82 PathProgramCache]: Analyzing trace with hash 72085267, now seen corresponding path program 1 times [2018-10-26 19:58:25,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:25,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:25,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:25,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:25,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:25,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:25,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:25,145 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-10-26 19:58:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:27,255 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-10-26 19:58:27,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:27,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-26 19:58:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:27,264 INFO L225 Difference]: With dead ends: 2058 [2018-10-26 19:58:27,264 INFO L226 Difference]: Without dead ends: 1345 [2018-10-26 19:58:27,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-10-26 19:58:27,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-10-26 19:58:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-10-26 19:58:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-10-26 19:58:27,335 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 182 [2018-10-26 19:58:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:27,335 INFO L481 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-10-26 19:58:27,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-10-26 19:58:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 19:58:27,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:27,344 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:27,344 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:27,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:27,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2004095041, now seen corresponding path program 1 times [2018-10-26 19:58:27,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:27,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:27,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:27,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:27,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:27,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:27,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:27,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:27,629 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-10-26 19:58:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:29,970 INFO L93 Difference]: Finished difference Result 3896 states and 6120 transitions. [2018-10-26 19:58:29,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:29,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-10-26 19:58:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:29,985 INFO L225 Difference]: With dead ends: 3896 [2018-10-26 19:58:29,985 INFO L226 Difference]: Without dead ends: 2567 [2018-10-26 19:58:29,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2018-10-26 19:58:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2565. [2018-10-26 19:58:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2018-10-26 19:58:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3748 transitions. [2018-10-26 19:58:30,040 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3748 transitions. Word has length 190 [2018-10-26 19:58:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:30,040 INFO L481 AbstractCegarLoop]: Abstraction has 2565 states and 3748 transitions. [2018-10-26 19:58:30,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3748 transitions. [2018-10-26 19:58:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-26 19:58:30,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:30,048 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:30,048 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:30,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:30,048 INFO L82 PathProgramCache]: Analyzing trace with hash 704749675, now seen corresponding path program 1 times [2018-10-26 19:58:30,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:30,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:30,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:30,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:30,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:30,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:30,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:30,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:30,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:30,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:30,296 INFO L87 Difference]: Start difference. First operand 2565 states and 3748 transitions. Second operand 4 states. [2018-10-26 19:58:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:34,271 INFO L93 Difference]: Finished difference Result 5099 states and 7455 transitions. [2018-10-26 19:58:34,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:34,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-10-26 19:58:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:34,285 INFO L225 Difference]: With dead ends: 5099 [2018-10-26 19:58:34,285 INFO L226 Difference]: Without dead ends: 2536 [2018-10-26 19:58:34,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2018-10-26 19:58:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2018-10-26 19:58:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2018-10-26 19:58:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3609 transitions. [2018-10-26 19:58:34,334 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3609 transitions. Word has length 201 [2018-10-26 19:58:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:34,335 INFO L481 AbstractCegarLoop]: Abstraction has 2536 states and 3609 transitions. [2018-10-26 19:58:34,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3609 transitions. [2018-10-26 19:58:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 19:58:34,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:34,342 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:34,342 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:34,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:34,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1273453360, now seen corresponding path program 1 times [2018-10-26 19:58:34,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:34,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:34,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:34,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:34,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:34,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:34,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:34,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:34,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:34,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:34,574 INFO L87 Difference]: Start difference. First operand 2536 states and 3609 transitions. Second operand 4 states. [2018-10-26 19:58:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:37,354 INFO L93 Difference]: Finished difference Result 10131 states and 14422 transitions. [2018-10-26 19:58:37,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:58:37,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-10-26 19:58:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:37,386 INFO L225 Difference]: With dead ends: 10131 [2018-10-26 19:58:37,386 INFO L226 Difference]: Without dead ends: 7597 [2018-10-26 19:58:37,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:37,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2018-10-26 19:58:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 7593. [2018-10-26 19:58:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-10-26 19:58:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 10758 transitions. [2018-10-26 19:58:37,534 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 10758 transitions. Word has length 203 [2018-10-26 19:58:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:37,534 INFO L481 AbstractCegarLoop]: Abstraction has 7593 states and 10758 transitions. [2018-10-26 19:58:37,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 10758 transitions. [2018-10-26 19:58:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-26 19:58:37,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:37,548 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:37,548 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:37,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2049995315, now seen corresponding path program 1 times [2018-10-26 19:58:37,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:37,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:37,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:37,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 19:58:37,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:37,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:37,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:37,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:37,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:37,721 INFO L87 Difference]: Start difference. First operand 7593 states and 10758 transitions. Second operand 3 states. [2018-10-26 19:58:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:39,028 INFO L93 Difference]: Finished difference Result 15190 states and 21526 transitions. [2018-10-26 19:58:39,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:39,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-10-26 19:58:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:39,058 INFO L225 Difference]: With dead ends: 15190 [2018-10-26 19:58:39,059 INFO L226 Difference]: Without dead ends: 7599 [2018-10-26 19:58:39,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2018-10-26 19:58:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 7593. [2018-10-26 19:58:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7593 states. [2018-10-26 19:58:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 9699 transitions. [2018-10-26 19:58:39,208 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 9699 transitions. Word has length 208 [2018-10-26 19:58:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:39,209 INFO L481 AbstractCegarLoop]: Abstraction has 7593 states and 9699 transitions. [2018-10-26 19:58:39,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 9699 transitions. [2018-10-26 19:58:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-26 19:58:39,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:39,217 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:39,218 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:39,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:39,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1773650990, now seen corresponding path program 1 times [2018-10-26 19:58:39,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:39,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:39,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:39,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:39,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 19:58:39,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:39,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:39,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:39,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:39,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:39,406 INFO L87 Difference]: Start difference. First operand 7593 states and 9699 transitions. Second operand 3 states. [2018-10-26 19:58:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:41,212 INFO L93 Difference]: Finished difference Result 22543 states and 28853 transitions. [2018-10-26 19:58:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:41,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-10-26 19:58:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:41,256 INFO L225 Difference]: With dead ends: 22543 [2018-10-26 19:58:41,257 INFO L226 Difference]: Without dead ends: 14952 [2018-10-26 19:58:41,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14952 states. [2018-10-26 19:58:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14952 to 14943. [2018-10-26 19:58:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-10-26 19:58:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 18430 transitions. [2018-10-26 19:58:41,480 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 18430 transitions. Word has length 225 [2018-10-26 19:58:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:41,481 INFO L481 AbstractCegarLoop]: Abstraction has 14943 states and 18430 transitions. [2018-10-26 19:58:41,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 18430 transitions. [2018-10-26 19:58:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-26 19:58:41,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:41,493 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:41,493 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:41,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1682463316, now seen corresponding path program 1 times [2018-10-26 19:58:41,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:41,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:41,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:41,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:58:41,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:41,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:41,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:41,826 INFO L87 Difference]: Start difference. First operand 14943 states and 18430 transitions. Second operand 4 states. [2018-10-26 19:58:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:43,077 INFO L93 Difference]: Finished difference Result 29884 states and 36858 transitions. [2018-10-26 19:58:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:43,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-10-26 19:58:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:43,105 INFO L225 Difference]: With dead ends: 29884 [2018-10-26 19:58:43,105 INFO L226 Difference]: Without dead ends: 14943 [2018-10-26 19:58:43,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14943 states. [2018-10-26 19:58:43,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14943 to 14943. [2018-10-26 19:58:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-10-26 19:58:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 17684 transitions. [2018-10-26 19:58:43,302 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 17684 transitions. Word has length 228 [2018-10-26 19:58:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:43,303 INFO L481 AbstractCegarLoop]: Abstraction has 14943 states and 17684 transitions. [2018-10-26 19:58:43,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:58:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 17684 transitions. [2018-10-26 19:58:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-26 19:58:43,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:43,314 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:58:43,314 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:43,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:43,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1318810977, now seen corresponding path program 1 times [2018-10-26 19:58:43,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:43,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:43,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:43,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:43,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 19:58:43,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:43,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:58:43,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:58:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:58:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:58:43,510 INFO L87 Difference]: Start difference. First operand 14943 states and 17684 transitions. Second operand 3 states. [2018-10-26 19:58:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:44,912 INFO L93 Difference]: Finished difference Result 37363 states and 44044 transitions. [2018-10-26 19:58:44,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:58:44,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-10-26 19:58:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:44,951 INFO L225 Difference]: With dead ends: 37363 [2018-10-26 19:58:44,952 INFO L226 Difference]: Without dead ends: 22422 [2018-10-26 19:58:44,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 19:58:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22422 states. [2018-10-26 19:58:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22422 to 22417. [2018-10-26 19:58:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22417 states. [2018-10-26 19:58:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22417 states to 22417 states and 26323 transitions. [2018-10-26 19:58:45,366 INFO L78 Accepts]: Start accepts. Automaton has 22417 states and 26323 transitions. Word has length 237 [2018-10-26 19:58:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:45,367 INFO L481 AbstractCegarLoop]: Abstraction has 22417 states and 26323 transitions. [2018-10-26 19:58:45,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:58:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 22417 states and 26323 transitions. [2018-10-26 19:58:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-26 19:58:45,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:45,382 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-26 19:58:45,382 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:45,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:45,382 INFO L82 PathProgramCache]: Analyzing trace with hash -757390539, now seen corresponding path program 1 times [2018-10-26 19:58:45,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:45,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:45,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:45,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:45,737 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-26 19:58:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 19:58:45,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:58:45,918 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:58:45,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:46,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:58:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-26 19:58:46,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:58:46,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-26 19:58:46,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:58:46,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:58:46,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:58:46,273 INFO L87 Difference]: Start difference. First operand 22417 states and 26323 transitions. Second operand 6 states. [2018-10-26 19:58:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:54,881 INFO L93 Difference]: Finished difference Result 130790 states and 153530 transitions. [2018-10-26 19:58:54,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 19:58:54,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2018-10-26 19:58:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:55,115 INFO L225 Difference]: With dead ends: 130790 [2018-10-26 19:58:55,116 INFO L226 Difference]: Without dead ends: 108375 [2018-10-26 19:58:55,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:58:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108375 states. [2018-10-26 19:58:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108375 to 106497. [2018-10-26 19:58:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106497 states. [2018-10-26 19:58:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106497 states to 106497 states and 119844 transitions. [2018-10-26 19:58:56,966 INFO L78 Accepts]: Start accepts. Automaton has 106497 states and 119844 transitions. Word has length 245 [2018-10-26 19:58:56,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:56,967 INFO L481 AbstractCegarLoop]: Abstraction has 106497 states and 119844 transitions. [2018-10-26 19:58:56,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:58:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 106497 states and 119844 transitions. [2018-10-26 19:58:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-26 19:58:57,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:58:57,019 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-26 19:58:57,019 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:58:57,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:58:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash 778143398, now seen corresponding path program 1 times [2018-10-26 19:58:57,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:58:57,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:58:57,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:57,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:58:57,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:58:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:58:57,417 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-26 19:58:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-26 19:58:57,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:58:57,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:58:57,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:58:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:58:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:58:57,485 INFO L87 Difference]: Start difference. First operand 106497 states and 119844 transitions. Second operand 4 states. [2018-10-26 19:59:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:01,625 INFO L93 Difference]: Finished difference Result 352610 states and 394075 transitions. [2018-10-26 19:59:01,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:01,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2018-10-26 19:59:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:02,030 INFO L225 Difference]: With dead ends: 352610 [2018-10-26 19:59:02,031 INFO L226 Difference]: Without dead ends: 246115 [2018-10-26 19:59:02,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246115 states. [2018-10-26 19:59:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246115 to 184592. [2018-10-26 19:59:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184592 states. [2018-10-26 19:59:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184592 states to 184592 states and 204846 transitions. [2018-10-26 19:59:05,236 INFO L78 Accepts]: Start accepts. Automaton has 184592 states and 204846 transitions. Word has length 315 [2018-10-26 19:59:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:05,236 INFO L481 AbstractCegarLoop]: Abstraction has 184592 states and 204846 transitions. [2018-10-26 19:59:05,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 184592 states and 204846 transitions. [2018-10-26 19:59:05,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-26 19:59:05,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:05,296 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:59:05,296 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:05,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:05,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1158786570, now seen corresponding path program 1 times [2018-10-26 19:59:05,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:05,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:05,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:05,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:05,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 19:59:05,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:05,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:05,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:59:05,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:59:05,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:05,768 INFO L87 Difference]: Start difference. First operand 184592 states and 204846 transitions. Second operand 3 states. [2018-10-26 19:59:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:09,826 INFO L93 Difference]: Finished difference Result 430750 states and 479158 transitions. [2018-10-26 19:59:09,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:59:09,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-10-26 19:59:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:10,145 INFO L225 Difference]: With dead ends: 430750 [2018-10-26 19:59:10,145 INFO L226 Difference]: Without dead ends: 246160 [2018-10-26 19:59:10,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246160 states. [2018-10-26 19:59:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246160 to 234843. [2018-10-26 19:59:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234843 states. [2018-10-26 19:59:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234843 states to 234843 states and 262264 transitions. [2018-10-26 19:59:14,314 INFO L78 Accepts]: Start accepts. Automaton has 234843 states and 262264 transitions. Word has length 330 [2018-10-26 19:59:14,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:14,314 INFO L481 AbstractCegarLoop]: Abstraction has 234843 states and 262264 transitions. [2018-10-26 19:59:14,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:59:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 234843 states and 262264 transitions. [2018-10-26 19:59:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-26 19:59:14,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:14,358 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:59:14,358 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:14,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:14,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1828150633, now seen corresponding path program 1 times [2018-10-26 19:59:14,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:14,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:14,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:14,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:14,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-26 19:59:14,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:14,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:59:14,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:59:14,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:59:14,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:14,622 INFO L87 Difference]: Start difference. First operand 234843 states and 262264 transitions. Second operand 3 states. [2018-10-26 19:59:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:16,889 INFO L93 Difference]: Finished difference Result 469669 states and 524511 transitions. [2018-10-26 19:59:16,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:59:16,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2018-10-26 19:59:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:17,187 INFO L225 Difference]: With dead ends: 469669 [2018-10-26 19:59:17,187 INFO L226 Difference]: Without dead ends: 234828 [2018-10-26 19:59:17,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234828 states. [2018-10-26 19:59:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234828 to 234828. [2018-10-26 19:59:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234828 states. [2018-10-26 19:59:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234828 states to 234828 states and 262234 transitions. [2018-10-26 19:59:21,836 INFO L78 Accepts]: Start accepts. Automaton has 234828 states and 262234 transitions. Word has length 336 [2018-10-26 19:59:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:21,836 INFO L481 AbstractCegarLoop]: Abstraction has 234828 states and 262234 transitions. [2018-10-26 19:59:21,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:59:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 234828 states and 262234 transitions. [2018-10-26 19:59:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-26 19:59:21,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:21,884 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:59:21,884 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:21,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:21,885 INFO L82 PathProgramCache]: Analyzing trace with hash 312285425, now seen corresponding path program 1 times [2018-10-26 19:59:21,885 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:21,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:21,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:21,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:21,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-26 19:59:27,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:27,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:27,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:59:27,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:59:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:27,624 INFO L87 Difference]: Start difference. First operand 234828 states and 262234 transitions. Second operand 3 states. [2018-10-26 19:59:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:30,457 INFO L93 Difference]: Finished difference Result 457996 states and 511131 transitions. [2018-10-26 19:59:30,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:59:30,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2018-10-26 19:59:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:30,725 INFO L225 Difference]: With dead ends: 457996 [2018-10-26 19:59:30,725 INFO L226 Difference]: Without dead ends: 223170 [2018-10-26 19:59:30,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223170 states. [2018-10-26 19:59:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223170 to 213295. [2018-10-26 19:59:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213295 states. [2018-10-26 19:59:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213295 states to 213295 states and 231973 transitions. [2018-10-26 19:59:34,717 INFO L78 Accepts]: Start accepts. Automaton has 213295 states and 231973 transitions. Word has length 347 [2018-10-26 19:59:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:34,717 INFO L481 AbstractCegarLoop]: Abstraction has 213295 states and 231973 transitions. [2018-10-26 19:59:34,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:59:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 213295 states and 231973 transitions. [2018-10-26 19:59:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-26 19:59:34,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:34,745 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-26 19:59:34,746 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:34,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:34,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1408009665, now seen corresponding path program 1 times [2018-10-26 19:59:34,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:34,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:34,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:34,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:35,465 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-26 19:59:35,932 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-10-26 19:59:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-26 19:59:36,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:59:36,261 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:59:36,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:36,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:59:36,841 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-26 19:59:36,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:59:36,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-26 19:59:36,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:59:36,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:59:36,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:59:36,878 INFO L87 Difference]: Start difference. First operand 213295 states and 231973 transitions. Second operand 6 states. [2018-10-26 19:59:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:45,113 INFO L93 Difference]: Finished difference Result 902872 states and 981569 transitions. [2018-10-26 19:59:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:59:45,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 362 [2018-10-26 19:59:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:46,015 INFO L225 Difference]: With dead ends: 902872 [2018-10-26 19:59:46,015 INFO L226 Difference]: Without dead ends: 689579 [2018-10-26 19:59:46,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 361 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:59:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689579 states. [2018-10-26 19:59:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689579 to 432775. [2018-10-26 19:59:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432775 states. [2018-10-26 19:59:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432775 states to 432775 states and 470790 transitions. [2018-10-26 19:59:55,118 INFO L78 Accepts]: Start accepts. Automaton has 432775 states and 470790 transitions. Word has length 362 [2018-10-26 19:59:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:55,118 INFO L481 AbstractCegarLoop]: Abstraction has 432775 states and 470790 transitions. [2018-10-26 19:59:55,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:59:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand 432775 states and 470790 transitions. [2018-10-26 19:59:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-26 19:59:55,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:55,164 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:59:55,164 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:55,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash -185387452, now seen corresponding path program 1 times [2018-10-26 19:59:55,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:59:55,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:59:55,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:55,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:55,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-26 19:59:55,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:55,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:55,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:55,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:55,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:55,454 INFO L87 Difference]: Start difference. First operand 432775 states and 470790 transitions. Second operand 4 states. [2018-10-26 20:00:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:01,536 INFO L93 Difference]: Finished difference Result 874644 states and 951201 transitions. [2018-10-26 20:00:01,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:01,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 374 [2018-10-26 20:00:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:02,065 INFO L225 Difference]: With dead ends: 874644 [2018-10-26 20:00:02,066 INFO L226 Difference]: Without dead ends: 441871 [2018-10-26 20:00:02,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441871 states. [2018-10-26 20:00:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441871 to 441362. [2018-10-26 20:00:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441362 states. [2018-10-26 20:00:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441362 states to 441362 states and 478308 transitions. [2018-10-26 20:00:15,630 INFO L78 Accepts]: Start accepts. Automaton has 441362 states and 478308 transitions. Word has length 374 [2018-10-26 20:00:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:15,631 INFO L481 AbstractCegarLoop]: Abstraction has 441362 states and 478308 transitions. [2018-10-26 20:00:15,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 441362 states and 478308 transitions. [2018-10-26 20:00:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-26 20:00:15,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:15,674 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:00:15,675 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:15,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:15,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1184387920, now seen corresponding path program 1 times [2018-10-26 20:00:15,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:15,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:15,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:15,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:15,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-26 20:00:16,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:16,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:16,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:16,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:16,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:16,079 INFO L87 Difference]: Start difference. First operand 441362 states and 478308 transitions. Second operand 3 states. [2018-10-26 20:00:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:21,459 INFO L93 Difference]: Finished difference Result 912615 states and 988718 transitions. [2018-10-26 20:00:21,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:21,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 407 [2018-10-26 20:00:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:22,091 INFO L225 Difference]: With dead ends: 912615 [2018-10-26 20:00:22,092 INFO L226 Difference]: Without dead ends: 471255 [2018-10-26 20:00:22,324 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-26 20:00:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471255 states. [2018-10-26 20:00:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471255 to 457308. [2018-10-26 20:00:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457308 states. [2018-10-26 20:00:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457308 states to 457308 states and 495106 transitions. [2018-10-26 20:00:30,826 INFO L78 Accepts]: Start accepts. Automaton has 457308 states and 495106 transitions. Word has length 407 [2018-10-26 20:00:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:30,826 INFO L481 AbstractCegarLoop]: Abstraction has 457308 states and 495106 transitions. [2018-10-26 20:00:30,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 457308 states and 495106 transitions. [2018-10-26 20:00:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-26 20:00:30,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:30,871 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:00:30,871 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:30,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1886071870, now seen corresponding path program 1 times [2018-10-26 20:00:30,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:00:30,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:00:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:30,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 391 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 20:00:32,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:00:32,637 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-26 20:00:32,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:32,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:00:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 35 proven. 225 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-26 20:00:33,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:00:33,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-26 20:00:33,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:00:33,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:00:33,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:00:33,067 INFO L87 Difference]: Start difference. First operand 457308 states and 495106 transitions. Second operand 8 states. [2018-10-26 20:00:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:53,653 INFO L93 Difference]: Finished difference Result 1402132 states and 1509921 transitions. [2018-10-26 20:00:53,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-26 20:00:53,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 410 [2018-10-26 20:00:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:55,134 INFO L225 Difference]: With dead ends: 1402132 [2018-10-26 20:00:55,134 INFO L226 Difference]: Without dead ends: 944826 [2018-10-26 20:00:55,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-10-26 20:00:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944826 states. [2018-10-26 20:01:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944826 to 806296. [2018-10-26 20:01:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806296 states. [2018-10-26 20:01:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806296 states to 806296 states and 867766 transitions. [2018-10-26 20:01:09,647 INFO L78 Accepts]: Start accepts. Automaton has 806296 states and 867766 transitions. Word has length 410 [2018-10-26 20:01:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:09,647 INFO L481 AbstractCegarLoop]: Abstraction has 806296 states and 867766 transitions. [2018-10-26 20:01:09,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:01:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 806296 states and 867766 transitions. [2018-10-26 20:01:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-26 20:01:09,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:09,712 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:01:09,712 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:09,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:09,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1765344062, now seen corresponding path program 1 times [2018-10-26 20:01:09,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:01:09,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:01:09,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:09,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:09,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-10-26 20:01:12,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:12,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:01:12,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:12,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:12,056 INFO L87 Difference]: Start difference. First operand 806296 states and 867766 transitions. Second operand 4 states. [2018-10-26 20:01:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:29,317 INFO L93 Difference]: Finished difference Result 2048527 states and 2204815 transitions. [2018-10-26 20:01:29,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:29,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 424 [2018-10-26 20:01:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:31,101 INFO L225 Difference]: With dead ends: 2048527 [2018-10-26 20:01:31,102 INFO L226 Difference]: Without dead ends: 1242233 [2018-10-26 20:01:31,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242233 states. Received shutdown request... [2018-10-26 20:01:34,818 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-26 20:01:34,822 WARN L205 ceAbstractionStarter]: Timeout [2018-10-26 20:01:34,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:01:34 BoogieIcfgContainer [2018-10-26 20:01:34,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:01:34,823 INFO L168 Benchmark]: Toolchain (without parser) took 201958.31 ms. Allocated memory was 1.5 GB in the beginning and 6.2 GB in the end (delta: 4.7 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2018-10-26 20:01:34,824 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 20:01:34,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1182.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:34,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 306.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -901.3 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:34,826 INFO L168 Benchmark]: Boogie Preprocessor took 133.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:34,827 INFO L168 Benchmark]: RCFGBuilder took 5666.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-26 20:01:34,828 INFO L168 Benchmark]: TraceAbstraction took 194660.00 ms. Allocated memory was 2.3 GB in the beginning and 6.2 GB in the end (delta: 3.9 GB). Free memory was 2.0 GB in the beginning and 3.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-10-26 20:01:34,833 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1182.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 306.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -901.3 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5666.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 194660.00 ms. Allocated memory was 2.3 GB in the beginning and 6.2 GB in the end (delta: 3.9 GB). Free memory was 2.0 GB in the beginning and 3.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1551]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1551). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 194.5s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 108.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4835 SDtfs, 17120 SDslu, 2883 SDs, 0 SdLazy, 22520 SolverSat, 4280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1112 GetRequests, 1052 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=806296occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 67.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 494425 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 6414 NumberOfCodeBlocks, 6414 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6392 ConstructedInterpolants, 0 QuantifiedInterpolants, 6435003 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1768 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 3848/4103 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown