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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:28:51,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:28:51,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:28:51,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:28:51,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:28:51,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:28:51,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:28:51,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:28:51,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:28:51,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:28:51,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:28:51,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:28:51,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:28:51,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:28:51,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:28:51,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:28:51,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:28:51,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:28:51,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:28:51,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:28:51,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:28:51,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:28:51,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:28:51,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:28:51,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:28:51,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:28:51,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:28:51,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:28:51,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:28:51,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:28:51,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:28:51,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:28:51,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:28:51,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:28:51,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:28:51,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:28:51,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:28:51,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:28:51,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:28:51,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:28:51,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:28:51,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:28:51,695 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:28:51,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:28:51,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:28:51,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:28:51,698 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:28:51,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:28:51,698 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:28:51,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:28:51,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:28:51,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:28:51,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:28:51,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:28:51,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:28:51,699 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:28:51,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:28:51,700 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:28:51,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:28:51,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:28:51,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:28:51,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:28:51,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:28:51,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:51,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:28:51,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:28:51,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:28:51,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:28:51,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:28:51,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:28:51,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:28:51,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:28:52,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:28:52,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:28:52,023 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:28:52,024 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:28:52,024 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-10-07 13:28:52,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db849c72f/cf6bca6015364efeab6d84d41db9743c/FLAG8b524d77d [2019-10-07 13:28:52,608 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:28:52,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-10-07 13:28:52,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db849c72f/cf6bca6015364efeab6d84d41db9743c/FLAG8b524d77d [2019-10-07 13:28:53,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db849c72f/cf6bca6015364efeab6d84d41db9743c [2019-10-07 13:28:53,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:28:53,089 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:28:53,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:53,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:28:53,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:28:53,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:53" (1/1) ... [2019-10-07 13:28:53,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c76a8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53, skipping insertion in model container [2019-10-07 13:28:53,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:53" (1/1) ... [2019-10-07 13:28:53,106 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:28:53,131 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:28:53,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:53,333 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:28:53,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:53,501 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:28:53,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53 WrapperNode [2019-10-07 13:28:53,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:53,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:28:53,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:28:53,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:28:53,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53" (1/1) ... [2019-10-07 13:28:53,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53" (1/1) ... [2019-10-07 13:28:53,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53" (1/1) ... [2019-10-07 13:28:53,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53" (1/1) ... [2019-10-07 13:28:53,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53" (1/1) ... [2019-10-07 13:28:53,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53" (1/1) ... [2019-10-07 13:28:53,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53" (1/1) ... [2019-10-07 13:28:53,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:28:53,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:28:53,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:28:53,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:28:53,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53" (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-10-07 13:28:53,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:28:53,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:28:53,614 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:28:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:28:53,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:28:53,615 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:28:53,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:28:53,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:28:54,103 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:28:54,103 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:28:54,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:54 BoogieIcfgContainer [2019-10-07 13:28:54,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:28:54,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:28:54,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:28:54,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:28:54,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:28:53" (1/3) ... [2019-10-07 13:28:54,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb7b637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:54, skipping insertion in model container [2019-10-07 13:28:54,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:53" (2/3) ... [2019-10-07 13:28:54,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb7b637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:54, skipping insertion in model container [2019-10-07 13:28:54,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:54" (3/3) ... [2019-10-07 13:28:54,112 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-10-07 13:28:54,121 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:28:54,127 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:28:54,136 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:28:54,159 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:28:54,159 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:28:54,159 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:28:54,159 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:28:54,160 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:28:54,160 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:28:54,160 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:28:54,160 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:28:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-10-07 13:28:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:28:54,182 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:54,183 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:54,186 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash 991570927, now seen corresponding path program 1 times [2019-10-07 13:28:54,198 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:54,198 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:54,199 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:54,199 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:54,396 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:54,396 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:54,397 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:54,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:54,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:54,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:54,415 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2019-10-07 13:28:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:54,476 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2019-10-07 13:28:54,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:54,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 13:28:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:54,496 INFO L225 Difference]: With dead ends: 58 [2019-10-07 13:28:54,497 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 13:28:54,502 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 13:28:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-10-07 13:28:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:28:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2019-10-07 13:28:54,547 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 39 transitions. Word has length 10 [2019-10-07 13:28:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:54,547 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 39 transitions. [2019-10-07 13:28:54,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 39 transitions. [2019-10-07 13:28:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:28:54,548 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:54,548 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:54,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash 674141693, now seen corresponding path program 1 times [2019-10-07 13:28:54,549 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:54,550 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:54,550 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:54,550 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:54,646 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:54,646 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:54,646 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:54,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:54,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:54,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:54,648 INFO L87 Difference]: Start difference. First operand 25 states and 39 transitions. Second operand 4 states. [2019-10-07 13:28:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:54,674 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2019-10-07 13:28:54,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:54,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:28:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:54,676 INFO L225 Difference]: With dead ends: 43 [2019-10-07 13:28:54,676 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 13:28:54,677 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 13:28:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2019-10-07 13:28:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:28:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2019-10-07 13:28:54,685 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 38 transitions. Word has length 11 [2019-10-07 13:28:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:54,685 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 38 transitions. [2019-10-07 13:28:54,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2019-10-07 13:28:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:28:54,686 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:54,686 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:54,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:54,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:54,688 INFO L82 PathProgramCache]: Analyzing trace with hash -576229628, now seen corresponding path program 1 times [2019-10-07 13:28:54,688 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:54,688 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:54,688 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:54,689 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:54,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:54,744 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:54,745 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:54,745 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:54,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:54,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:54,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:54,747 INFO L87 Difference]: Start difference. First operand 25 states and 38 transitions. Second operand 4 states. [2019-10-07 13:28:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:54,776 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2019-10-07 13:28:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:54,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:28:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:54,778 INFO L225 Difference]: With dead ends: 41 [2019-10-07 13:28:54,778 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 13:28:54,779 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 13:28:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2019-10-07 13:28:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:28:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-10-07 13:28:54,787 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 12 [2019-10-07 13:28:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:54,787 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-10-07 13:28:54,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-10-07 13:28:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:28:54,788 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:54,788 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:54,789 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:54,791 INFO L82 PathProgramCache]: Analyzing trace with hash -683034574, now seen corresponding path program 1 times [2019-10-07 13:28:54,791 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:54,791 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:54,791 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:54,792 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:54,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:54,889 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:54,890 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:54,890 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:54,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:54,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:54,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:54,892 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 4 states. [2019-10-07 13:28:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:54,927 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2019-10-07 13:28:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:54,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:28:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:54,931 INFO L225 Difference]: With dead ends: 39 [2019-10-07 13:28:54,931 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 13:28:54,932 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 13:28:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2019-10-07 13:28:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:28:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2019-10-07 13:28:54,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 13 [2019-10-07 13:28:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:54,938 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-10-07 13:28:54,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2019-10-07 13:28:54,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:28:54,939 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:54,939 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:54,940 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:54,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:54,940 INFO L82 PathProgramCache]: Analyzing trace with hash 300979737, now seen corresponding path program 1 times [2019-10-07 13:28:54,940 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:54,941 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:54,941 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:54,941 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:55,000 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,001 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:55,001 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:55,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:55,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:55,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:55,003 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 4 states. [2019-10-07 13:28:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:55,030 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2019-10-07 13:28:55,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:55,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-07 13:28:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:55,034 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:28:55,034 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 13:28:55,035 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 13:28:55,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-10-07 13:28:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:28:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-10-07 13:28:55,042 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 14 [2019-10-07 13:28:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:55,042 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-10-07 13:28:55,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-10-07 13:28:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:28:55,043 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:55,044 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:55,044 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash 740652647, now seen corresponding path program 1 times [2019-10-07 13:28:55,045 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:55,045 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,045 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,046 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:55,092 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,092 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:55,092 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:55,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:55,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:55,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:55,094 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2019-10-07 13:28:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:55,116 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2019-10-07 13:28:55,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:55,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:28:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:55,119 INFO L225 Difference]: With dead ends: 35 [2019-10-07 13:28:55,119 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 13:28:55,120 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 13:28:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-10-07 13:28:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:28:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-10-07 13:28:55,140 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 15 [2019-10-07 13:28:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:55,140 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-07 13:28:55,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2019-10-07 13:28:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:28:55,141 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:55,142 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:55,142 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1485611310, now seen corresponding path program 1 times [2019-10-07 13:28:55,144 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:55,146 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,146 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,147 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:55,215 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,215 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:55,215 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:55,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:55,217 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 4 states. [2019-10-07 13:28:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:55,258 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-10-07 13:28:55,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:55,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-07 13:28:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:55,260 INFO L225 Difference]: With dead ends: 33 [2019-10-07 13:28:55,260 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 13:28:55,261 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 13:28:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-10-07 13:28:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:28:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-10-07 13:28:55,270 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2019-10-07 13:28:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:55,272 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-07 13:28:55,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-10-07 13:28:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:28:55,273 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:55,273 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:55,274 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1190473572, now seen corresponding path program 1 times [2019-10-07 13:28:55,274 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:55,274 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,275 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,275 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:55,346 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:55,346 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:55,347 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:55,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:55,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:55,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:55,348 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2019-10-07 13:28:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:55,369 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2019-10-07 13:28:55,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:55,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-07 13:28:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:55,370 INFO L225 Difference]: With dead ends: 27 [2019-10-07 13:28:55,370 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:28:55,371 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:28:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:28:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:28:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:28:55,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-10-07 13:28:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:55,372 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:28:55,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:28:55,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:28:55,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:28:55,401 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:28:55,401 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:55,402 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:55,402 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:28:55,402 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:28:55,402 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:28:55,402 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-10-07 13:28:55,402 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-10-07 13:28:55,402 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2019-10-07 13:28:55,402 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-10-07 13:28:55,403 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-10-07 13:28:55,403 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-10-07 13:28:55,403 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-10-07 13:28:55,403 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2019-10-07 13:28:55,403 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-07 13:28:55,403 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2019-10-07 13:28:55,403 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-07 13:28:55,404 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-10-07 13:28:55,404 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-07 13:28:55,404 INFO L446 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-10-07 13:28:55,404 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-10-07 13:28:55,404 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-10-07 13:28:55,404 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-10-07 13:28:55,405 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-07 13:28:55,405 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-10-07 13:28:55,405 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-10-07 13:28:55,405 INFO L446 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-10-07 13:28:55,405 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-10-07 13:28:55,405 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-10-07 13:28:55,405 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-10-07 13:28:55,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:28:55 BoogieIcfgContainer [2019-10-07 13:28:55,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:28:55,416 INFO L168 Benchmark]: Toolchain (without parser) took 2326.44 ms. Allocated memory was 144.2 MB in the beginning and 232.8 MB in the end (delta: 88.6 MB). Free memory was 101.8 MB in the beginning and 182.9 MB in the end (delta: -81.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:55,417 INFO L168 Benchmark]: CDTParser took 1.40 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:28:55,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.10 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 181.1 MB in the end (delta: -79.5 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:55,419 INFO L168 Benchmark]: Boogie Preprocessor took 55.40 ms. Allocated memory is still 201.9 MB. Free memory was 181.1 MB in the beginning and 178.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:55,420 INFO L168 Benchmark]: RCFGBuilder took 546.24 ms. Allocated memory is still 201.9 MB. Free memory was 178.7 MB in the beginning and 150.4 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:55,421 INFO L168 Benchmark]: TraceAbstraction took 1308.03 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 150.4 MB in the beginning and 182.9 MB in the end (delta: -32.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-07 13:28:55,425 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 412.10 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 181.1 MB in the end (delta: -79.5 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.40 ms. Allocated memory is still 201.9 MB. Free memory was 181.1 MB in the beginning and 178.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 546.24 ms. Allocated memory is still 201.9 MB. Free memory was 178.7 MB in the beginning and 150.4 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1308.03 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 150.4 MB in the beginning and 182.9 MB in the end (delta: -32.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 1.2s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 276 SDtfs, 202 SDslu, 379 SDs, 0 SdLazy, 72 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 4444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...