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/recursive/gcd01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:51:40,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:51:40,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:51:40,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:51:40,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:51:40,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:51:40,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:51:40,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:51:40,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:51:40,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:51:40,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:51:40,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:51:40,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:51:40,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:51:40,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:51:40,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:51:40,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:51:40,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:51:40,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:51:40,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:51:40,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:51:40,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:51:40,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:51:40,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:51:40,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:51:40,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:51:40,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:51:40,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:51:40,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:51:40,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:51:40,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:51:40,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:51:40,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:51:40,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:51:40,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:51:40,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:51:40,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:51:40,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:51:40,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:51:40,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:51:40,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:51:40,417 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:51:40,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:51:40,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:51:40,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:51:40,437 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:51:40,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:51:40,438 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:51:40,438 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:51:40,439 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:51:40,439 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:51:40,439 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:51:40,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:51:40,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:51:40,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:51:40,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:51:40,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:51:40,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:51:40,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:51:40,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:51:40,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:51:40,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:51:40,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:51:40,444 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:51:40,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:51:40,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:51:40,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:51:40,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:51:40,445 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:51:40,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:51:40,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:51:40,445 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:51:40,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:51:40,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:51:40,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:51:40,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:51:40,520 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:51:40,521 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/gcd01-1.c [2019-09-10 02:51:40,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4764498/14077e46300f454b93ea149081dabfb8/FLAG525cda65c [2019-09-10 02:51:41,051 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:51:41,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/gcd01-1.c [2019-09-10 02:51:41,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4764498/14077e46300f454b93ea149081dabfb8/FLAG525cda65c [2019-09-10 02:51:41,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a4764498/14077e46300f454b93ea149081dabfb8 [2019-09-10 02:51:41,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:51:41,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:51:41,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:41,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:51:41,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:51:41,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:41" (1/1) ... [2019-09-10 02:51:41,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41, skipping insertion in model container [2019-09-10 02:51:41,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:41" (1/1) ... [2019-09-10 02:51:41,468 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:51:41,493 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:51:41,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:41,754 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:51:41,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:41,793 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:51:41,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41 WrapperNode [2019-09-10 02:51:41,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:41,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:51:41,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:51:41,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:51:41,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41" (1/1) ... [2019-09-10 02:51:41,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41" (1/1) ... [2019-09-10 02:51:41,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41" (1/1) ... [2019-09-10 02:51:41,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41" (1/1) ... [2019-09-10 02:51:41,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41" (1/1) ... [2019-09-10 02:51:41,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41" (1/1) ... [2019-09-10 02:51:41,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41" (1/1) ... [2019-09-10 02:51:41,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:51:41,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:51:41,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:51:41,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:51:41,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41" (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:51:41,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:51:41,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:51:41,969 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2019-09-10 02:51:41,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:51:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:51:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:51:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2019-09-10 02:51:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:51:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:51:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:51:42,178 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:51:42,180 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:51:42,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:42 BoogieIcfgContainer [2019-09-10 02:51:42,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:51:42,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:51:42,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:51:42,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:51:42,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:51:41" (1/3) ... [2019-09-10 02:51:42,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733ae82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:42, skipping insertion in model container [2019-09-10 02:51:42,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:41" (2/3) ... [2019-09-10 02:51:42,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733ae82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:42, skipping insertion in model container [2019-09-10 02:51:42,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:42" (3/3) ... [2019-09-10 02:51:42,198 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd01-1.c [2019-09-10 02:51:42,230 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:51:42,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:51:42,270 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:51:42,298 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:51:42,298 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:51:42,299 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:51:42,299 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:51:42,299 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:51:42,299 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:51:42,299 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:51:42,299 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:51:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-09-10 02:51:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:51:42,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:42,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:42,324 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:42,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:42,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1001932622, now seen corresponding path program 1 times [2019-09-10 02:51:42,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:42,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:42,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:42,558 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:51:42,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:42,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:51:42,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:42,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:51:42,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:51:42,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:51:42,580 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 6 states. [2019-09-10 02:51:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:42,718 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-09-10 02:51:42,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:51:42,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-09-10 02:51:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:42,730 INFO L225 Difference]: With dead ends: 32 [2019-09-10 02:51:42,730 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 02:51:42,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:51:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 02:51:42,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 02:51:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 02:51:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-09-10 02:51:42,777 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2019-09-10 02:51:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:42,778 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-09-10 02:51:42,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:51:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-09-10 02:51:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:51:42,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:42,781 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:51:42,781 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:42,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash -423841111, now seen corresponding path program 1 times [2019-09-10 02:51:42,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:42,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:42,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:42,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:42,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:42,863 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:51:42,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:42,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:51:42,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:42,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:51:42,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:51:42,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:51:42,868 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2019-09-10 02:51:42,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:42,924 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2019-09-10 02:51:42,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:51:42,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-10 02:51:42,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:42,926 INFO L225 Difference]: With dead ends: 28 [2019-09-10 02:51:42,926 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 02:51:42,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:51:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 02:51:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-09-10 02:51:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 02:51:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-09-10 02:51:42,935 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2019-09-10 02:51:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:42,935 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-09-10 02:51:42,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:51:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-09-10 02:51:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 02:51:42,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:42,937 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:42,938 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:42,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:42,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1280495258, now seen corresponding path program 1 times [2019-09-10 02:51:42,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:42,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:42,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:51:43,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:43,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:51:43,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:43,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:51:43,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:51:43,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:51:43,063 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2019-09-10 02:51:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:43,194 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-09-10 02:51:43,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:51:43,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-10 02:51:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:43,199 INFO L225 Difference]: With dead ends: 28 [2019-09-10 02:51:43,199 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 02:51:43,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:51:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 02:51:43,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-09-10 02:51:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 02:51:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-09-10 02:51:43,211 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 23 [2019-09-10 02:51:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:43,213 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-09-10 02:51:43,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:51:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-09-10 02:51:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 02:51:43,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:43,220 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:43,222 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:43,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:43,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1668712292, now seen corresponding path program 1 times [2019-09-10 02:51:43,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:51:43,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:43,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:51:43,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:43,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:51:43,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:51:43,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:51:43,356 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 7 states. [2019-09-10 02:51:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:43,508 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2019-09-10 02:51:43,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:43,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-09-10 02:51:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:43,511 INFO L225 Difference]: With dead ends: 28 [2019-09-10 02:51:43,511 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 02:51:43,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:51:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 02:51:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-09-10 02:51:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 02:51:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-10 02:51:43,517 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 23 [2019-09-10 02:51:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:43,518 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-10 02:51:43,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:51:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-10 02:51:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:51:43,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:43,519 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:43,519 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1139697511, now seen corresponding path program 1 times [2019-09-10 02:51:43,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:43,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:51:43,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:43,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:51:43,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:43,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:51:43,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:51:43,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:51:43,585 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2019-09-10 02:51:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:43,642 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-10 02:51:43,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:43,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-09-10 02:51:43,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:43,644 INFO L225 Difference]: With dead ends: 29 [2019-09-10 02:51:43,644 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 02:51:43,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:51:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 02:51:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-09-10 02:51:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 02:51:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-10 02:51:43,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2019-09-10 02:51:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:43,654 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-10 02:51:43,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:51:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-10 02:51:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:51:43,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:43,655 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:43,655 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash 99153721, now seen corresponding path program 1 times [2019-09-10 02:51:43,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:43,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:43,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:51:43,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:43,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:51:43,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:43,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:51:43,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:51:43,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:51:43,768 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 7 states. [2019-09-10 02:51:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:43,822 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-09-10 02:51:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:43,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-09-10 02:51:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:43,824 INFO L225 Difference]: With dead ends: 32 [2019-09-10 02:51:43,824 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 02:51:43,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:51:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 02:51:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 02:51:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 02:51:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-09-10 02:51:43,830 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2019-09-10 02:51:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:43,830 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-09-10 02:51:43,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:51:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-09-10 02:51:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 02:51:43,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:43,832 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:43,832 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash 10057033, now seen corresponding path program 1 times [2019-09-10 02:51:43,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:43,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:43,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 02:51:43,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:43,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:51:43,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:43,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:51:43,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:51:43,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:51:43,920 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 8 states. [2019-09-10 02:51:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:43,986 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2019-09-10 02:51:43,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:51:43,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-09-10 02:51:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:43,987 INFO L225 Difference]: With dead ends: 28 [2019-09-10 02:51:43,987 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:51:43,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:51:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:51:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:51:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:51:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:51:43,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-09-10 02:51:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:43,989 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:51:43,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:51:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:51:43,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:51:43,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:51:43 BoogieIcfgContainer [2019-09-10 02:51:43,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:51:43,998 INFO L168 Benchmark]: Toolchain (without parser) took 2546.86 ms. Allocated memory was 134.2 MB in the beginning and 226.5 MB in the end (delta: 92.3 MB). Free memory was 88.8 MB in the beginning and 140.7 MB in the end (delta: -51.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:51:43,999 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 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:51:44,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.34 ms. Allocated memory is still 134.2 MB. Free memory was 88.6 MB in the beginning and 79.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:51:44,002 INFO L168 Benchmark]: Boogie Preprocessor took 113.85 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 79.3 MB in the beginning and 175.9 MB in the end (delta: -96.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:51:44,002 INFO L168 Benchmark]: RCFGBuilder took 273.91 ms. Allocated memory is still 199.2 MB. Free memory was 175.9 MB in the beginning and 163.6 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:51:44,004 INFO L168 Benchmark]: TraceAbstraction took 1812.49 ms. Allocated memory was 199.2 MB in the beginning and 226.5 MB in the end (delta: 27.3 MB). Free memory was 163.0 MB in the beginning and 140.7 MB in the end (delta: 22.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:51:44,008 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.22 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 342.34 ms. Allocated memory is still 134.2 MB. Free memory was 88.6 MB in the beginning and 79.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.85 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 79.3 MB in the beginning and 175.9 MB in the end (delta: -96.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 273.91 ms. Allocated memory is still 199.2 MB. Free memory was 175.9 MB in the beginning and 163.6 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1812.49 ms. Allocated memory was 199.2 MB in the beginning and 226.5 MB in the end (delta: 27.3 MB). Free memory was 163.0 MB in the beginning and 140.7 MB in the end (delta: 22.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 89 SDslu, 489 SDs, 0 SdLazy, 285 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 6726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 34/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...