java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:04:26,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:04:26,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:04:26,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:04:26,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:04:26,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:04:26,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:04:26,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:04:26,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:04:26,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:04:26,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:04:26,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:04:26,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:04:26,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:04:26,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:04:26,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:04:26,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:04:26,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:04:26,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:04:26,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:04:26,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:04:26,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:04:26,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:04:26,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:04:26,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:04:26,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:04:26,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:04:26,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:04:26,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:04:26,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:04:26,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:04:26,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:04:26,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:04:26,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:04:26,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:04:26,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:04:26,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:04:26,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:04:26,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:04:26,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:04:26,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:04:26,293 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:04:26,308 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:04:26,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:04:26,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:04:26,308 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:04:26,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:04:26,309 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:04:26,310 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:04:26,310 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:04:26,310 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:04:26,310 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:04:26,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:04:26,311 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:04:26,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:04:26,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:04:26,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:04:26,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:04:26,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:04:26,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:04:26,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:04:26,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:04:26,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:04:26,313 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:04:26,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:04:26,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:04:26,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:04:26,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:04:26,314 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:04:26,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:04:26,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:04:26,315 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:04:26,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:04:26,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:04:26,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:04:26,359 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:04:26,360 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:04:26,361 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-09-10 02:04:26,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11e72bdf7/6da52ee513b842c1b33c93edbbe8cd3f/FLAG25af0a837 [2019-09-10 02:04:26,827 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:04:26,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-09-10 02:04:26,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11e72bdf7/6da52ee513b842c1b33c93edbbe8cd3f/FLAG25af0a837 [2019-09-10 02:04:27,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11e72bdf7/6da52ee513b842c1b33c93edbbe8cd3f [2019-09-10 02:04:27,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:04:27,244 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:04:27,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:27,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:04:27,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:04:27,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:27" (1/1) ... [2019-09-10 02:04:27,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df8f01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27, skipping insertion in model container [2019-09-10 02:04:27,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:27" (1/1) ... [2019-09-10 02:04:27,263 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:04:27,296 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:04:27,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:27,593 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:04:27,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:27,781 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:04:27,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27 WrapperNode [2019-09-10 02:04:27,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:27,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:04:27,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:04:27,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:04:27,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27" (1/1) ... [2019-09-10 02:04:27,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27" (1/1) ... [2019-09-10 02:04:27,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27" (1/1) ... [2019-09-10 02:04:27,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27" (1/1) ... [2019-09-10 02:04:27,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27" (1/1) ... [2019-09-10 02:04:27,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27" (1/1) ... [2019-09-10 02:04:27,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27" (1/1) ... [2019-09-10 02:04:27,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:04:27,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:04:27,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:04:27,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:04:27,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27" (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 [2019-09-10 02:04:27,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:04:27,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:04:27,924 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:04:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:04:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:04:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:04:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:04:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:04:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:04:27,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:04:28,403 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:04:28,403 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:04:28,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:28 BoogieIcfgContainer [2019-09-10 02:04:28,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:04:28,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:04:28,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:04:28,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:04:28,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:04:27" (1/3) ... [2019-09-10 02:04:28,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74befa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:28, skipping insertion in model container [2019-09-10 02:04:28,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:27" (2/3) ... [2019-09-10 02:04:28,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74befa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:28, skipping insertion in model container [2019-09-10 02:04:28,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:28" (3/3) ... [2019-09-10 02:04:28,411 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-09-10 02:04:28,419 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:04:28,427 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-09-10 02:04:28,449 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-09-10 02:04:28,477 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:04:28,478 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:04:28,478 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:04:28,479 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:04:28,479 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:04:28,479 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:04:28,479 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:04:28,479 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:04:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-09-10 02:04:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:04:28,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:28,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:28,512 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-09-10 02:04:28,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:28,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:28,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:28,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:28,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:28,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:28,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:28,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:28,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:28,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:28,722 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2019-09-10 02:04:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:28,956 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2019-09-10 02:04:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:28,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-10 02:04:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:28,976 INFO L225 Difference]: With dead ends: 125 [2019-09-10 02:04:28,976 INFO L226 Difference]: Without dead ends: 111 [2019-09-10 02:04:28,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-10 02:04:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-09-10 02:04:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-10 02:04:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-10 02:04:29,026 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-09-10 02:04:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:29,026 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-10 02:04:29,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-10 02:04:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:04:29,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:29,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:29,029 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:29,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-09-10 02:04:29,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:29,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:29,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:29,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:29,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:29,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:29,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:29,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:29,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:29,110 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-09-10 02:04:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:29,204 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-09-10 02:04:29,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:29,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-10 02:04:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:29,207 INFO L225 Difference]: With dead ends: 109 [2019-09-10 02:04:29,207 INFO L226 Difference]: Without dead ends: 109 [2019-09-10 02:04:29,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-10 02:04:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-09-10 02:04:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 02:04:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-09-10 02:04:29,217 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-09-10 02:04:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:29,218 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-09-10 02:04:29,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-09-10 02:04:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:04:29,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:29,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:29,220 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-09-10 02:04:29,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:29,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:29,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:29,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:29,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:29,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:29,293 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2019-09-10 02:04:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:29,413 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-10 02:04:29,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:29,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-10 02:04:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:29,415 INFO L225 Difference]: With dead ends: 71 [2019-09-10 02:04:29,415 INFO L226 Difference]: Without dead ends: 71 [2019-09-10 02:04:29,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-10 02:04:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-10 02:04:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 02:04:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-10 02:04:29,425 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-09-10 02:04:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:29,426 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-10 02:04:29,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-10 02:04:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:04:29,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:29,427 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:29,428 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-09-10 02:04:29,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:29,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:29,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:29,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:29,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:29,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:29,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:29,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:29,492 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-09-10 02:04:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:29,572 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-10 02:04:29,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:29,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-10 02:04:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:29,573 INFO L225 Difference]: With dead ends: 69 [2019-09-10 02:04:29,573 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 02:04:29,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 02:04:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-10 02:04:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 02:04:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-10 02:04:29,579 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-09-10 02:04:29,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:29,579 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-10 02:04:29,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-10 02:04:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:04:29,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:29,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:29,581 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-09-10 02:04:29,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:29,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:29,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:29,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:29,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:29,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:29,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:29,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:29,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:29,639 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-09-10 02:04:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:29,754 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-09-10 02:04:29,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:29,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-10 02:04:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:29,756 INFO L225 Difference]: With dead ends: 114 [2019-09-10 02:04:29,756 INFO L226 Difference]: Without dead ends: 114 [2019-09-10 02:04:29,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-10 02:04:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-09-10 02:04:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 02:04:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-10 02:04:29,762 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-09-10 02:04:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:29,763 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-10 02:04:29,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-10 02:04:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:04:29,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:29,764 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:29,765 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:29,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:29,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-09-10 02:04:29,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:29,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:29,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:29,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:29,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:29,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:29,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:29,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:29,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:29,826 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-09-10 02:04:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:29,926 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-09-10 02:04:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:29,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-10 02:04:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:29,928 INFO L225 Difference]: With dead ends: 99 [2019-09-10 02:04:29,928 INFO L226 Difference]: Without dead ends: 99 [2019-09-10 02:04:29,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-10 02:04:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-09-10 02:04:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 02:04:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-10 02:04:29,934 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-09-10 02:04:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:29,935 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-10 02:04:29,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-10 02:04:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:04:29,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:29,936 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:29,937 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:29,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:29,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-09-10 02:04:29,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:29,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:29,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:29,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:29,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:29,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:29,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:29,999 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-09-10 02:04:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,069 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-09-10 02:04:30,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:30,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-10 02:04:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,071 INFO L225 Difference]: With dead ends: 63 [2019-09-10 02:04:30,071 INFO L226 Difference]: Without dead ends: 61 [2019-09-10 02:04:30,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:30,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-10 02:04:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-10 02:04:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 02:04:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-10 02:04:30,083 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-09-10 02:04:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,083 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-10 02:04:30,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-10 02:04:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:04:30,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,086 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-09-10 02:04:30,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:30,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:30,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:30,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:30,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:30,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:30,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:30,160 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-10 02:04:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,211 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-09-10 02:04:30,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:30,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-10 02:04:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,212 INFO L225 Difference]: With dead ends: 59 [2019-09-10 02:04:30,212 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 02:04:30,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 02:04:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-10 02:04:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 02:04:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-10 02:04:30,222 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-09-10 02:04:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,223 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-10 02:04:30,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-10 02:04:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:30,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,227 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-09-10 02:04:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:30,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:30,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:30,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:30,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:30,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:30,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:30,332 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-09-10 02:04:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,461 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2019-09-10 02:04:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:30,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,463 INFO L225 Difference]: With dead ends: 92 [2019-09-10 02:04:30,463 INFO L226 Difference]: Without dead ends: 92 [2019-09-10 02:04:30,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-10 02:04:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-09-10 02:04:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-10 02:04:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-10 02:04:30,471 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2019-09-10 02:04:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,474 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-10 02:04:30,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-10 02:04:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:30,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,480 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2019-09-10 02:04:30,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:30,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:30,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:30,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:30,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:30,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:30,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:30,581 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-09-10 02:04:30,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,704 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-09-10 02:04:30,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:30,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:30,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,706 INFO L225 Difference]: With dead ends: 82 [2019-09-10 02:04:30,706 INFO L226 Difference]: Without dead ends: 82 [2019-09-10 02:04:30,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:30,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-10 02:04:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-09-10 02:04:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 02:04:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-10 02:04:30,715 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2019-09-10 02:04:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,718 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-10 02:04:30,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-10 02:04:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:30,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,719 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,720 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,720 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2019-09-10 02:04:30,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:30,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:30,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:30,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:30,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:30,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:30,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:30,795 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-09-10 02:04:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,868 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-09-10 02:04:30,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:30,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,869 INFO L225 Difference]: With dead ends: 68 [2019-09-10 02:04:30,871 INFO L226 Difference]: Without dead ends: 68 [2019-09-10 02:04:30,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-10 02:04:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2019-09-10 02:04:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-10 02:04:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-09-10 02:04:30,880 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2019-09-10 02:04:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,880 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-09-10 02:04:30,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-09-10 02:04:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:30,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,882 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,882 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2019-09-10 02:04:30,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:30,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:30,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:30,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:30,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:30,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:30,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:30,941 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-09-10 02:04:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,008 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-10 02:04:31,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:31,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,009 INFO L225 Difference]: With dead ends: 49 [2019-09-10 02:04:31,009 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 02:04:31,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 02:04:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-10 02:04:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 02:04:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-10 02:04:31,012 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2019-09-10 02:04:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,012 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-10 02:04:31,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-10 02:04:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:31,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,014 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2019-09-10 02:04:31,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:31,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,044 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-09-10 02:04:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,132 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-09-10 02:04:31,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:31,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,134 INFO L225 Difference]: With dead ends: 67 [2019-09-10 02:04:31,134 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 02:04:31,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 02:04:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-09-10 02:04:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:04:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-10 02:04:31,138 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-09-10 02:04:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,138 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-10 02:04:31,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-10 02:04:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:31,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,140 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2019-09-10 02:04:31,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:31,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,209 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-09-10 02:04:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,296 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-10 02:04:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:31,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,298 INFO L225 Difference]: With dead ends: 57 [2019-09-10 02:04:31,298 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 02:04:31,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 02:04:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-09-10 02:04:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 02:04:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-10 02:04:31,303 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-09-10 02:04:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,303 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-10 02:04:31,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-10 02:04:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:31,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,304 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,305 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2019-09-10 02:04:31,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:31,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,382 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-09-10 02:04:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,441 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-10 02:04:31,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:31,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:31,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,442 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:04:31,442 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 02:04:31,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 02:04:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 02:04:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:04:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-10 02:04:31,446 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-09-10 02:04:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,446 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-10 02:04:31,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-10 02:04:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:04:31,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,448 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2019-09-10 02:04:31,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:31,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,512 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-09-10 02:04:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,590 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-09-10 02:04:31,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:31,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-10 02:04:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,591 INFO L225 Difference]: With dead ends: 52 [2019-09-10 02:04:31,591 INFO L226 Difference]: Without dead ends: 52 [2019-09-10 02:04:31,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-10 02:04:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-09-10 02:04:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-10 02:04:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-10 02:04:31,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-09-10 02:04:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,595 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-10 02:04:31,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-10 02:04:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:04:31,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,597 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,597 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2019-09-10 02:04:31,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:31,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:31,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:31,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:31,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:31,627 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2019-09-10 02:04:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,661 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-10 02:04:31,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:31,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-10 02:04:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,662 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:04:31,662 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:04:31,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:04:31,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 02:04:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 02:04:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-10 02:04:31,664 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-09-10 02:04:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,664 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-10 02:04:31,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-10 02:04:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 02:04:31,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,666 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,666 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2019-09-10 02:04:31,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:31,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:31,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:31,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:31,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:31,693 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-09-10 02:04:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,737 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-10 02:04:31,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:31,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-10 02:04:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,738 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:04:31,738 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:04:31,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:04:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:04:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:04:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:04:31,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-10 02:04:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,740 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:04:31,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:04:31,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:04:31,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:04:31 BoogieIcfgContainer [2019-09-10 02:04:31,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:04:31,747 INFO L168 Benchmark]: Toolchain (without parser) took 4502.89 ms. Allocated memory was 142.6 MB in the beginning and 251.1 MB in the end (delta: 108.5 MB). Free memory was 89.7 MB in the beginning and 93.0 MB in the end (delta: -3.3 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:31,747 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 142.6 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:04:31,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.72 ms. Allocated memory was 142.6 MB in the beginning and 202.4 MB in the end (delta: 59.8 MB). Free memory was 89.3 MB in the beginning and 179.7 MB in the end (delta: -90.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:31,749 INFO L168 Benchmark]: Boogie Preprocessor took 79.29 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 177.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:31,749 INFO L168 Benchmark]: RCFGBuilder took 539.44 ms. Allocated memory is still 202.4 MB. Free memory was 177.1 MB in the beginning and 153.3 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:31,750 INFO L168 Benchmark]: TraceAbstraction took 3339.59 ms. Allocated memory was 202.4 MB in the beginning and 251.1 MB in the end (delta: 48.8 MB). Free memory was 152.7 MB in the beginning and 93.0 MB in the end (delta: 59.7 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:31,754 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 142.6 MB. Free memory was 108.9 MB in the beginning and 108.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 536.72 ms. Allocated memory was 142.6 MB in the beginning and 202.4 MB in the end (delta: 59.8 MB). Free memory was 89.3 MB in the beginning and 179.7 MB in the end (delta: -90.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.29 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 177.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 539.44 ms. Allocated memory is still 202.4 MB. Free memory was 177.1 MB in the beginning and 153.3 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3339.59 ms. Allocated memory was 202.4 MB in the beginning and 251.1 MB in the end (delta: 48.8 MB). Free memory was 152.7 MB in the beginning and 93.0 MB in the end (delta: 59.7 MB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. SAFE Result, 3.2s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 856 SDtfs, 1411 SDslu, 899 SDs, 0 SdLazy, 1023 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, 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: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 311 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 10744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...