java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label08_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:52:40,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:52:40,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:52:40,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:52:40,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:52:40,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:52:40,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:52:40,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:52:40,397 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:52:40,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:52:40,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:52:40,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:52:40,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:52:40,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:52:40,402 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:52:40,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:52:40,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:52:40,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:52:40,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:52:40,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:52:40,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:52:40,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:52:40,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:52:40,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:52:40,419 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:52:40,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:52:40,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:52:40,422 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:52:40,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:52:40,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:52:40,430 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:52:40,431 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:52:40,431 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:52:40,432 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:52:40,433 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:52:40,434 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:52:40,434 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:52:40,463 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:52:40,463 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:52:40,464 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:52:40,464 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:52:40,465 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:52:40,465 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:52:40,465 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:52:40,465 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:52:40,466 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:52:40,466 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:52:40,466 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:52:40,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:52:40,466 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:52:40,467 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:52:40,467 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:52:40,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:52:40,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:52:40,467 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:52:40,468 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:52:40,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:40,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:52:40,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:52:40,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:52:40,469 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:52:40,469 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:52:40,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:52:40,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:52:40,469 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:52:40,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:52:40,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:52:40,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:52:40,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:52:40,560 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:52:40,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label08_true-unreach-call.c [2018-11-06 19:52:40,632 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0456002a0/368b253e3f3a421280271e36b4d01f0e/FLAG0741d8337 [2018-11-06 19:52:41,266 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:52:41,269 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label08_true-unreach-call.c [2018-11-06 19:52:41,291 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0456002a0/368b253e3f3a421280271e36b4d01f0e/FLAG0741d8337 [2018-11-06 19:52:41,313 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0456002a0/368b253e3f3a421280271e36b4d01f0e [2018-11-06 19:52:41,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:52:41,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:52:41,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:41,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:52:41,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:52:41,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:41" (1/1) ... [2018-11-06 19:52:41,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ede70b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:41, skipping insertion in model container [2018-11-06 19:52:41,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:52:41" (1/1) ... [2018-11-06 19:52:41,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:52:41,442 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:52:42,180 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:42,185 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:52:42,529 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:52:42,555 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:52:42,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42 WrapperNode [2018-11-06 19:52:42,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:52:42,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:42,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:52:42,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:52:42,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:52:42,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:52:42,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:52:42,865 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:52:42,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:42,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... [2018-11-06 19:52:43,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:52:43,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:52:43,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:52:43,014 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:52:43,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:52:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:52:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:52:43,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:52:49,005 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:52:49,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:49 BoogieIcfgContainer [2018-11-06 19:52:49,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:52:49,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:52:49,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:52:49,011 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:52:49,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:52:41" (1/3) ... [2018-11-06 19:52:49,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a8223e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:49, skipping insertion in model container [2018-11-06 19:52:49,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:52:42" (2/3) ... [2018-11-06 19:52:49,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a8223e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:52:49, skipping insertion in model container [2018-11-06 19:52:49,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:52:49" (3/3) ... [2018-11-06 19:52:49,015 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label08_true-unreach-call.c [2018-11-06 19:52:49,026 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:52:49,034 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:52:49,049 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:52:49,088 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:52:49,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:52:49,089 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:52:49,089 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:52:49,089 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:52:49,089 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:52:49,090 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:52:49,090 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:52:49,090 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:52:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:52:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-06 19:52:49,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:49,136 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] [2018-11-06 19:52:49,139 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:49,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1617915860, now seen corresponding path program 1 times [2018-11-06 19:52:49,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:49,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:49,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:49,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:49,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:50,018 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:52:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:50,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:50,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:50,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:52:50,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:52:50,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:50,123 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:52:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:53,542 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-11-06 19:52:53,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:52:53,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-11-06 19:52:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:53,572 INFO L225 Difference]: With dead ends: 1027 [2018-11-06 19:52:53,572 INFO L226 Difference]: Without dead ends: 717 [2018-11-06 19:52:53,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:52:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-11-06 19:52:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-11-06 19:52:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-11-06 19:52:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-11-06 19:52:53,702 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 158 [2018-11-06 19:52:53,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:53,706 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-11-06 19:52:53,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:52:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-11-06 19:52:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-06 19:52:53,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:53,722 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] [2018-11-06 19:52:53,724 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:53,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1348626709, now seen corresponding path program 1 times [2018-11-06 19:52:53,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:53,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:53,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:53,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:53,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:52:53,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:53,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:53,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:53,963 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-11-06 19:52:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:56,198 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-11-06 19:52:56,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:56,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-11-06 19:52:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:56,207 INFO L225 Difference]: With dead ends: 2058 [2018-11-06 19:52:56,208 INFO L226 Difference]: Without dead ends: 1345 [2018-11-06 19:52:56,212 INFO L604 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-11-06 19:52:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-11-06 19:52:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-11-06 19:52:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-11-06 19:52:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-11-06 19:52:56,258 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 167 [2018-11-06 19:52:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:56,259 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-11-06 19:52:56,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:56,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-11-06 19:52:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-06 19:52:56,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:56,263 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] [2018-11-06 19:52:56,263 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:56,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:56,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1364601921, now seen corresponding path program 1 times [2018-11-06 19:52:56,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:56,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:56,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:56,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:56,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:52:56,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:56,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:52:56,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:56,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:56,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:56,569 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-11-06 19:52:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:52:59,683 INFO L93 Difference]: Finished difference Result 3901 states and 6135 transitions. [2018-11-06 19:52:59,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:52:59,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-11-06 19:52:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:52:59,699 INFO L225 Difference]: With dead ends: 3901 [2018-11-06 19:52:59,700 INFO L226 Difference]: Without dead ends: 2572 [2018-11-06 19:52:59,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2018-11-06 19:52:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2558. [2018-11-06 19:52:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2018-11-06 19:52:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3854 transitions. [2018-11-06 19:52:59,756 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3854 transitions. Word has length 175 [2018-11-06 19:52:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:52:59,757 INFO L480 AbstractCegarLoop]: Abstraction has 2558 states and 3854 transitions. [2018-11-06 19:52:59,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:52:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3854 transitions. [2018-11-06 19:52:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-06 19:52:59,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:52:59,764 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-06 19:52:59,764 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:52:59,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:52:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash 408853660, now seen corresponding path program 1 times [2018-11-06 19:52:59,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:52:59,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:52:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:59,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:52:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:52:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:52:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:52:59,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:52:59,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:52:59,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:52:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:52:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:52:59,917 INFO L87 Difference]: Start difference. First operand 2558 states and 3854 transitions. Second operand 3 states. [2018-11-06 19:53:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:00,940 INFO L93 Difference]: Finished difference Result 5091 states and 7675 transitions. [2018-11-06 19:53:00,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:00,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-11-06 19:53:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:00,953 INFO L225 Difference]: With dead ends: 5091 [2018-11-06 19:53:00,954 INFO L226 Difference]: Without dead ends: 2535 [2018-11-06 19:53:00,957 INFO L604 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-11-06 19:53:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2018-11-06 19:53:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2535. [2018-11-06 19:53:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2535 states. [2018-11-06 19:53:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3747 transitions. [2018-11-06 19:53:01,011 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3747 transitions. Word has length 189 [2018-11-06 19:53:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:01,012 INFO L480 AbstractCegarLoop]: Abstraction has 2535 states and 3747 transitions. [2018-11-06 19:53:01,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3747 transitions. [2018-11-06 19:53:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-06 19:53:01,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:01,018 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] [2018-11-06 19:53:01,019 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:01,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:01,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1261203664, now seen corresponding path program 1 times [2018-11-06 19:53:01,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:01,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:01,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:01,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:01,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:01,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:01,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:01,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:01,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:01,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:01,208 INFO L87 Difference]: Start difference. First operand 2535 states and 3747 transitions. Second operand 3 states. [2018-11-06 19:53:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:02,654 INFO L93 Difference]: Finished difference Result 7314 states and 10763 transitions. [2018-11-06 19:53:02,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:02,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-11-06 19:53:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:02,675 INFO L225 Difference]: With dead ends: 7314 [2018-11-06 19:53:02,675 INFO L226 Difference]: Without dead ends: 4781 [2018-11-06 19:53:02,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2018-11-06 19:53:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4778. [2018-11-06 19:53:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4778 states. [2018-11-06 19:53:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 6617 transitions. [2018-11-06 19:53:02,770 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 6617 transitions. Word has length 210 [2018-11-06 19:53:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:02,771 INFO L480 AbstractCegarLoop]: Abstraction has 4778 states and 6617 transitions. [2018-11-06 19:53:02,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 6617 transitions. [2018-11-06 19:53:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-06 19:53:02,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:02,781 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] [2018-11-06 19:53:02,781 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:02,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:02,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1940533706, now seen corresponding path program 1 times [2018-11-06 19:53:02,782 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:02,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:02,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:03,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:03,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:03,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:03,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:03,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:03,121 INFO L87 Difference]: Start difference. First operand 4778 states and 6617 transitions. Second operand 4 states. [2018-11-06 19:53:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:06,139 INFO L93 Difference]: Finished difference Result 17751 states and 24441 transitions. [2018-11-06 19:53:06,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:06,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-11-06 19:53:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:06,186 INFO L225 Difference]: With dead ends: 17751 [2018-11-06 19:53:06,186 INFO L226 Difference]: Without dead ends: 12975 [2018-11-06 19:53:06,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12975 states. [2018-11-06 19:53:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12975 to 9063. [2018-11-06 19:53:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-11-06 19:53:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 11954 transitions. [2018-11-06 19:53:06,408 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 11954 transitions. Word has length 213 [2018-11-06 19:53:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:06,409 INFO L480 AbstractCegarLoop]: Abstraction has 9063 states and 11954 transitions. [2018-11-06 19:53:06,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:53:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 11954 transitions. [2018-11-06 19:53:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-06 19:53:06,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:06,427 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] [2018-11-06 19:53:06,427 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:06,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:06,428 INFO L82 PathProgramCache]: Analyzing trace with hash -12059043, now seen corresponding path program 1 times [2018-11-06 19:53:06,428 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:06,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:06,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-06 19:53:06,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:06,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:06,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:06,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:06,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:06,649 INFO L87 Difference]: Start difference. First operand 9063 states and 11954 transitions. Second operand 3 states. [2018-11-06 19:53:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:08,335 INFO L93 Difference]: Finished difference Result 23069 states and 30331 transitions. [2018-11-06 19:53:08,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:08,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-11-06 19:53:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:08,373 INFO L225 Difference]: With dead ends: 23069 [2018-11-06 19:53:08,374 INFO L226 Difference]: Without dead ends: 14008 [2018-11-06 19:53:08,385 INFO L604 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-11-06 19:53:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14008 states. [2018-11-06 19:53:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14008 to 14005. [2018-11-06 19:53:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14005 states. [2018-11-06 19:53:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14005 states to 14005 states and 18328 transitions. [2018-11-06 19:53:08,614 INFO L78 Accepts]: Start accepts. Automaton has 14005 states and 18328 transitions. Word has length 222 [2018-11-06 19:53:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:08,615 INFO L480 AbstractCegarLoop]: Abstraction has 14005 states and 18328 transitions. [2018-11-06 19:53:08,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 14005 states and 18328 transitions. [2018-11-06 19:53:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-06 19:53:08,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:08,643 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] [2018-11-06 19:53:08,643 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:08,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1088101623, now seen corresponding path program 1 times [2018-11-06 19:53:08,644 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:08,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:08,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:08,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:08,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:09,002 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:53:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-06 19:53:09,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:53:09,263 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:53:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:09,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:53:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-06 19:53:09,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:53:09,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-11-06 19:53:09,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:53:09,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:53:09,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:53:09,684 INFO L87 Difference]: Start difference. First operand 14005 states and 18328 transitions. Second operand 6 states. [2018-11-06 19:53:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:17,331 INFO L93 Difference]: Finished difference Result 85662 states and 112685 transitions. [2018-11-06 19:53:17,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:53:17,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2018-11-06 19:53:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:17,483 INFO L225 Difference]: With dead ends: 85662 [2018-11-06 19:53:17,484 INFO L226 Difference]: Without dead ends: 71659 [2018-11-06 19:53:17,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 229 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-11-06 19:53:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71659 states. [2018-11-06 19:53:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71659 to 70421. [2018-11-06 19:53:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70421 states. [2018-11-06 19:53:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70421 states to 70421 states and 86088 transitions. [2018-11-06 19:53:19,074 INFO L78 Accepts]: Start accepts. Automaton has 70421 states and 86088 transitions. Word has length 230 [2018-11-06 19:53:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:19,075 INFO L480 AbstractCegarLoop]: Abstraction has 70421 states and 86088 transitions. [2018-11-06 19:53:19,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:53:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 70421 states and 86088 transitions. [2018-11-06 19:53:19,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-06 19:53:19,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:19,140 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:19,140 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:19,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:19,141 INFO L82 PathProgramCache]: Analyzing trace with hash -307747242, now seen corresponding path program 1 times [2018-11-06 19:53:19,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:19,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:19,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:19,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:19,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:53:19,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:19,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:19,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:19,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:19,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:19,350 INFO L87 Difference]: Start difference. First operand 70421 states and 86088 transitions. Second operand 3 states. [2018-11-06 19:53:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:21,770 INFO L93 Difference]: Finished difference Result 136010 states and 165688 transitions. [2018-11-06 19:53:21,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:21,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-11-06 19:53:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:21,882 INFO L225 Difference]: With dead ends: 136010 [2018-11-06 19:53:21,882 INFO L226 Difference]: Without dead ends: 65591 [2018-11-06 19:53:21,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65591 states. [2018-11-06 19:53:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65591 to 65584. [2018-11-06 19:53:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65584 states. [2018-11-06 19:53:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65584 states to 65584 states and 76213 transitions. [2018-11-06 19:53:23,366 INFO L78 Accepts]: Start accepts. Automaton has 65584 states and 76213 transitions. Word has length 237 [2018-11-06 19:53:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:23,366 INFO L480 AbstractCegarLoop]: Abstraction has 65584 states and 76213 transitions. [2018-11-06 19:53:23,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 65584 states and 76213 transitions. [2018-11-06 19:53:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-06 19:53:23,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:23,409 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:23,410 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:23,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1654308121, now seen corresponding path program 1 times [2018-11-06 19:53:23,410 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:23,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:23,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:23,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:23,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:53:23,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:23,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:23,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:23,748 INFO L87 Difference]: Start difference. First operand 65584 states and 76213 transitions. Second operand 3 states. [2018-11-06 19:53:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:25,761 INFO L93 Difference]: Finished difference Result 171765 states and 199387 transitions. [2018-11-06 19:53:25,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:25,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-11-06 19:53:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:25,884 INFO L225 Difference]: With dead ends: 171765 [2018-11-06 19:53:25,884 INFO L226 Difference]: Without dead ends: 106183 [2018-11-06 19:53:25,943 INFO L604 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-11-06 19:53:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106183 states. [2018-11-06 19:53:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106183 to 106178. [2018-11-06 19:53:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106178 states. [2018-11-06 19:53:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106178 states to 106178 states and 123027 transitions. [2018-11-06 19:53:27,766 INFO L78 Accepts]: Start accepts. Automaton has 106178 states and 123027 transitions. Word has length 274 [2018-11-06 19:53:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:27,767 INFO L480 AbstractCegarLoop]: Abstraction has 106178 states and 123027 transitions. [2018-11-06 19:53:27,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 106178 states and 123027 transitions. [2018-11-06 19:53:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-06 19:53:27,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:27,830 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:27,831 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:27,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:27,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1442636741, now seen corresponding path program 1 times [2018-11-06 19:53:27,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:27,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:27,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:28,326 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-11-06 19:53:28,512 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-11-06 19:53:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:53:29,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:29,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-06 19:53:29,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 19:53:29,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 19:53:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:53:29,072 INFO L87 Difference]: Start difference. First operand 106178 states and 123027 transitions. Second operand 11 states. [2018-11-06 19:53:36,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:36,743 INFO L93 Difference]: Finished difference Result 319247 states and 366301 transitions. [2018-11-06 19:53:36,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 19:53:36,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 282 [2018-11-06 19:53:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:37,056 INFO L225 Difference]: With dead ends: 319247 [2018-11-06 19:53:37,056 INFO L226 Difference]: Without dead ends: 213071 [2018-11-06 19:53:37,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-11-06 19:53:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213071 states. [2018-11-06 19:53:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213071 to 210692. [2018-11-06 19:53:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210692 states. [2018-11-06 19:53:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210692 states to 210692 states and 240627 transitions. [2018-11-06 19:53:40,867 INFO L78 Accepts]: Start accepts. Automaton has 210692 states and 240627 transitions. Word has length 282 [2018-11-06 19:53:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:40,867 INFO L480 AbstractCegarLoop]: Abstraction has 210692 states and 240627 transitions. [2018-11-06 19:53:40,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 19:53:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 210692 states and 240627 transitions. [2018-11-06 19:53:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-06 19:53:40,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:40,961 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:53:40,961 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:40,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash -985106448, now seen corresponding path program 1 times [2018-11-06 19:53:40,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:40,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-06 19:53:41,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:41,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:41,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:53:41,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:53:41,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:53:41,133 INFO L87 Difference]: Start difference. First operand 210692 states and 240627 transitions. Second operand 3 states. [2018-11-06 19:53:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:44,989 INFO L93 Difference]: Finished difference Result 418111 states and 477909 transitions. [2018-11-06 19:53:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:53:44,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-11-06 19:53:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:45,354 INFO L225 Difference]: With dead ends: 418111 [2018-11-06 19:53:45,354 INFO L226 Difference]: Without dead ends: 207421 [2018-11-06 19:53:45,520 INFO L604 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-11-06 19:53:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207421 states. [2018-11-06 19:53:49,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207421 to 207389. [2018-11-06 19:53:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207389 states. [2018-11-06 19:53:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207389 states to 207389 states and 229056 transitions. [2018-11-06 19:53:49,420 INFO L78 Accepts]: Start accepts. Automaton has 207389 states and 229056 transitions. Word has length 313 [2018-11-06 19:53:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:53:49,420 INFO L480 AbstractCegarLoop]: Abstraction has 207389 states and 229056 transitions. [2018-11-06 19:53:49,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:53:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 207389 states and 229056 transitions. [2018-11-06 19:53:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-06 19:53:49,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:53:49,478 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-06 19:53:49,478 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:53:49,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:53:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash 298861796, now seen corresponding path program 1 times [2018-11-06 19:53:49,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:53:49,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:53:49,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:49,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:53:49,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:53:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:53:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-06 19:53:49,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:53:49,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:53:49,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:53:49,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:53:49,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:49,805 INFO L87 Difference]: Start difference. First operand 207389 states and 229056 transitions. Second operand 4 states. [2018-11-06 19:53:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:53:54,591 INFO L93 Difference]: Finished difference Result 608923 states and 670921 transitions. [2018-11-06 19:53:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:53:54,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2018-11-06 19:53:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:53:55,080 INFO L225 Difference]: With dead ends: 608923 [2018-11-06 19:53:55,081 INFO L226 Difference]: Without dead ends: 401536 [2018-11-06 19:53:55,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:53:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401536 states. [2018-11-06 19:54:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401536 to 396796. [2018-11-06 19:54:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396796 states. [2018-11-06 19:54:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396796 states to 396796 states and 436615 transitions. [2018-11-06 19:54:06,635 INFO L78 Accepts]: Start accepts. Automaton has 396796 states and 436615 transitions. Word has length 317 [2018-11-06 19:54:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:06,635 INFO L480 AbstractCegarLoop]: Abstraction has 396796 states and 436615 transitions. [2018-11-06 19:54:06,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 396796 states and 436615 transitions. [2018-11-06 19:54:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-11-06 19:54:06,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:06,743 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:54:06,743 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:06,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1895868189, now seen corresponding path program 1 times [2018-11-06 19:54:06,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:06,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:06,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:06,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-11-06 19:54:07,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:07,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:07,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:07,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:07,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:07,163 INFO L87 Difference]: Start difference. First operand 396796 states and 436615 transitions. Second operand 4 states. [2018-11-06 19:54:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:12,753 INFO L93 Difference]: Finished difference Result 785515 states and 864790 transitions. [2018-11-06 19:54:12,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:12,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2018-11-06 19:54:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:13,268 INFO L225 Difference]: With dead ends: 785515 [2018-11-06 19:54:13,268 INFO L226 Difference]: Without dead ends: 388721 [2018-11-06 19:54:13,457 INFO L604 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-11-06 19:54:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388721 states. [2018-11-06 19:54:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388721 to 387781. [2018-11-06 19:54:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387781 states. [2018-11-06 19:54:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387781 states to 387781 states and 424956 transitions. [2018-11-06 19:54:19,399 INFO L78 Accepts]: Start accepts. Automaton has 387781 states and 424956 transitions. Word has length 372 [2018-11-06 19:54:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:19,400 INFO L480 AbstractCegarLoop]: Abstraction has 387781 states and 424956 transitions. [2018-11-06 19:54:19,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 387781 states and 424956 transitions. [2018-11-06 19:54:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-11-06 19:54:19,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:19,501 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:54:19,501 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:19,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:19,502 INFO L82 PathProgramCache]: Analyzing trace with hash 663501376, now seen corresponding path program 1 times [2018-11-06 19:54:19,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:19,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:19,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:19,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:19,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-06 19:54:21,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:21,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:21,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:21,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:21,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:21,123 INFO L87 Difference]: Start difference. First operand 387781 states and 424956 transitions. Second operand 4 states. [2018-11-06 19:54:31,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:31,627 INFO L93 Difference]: Finished difference Result 775630 states and 850037 transitions. [2018-11-06 19:54:31,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:54:31,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2018-11-06 19:54:31,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:32,129 INFO L225 Difference]: With dead ends: 775630 [2018-11-06 19:54:32,129 INFO L226 Difference]: Without dead ends: 387851 [2018-11-06 19:54:32,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387851 states. [2018-11-06 19:54:36,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387851 to 387781. [2018-11-06 19:54:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387781 states. [2018-11-06 19:54:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387781 states to 387781 states and 420600 transitions. [2018-11-06 19:54:37,043 INFO L78 Accepts]: Start accepts. Automaton has 387781 states and 420600 transitions. Word has length 386 [2018-11-06 19:54:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:37,044 INFO L480 AbstractCegarLoop]: Abstraction has 387781 states and 420600 transitions. [2018-11-06 19:54:37,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 387781 states and 420600 transitions. [2018-11-06 19:54:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-11-06 19:54:37,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:37,127 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:54:37,127 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:37,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:37,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1826316818, now seen corresponding path program 1 times [2018-11-06 19:54:37,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:37,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:37,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:37,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:37,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-06 19:54:37,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:37,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:37,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:37,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:37,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:37,406 INFO L87 Difference]: Start difference. First operand 387781 states and 420600 transitions. Second operand 3 states. [2018-11-06 19:54:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:42,318 INFO L93 Difference]: Finished difference Result 723348 states and 786210 transitions. [2018-11-06 19:54:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:42,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2018-11-06 19:54:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:42,770 INFO L225 Difference]: With dead ends: 723348 [2018-11-06 19:54:42,770 INFO L226 Difference]: Without dead ends: 335569 [2018-11-06 19:54:42,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:43,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335569 states. [2018-11-06 19:54:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335569 to 332268. [2018-11-06 19:54:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332268 states. [2018-11-06 19:54:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332268 states to 332268 states and 360060 transitions. [2018-11-06 19:54:49,059 INFO L78 Accepts]: Start accepts. Automaton has 332268 states and 360060 transitions. Word has length 393 [2018-11-06 19:54:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:49,060 INFO L480 AbstractCegarLoop]: Abstraction has 332268 states and 360060 transitions. [2018-11-06 19:54:49,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:54:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 332268 states and 360060 transitions. [2018-11-06 19:54:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-06 19:54:49,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:49,151 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:54:49,152 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:49,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1588649335, now seen corresponding path program 1 times [2018-11-06 19:54:49,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:49,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:49,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-06 19:54:49,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:49,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:54:49,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:49,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:49,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:49,494 INFO L87 Difference]: Start difference. First operand 332268 states and 360060 transitions. Second operand 3 states. [2018-11-06 19:54:55,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:55,550 INFO L93 Difference]: Finished difference Result 853198 states and 922511 transitions. [2018-11-06 19:54:55,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:55,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 396 [2018-11-06 19:54:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:56,496 INFO L225 Difference]: With dead ends: 853198 [2018-11-06 19:54:56,497 INFO L226 Difference]: Without dead ends: 520932 [2018-11-06 19:54:56,699 INFO L604 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-11-06 19:54:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520932 states. [2018-11-06 19:55:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520932 to 520926. [2018-11-06 19:55:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520926 states. [2018-11-06 19:55:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520926 states to 520926 states and 562366 transitions. [2018-11-06 19:55:12,181 INFO L78 Accepts]: Start accepts. Automaton has 520926 states and 562366 transitions. Word has length 396 [2018-11-06 19:55:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:12,181 INFO L480 AbstractCegarLoop]: Abstraction has 520926 states and 562366 transitions. [2018-11-06 19:55:12,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:55:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 520926 states and 562366 transitions. [2018-11-06 19:55:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-11-06 19:55:12,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:12,292 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 19:55:12,292 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:12,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1331815661, now seen corresponding path program 1 times [2018-11-06 19:55:12,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:12,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:12,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:12,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:12,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-06 19:55:12,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:12,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:12,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:55:12,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:55:12,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:55:12,652 INFO L87 Difference]: Start difference. First operand 520926 states and 562366 transitions. Second operand 3 states. [2018-11-06 19:55:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:19,550 INFO L93 Difference]: Finished difference Result 1325610 states and 1430525 transitions. [2018-11-06 19:55:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:55:19,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 405 [2018-11-06 19:55:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:20,482 INFO L225 Difference]: With dead ends: 1325610 [2018-11-06 19:55:20,483 INFO L226 Difference]: Without dead ends: 804686 [2018-11-06 19:55:20,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:55:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804686 states. [2018-11-06 19:55:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804686 to 804276. [2018-11-06 19:55:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804276 states. [2018-11-06 19:55:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804276 states to 804276 states and 864196 transitions. [2018-11-06 19:55:34,480 INFO L78 Accepts]: Start accepts. Automaton has 804276 states and 864196 transitions. Word has length 405 [2018-11-06 19:55:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:34,480 INFO L480 AbstractCegarLoop]: Abstraction has 804276 states and 864196 transitions. [2018-11-06 19:55:34,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:55:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 804276 states and 864196 transitions. [2018-11-06 19:55:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-11-06 19:55:34,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:34,620 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:55:34,620 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:34,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1212429337, now seen corresponding path program 1 times [2018-11-06 19:55:34,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:34,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:34,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:34,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-11-06 19:55:34,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:34,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:34,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:55:34,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:55:34,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:34,975 INFO L87 Difference]: Start difference. First operand 804276 states and 864196 transitions. Second operand 4 states. [2018-11-06 19:55:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:51,904 INFO L93 Difference]: Finished difference Result 1649230 states and 1771756 transitions. [2018-11-06 19:55:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:55:51,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 411 [2018-11-06 19:55:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:53,240 INFO L225 Difference]: With dead ends: 1649230 [2018-11-06 19:55:53,241 INFO L226 Difference]: Without dead ends: 844956 [2018-11-06 19:55:53,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844956 states. Received shutdown request... [2018-11-06 19:55:56,423 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:55:56,426 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:55:56,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:55:56 BoogieIcfgContainer [2018-11-06 19:55:56,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:55:56,428 INFO L168 Benchmark]: Toolchain (without parser) took 195099.76 ms. Allocated memory was 1.5 GB in the beginning and 6.0 GB in the end (delta: 4.4 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2018-11-06 19:55:56,429 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:55:56,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1225.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-06 19:55:56,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 307.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -839.8 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2018-11-06 19:55:56,431 INFO L168 Benchmark]: Boogie Preprocessor took 148.61 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:55:56,432 INFO L168 Benchmark]: RCFGBuilder took 5993.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 251.9 MB). Peak memory consumption was 251.9 MB. Max. memory is 7.1 GB. [2018-11-06 19:55:56,432 INFO L168 Benchmark]: TraceAbstraction took 187419.29 ms. Allocated memory was 2.3 GB in the beginning and 6.0 GB in the end (delta: 3.7 GB). Free memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-11-06 19:55:56,437 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.24 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 1225.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 307.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -839.8 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.61 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5993.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 251.9 MB). Peak memory consumption was 251.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 187419.29 ms. Allocated memory was 2.3 GB in the beginning and 6.0 GB in the end (delta: 3.7 GB). Free memory was 1.9 GB in the beginning and 3.4 GB in the end (delta: -1.5 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: 1506]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1506). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 187.3s OverallTime, 19 OverallIterations, 7 TraceHistogramMax, 103.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5315 SDtfs, 9710 SDslu, 2957 SDs, 0 SdLazy, 18180 SolverSat, 3594 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804276occurred 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: 73.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 17076 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 5580 NumberOfCodeBlocks, 5580 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5560 ConstructedInterpolants, 0 QuantifiedInterpolants, 4763674 SizeOfPredicates, 1 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 3746/3750 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown