/usr/bin/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_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 03:58:13,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 03:58:13,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 03:58:13,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 03:58:13,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 03:58:13,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 03:58:13,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 03:58:13,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 03:58:13,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 03:58:13,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 03:58:13,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 03:58:13,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 03:58:13,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 03:58:13,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 03:58:13,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 03:58:13,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 03:58:13,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 03:58:13,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 03:58:13,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 03:58:13,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 03:58:13,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 03:58:13,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 03:58:13,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 03:58:13,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 03:58:13,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 03:58:13,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 03:58:13,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 03:58:13,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 03:58:13,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 03:58:13,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 03:58:13,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 03:58:13,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 03:58:13,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 03:58:13,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 03:58:13,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 03:58:13,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 03:58:13,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 03:58:13,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 03:58:13,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 03:58:13,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 03:58:13,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 03:58:13,927 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-11-07 03:58:13,950 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 03:58:13,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 03:58:13,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 03:58:13,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 03:58:13,953 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 03:58:13,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 03:58:13,953 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 03:58:13,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 03:58:13,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 03:58:13,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 03:58:13,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 03:58:13,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 03:58:13,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 03:58:13,955 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 03:58:13,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 03:58:13,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 03:58:13,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 03:58:13,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 03:58:13,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 03:58:13,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 03:58:13,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 03:58:13,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 03:58:13,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 03:58:13,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 03:58:13,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 03:58:13,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 03:58:13,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 03:58:13,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 03:58:13,960 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-11-07 03:58:14,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 03:58:14,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 03:58:14,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 03:58:14,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 03:58:14,273 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 03:58:14,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2019-11-07 03:58:14,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0123d696/16feac8fd10c4d9ca575393224fc305a/FLAG9938e8345 [2019-11-07 03:58:14,805 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 03:58:14,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-11-07 03:58:14,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0123d696/16feac8fd10c4d9ca575393224fc305a/FLAG9938e8345 [2019-11-07 03:58:15,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0123d696/16feac8fd10c4d9ca575393224fc305a [2019-11-07 03:58:15,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 03:58:15,207 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 03:58:15,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 03:58:15,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 03:58:15,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 03:58:15,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:15" (1/1) ... [2019-11-07 03:58:15,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d1ab0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15, skipping insertion in model container [2019-11-07 03:58:15,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:15" (1/1) ... [2019-11-07 03:58:15,229 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 03:58:15,263 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 03:58:15,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:58:15,529 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 03:58:15,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:58:15,655 INFO L192 MainTranslator]: Completed translation [2019-11-07 03:58:15,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15 WrapperNode [2019-11-07 03:58:15,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 03:58:15,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 03:58:15,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 03:58:15,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 03:58:15,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15" (1/1) ... [2019-11-07 03:58:15,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15" (1/1) ... [2019-11-07 03:58:15,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15" (1/1) ... [2019-11-07 03:58:15,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15" (1/1) ... [2019-11-07 03:58:15,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15" (1/1) ... [2019-11-07 03:58:15,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15" (1/1) ... [2019-11-07 03:58:15,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15" (1/1) ... [2019-11-07 03:58:15,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 03:58:15,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 03:58:15,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 03:58:15,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 03:58:15,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15" (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-11-07 03:58:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 03:58:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 03:58:15,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 03:58:15,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 03:58:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 03:58:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 03:58:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 03:58:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 03:58:16,377 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 03:58:16,377 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 03:58:16,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:16 BoogieIcfgContainer [2019-11-07 03:58:16,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 03:58:16,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 03:58:16,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 03:58:16,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 03:58:16,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:58:15" (1/3) ... [2019-11-07 03:58:16,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151307ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:16, skipping insertion in model container [2019-11-07 03:58:16,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:15" (2/3) ... [2019-11-07 03:58:16,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151307ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:16, skipping insertion in model container [2019-11-07 03:58:16,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:16" (3/3) ... [2019-11-07 03:58:16,388 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-11-07 03:58:16,399 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 03:58:16,408 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 03:58:16,420 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 03:58:16,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 03:58:16,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 03:58:16,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 03:58:16,447 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 03:58:16,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 03:58:16,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 03:58:16,448 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 03:58:16,448 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 03:58:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-07 03:58:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 03:58:16,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:16,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:16,478 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:16,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:16,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1011430877, now seen corresponding path program 1 times [2019-11-07 03:58:16,495 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:16,495 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882711827] [2019-11-07 03:58:16,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:16,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882711827] [2019-11-07 03:58:16,707 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:16,708 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:16,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219358170] [2019-11-07 03:58:16,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:16,715 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:16,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:16,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:16,733 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2019-11-07 03:58:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:16,806 INFO L93 Difference]: Finished difference Result 74 states and 122 transitions. [2019-11-07 03:58:16,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:16,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-07 03:58:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:16,822 INFO L225 Difference]: With dead ends: 74 [2019-11-07 03:58:16,822 INFO L226 Difference]: Without dead ends: 59 [2019-11-07 03:58:16,826 INFO L630 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-11-07 03:58:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-07 03:58:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 33. [2019-11-07 03:58:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 55 transitions. [2019-11-07 03:58:16,870 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 55 transitions. Word has length 10 [2019-11-07 03:58:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:16,871 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 55 transitions. [2019-11-07 03:58:16,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2019-11-07 03:58:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 03:58:16,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:16,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:16,874 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1289373383, now seen corresponding path program 1 times [2019-11-07 03:58:16,874 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:16,875 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905120612] [2019-11-07 03:58:16,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:16,969 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905120612] [2019-11-07 03:58:16,969 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:16,969 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:16,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84740079] [2019-11-07 03:58:16,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:16,971 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:16,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:16,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:16,972 INFO L87 Difference]: Start difference. First operand 33 states and 55 transitions. Second operand 4 states. [2019-11-07 03:58:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:17,004 INFO L93 Difference]: Finished difference Result 59 states and 99 transitions. [2019-11-07 03:58:17,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:17,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 03:58:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:17,006 INFO L225 Difference]: With dead ends: 59 [2019-11-07 03:58:17,007 INFO L226 Difference]: Without dead ends: 57 [2019-11-07 03:58:17,008 INFO L630 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-11-07 03:58:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-07 03:58:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2019-11-07 03:58:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions. [2019-11-07 03:58:17,015 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 54 transitions. Word has length 11 [2019-11-07 03:58:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:17,016 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 54 transitions. [2019-11-07 03:58:17,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 54 transitions. [2019-11-07 03:58:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 03:58:17,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:17,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:17,018 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1315656136, now seen corresponding path program 1 times [2019-11-07 03:58:17,018 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:17,019 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254501201] [2019-11-07 03:58:17,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:17,106 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254501201] [2019-11-07 03:58:17,106 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:17,106 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:17,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468190548] [2019-11-07 03:58:17,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:17,108 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:17,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:17,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:17,108 INFO L87 Difference]: Start difference. First operand 33 states and 54 transitions. Second operand 4 states. [2019-11-07 03:58:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:17,147 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2019-11-07 03:58:17,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:17,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 03:58:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:17,152 INFO L225 Difference]: With dead ends: 57 [2019-11-07 03:58:17,152 INFO L226 Difference]: Without dead ends: 55 [2019-11-07 03:58:17,153 INFO L630 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-11-07 03:58:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-07 03:58:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-11-07 03:58:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2019-11-07 03:58:17,163 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 12 [2019-11-07 03:58:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:17,164 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions. [2019-11-07 03:58:17,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. [2019-11-07 03:58:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 03:58:17,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:17,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:17,168 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:17,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2130421138, now seen corresponding path program 1 times [2019-11-07 03:58:17,169 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:17,169 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680881438] [2019-11-07 03:58:17,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:17,235 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680881438] [2019-11-07 03:58:17,235 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:17,235 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:17,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603554536] [2019-11-07 03:58:17,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:17,250 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:17,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:17,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:17,252 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand 4 states. [2019-11-07 03:58:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:17,294 INFO L93 Difference]: Finished difference Result 55 states and 89 transitions. [2019-11-07 03:58:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:17,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-07 03:58:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:17,297 INFO L225 Difference]: With dead ends: 55 [2019-11-07 03:58:17,297 INFO L226 Difference]: Without dead ends: 53 [2019-11-07 03:58:17,300 INFO L630 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-11-07 03:58:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-07 03:58:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2019-11-07 03:58:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2019-11-07 03:58:17,308 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 13 [2019-11-07 03:58:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:17,308 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 52 transitions. [2019-11-07 03:58:17,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 52 transitions. [2019-11-07 03:58:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 03:58:17,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:17,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:17,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:17,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:17,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1618332083, now seen corresponding path program 1 times [2019-11-07 03:58:17,313 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:17,313 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656641529] [2019-11-07 03:58:17,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:17,403 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656641529] [2019-11-07 03:58:17,403 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:17,404 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:17,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607134914] [2019-11-07 03:58:17,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:17,404 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:17,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:17,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:17,405 INFO L87 Difference]: Start difference. First operand 33 states and 52 transitions. Second operand 4 states. [2019-11-07 03:58:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:17,436 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2019-11-07 03:58:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:17,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-07 03:58:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:17,438 INFO L225 Difference]: With dead ends: 53 [2019-11-07 03:58:17,438 INFO L226 Difference]: Without dead ends: 51 [2019-11-07 03:58:17,439 INFO L630 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-11-07 03:58:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-07 03:58:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-11-07 03:58:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2019-11-07 03:58:17,448 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 14 [2019-11-07 03:58:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:17,448 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions. [2019-11-07 03:58:17,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions. [2019-11-07 03:58:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 03:58:17,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:17,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:17,452 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:17,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1371527075, now seen corresponding path program 1 times [2019-11-07 03:58:17,452 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:17,453 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112917391] [2019-11-07 03:58:17,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:17,523 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112917391] [2019-11-07 03:58:17,524 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:17,524 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:17,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831737156] [2019-11-07 03:58:17,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:17,525 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:17,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:17,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:17,525 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand 4 states. [2019-11-07 03:58:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:17,553 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2019-11-07 03:58:17,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:17,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 03:58:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:17,558 INFO L225 Difference]: With dead ends: 51 [2019-11-07 03:58:17,559 INFO L226 Difference]: Without dead ends: 49 [2019-11-07 03:58:17,559 INFO L630 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-11-07 03:58:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-07 03:58:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-07 03:58:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2019-11-07 03:58:17,570 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 15 [2019-11-07 03:58:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:17,570 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2019-11-07 03:58:17,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2019-11-07 03:58:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 03:58:17,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:17,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:17,573 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:17,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:17,573 INFO L82 PathProgramCache]: Analyzing trace with hash -432119198, now seen corresponding path program 1 times [2019-11-07 03:58:17,574 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:17,576 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462261649] [2019-11-07 03:58:17,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:17,637 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462261649] [2019-11-07 03:58:17,637 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:17,637 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:17,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840628730] [2019-11-07 03:58:17,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:17,638 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:17,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:17,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:17,641 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand 4 states. [2019-11-07 03:58:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:17,674 INFO L93 Difference]: Finished difference Result 49 states and 74 transitions. [2019-11-07 03:58:17,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:17,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-07 03:58:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:17,675 INFO L225 Difference]: With dead ends: 49 [2019-11-07 03:58:17,676 INFO L226 Difference]: Without dead ends: 47 [2019-11-07 03:58:17,676 INFO L630 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-11-07 03:58:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-07 03:58:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2019-11-07 03:58:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2019-11-07 03:58:17,682 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 16 [2019-11-07 03:58:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:17,683 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2019-11-07 03:58:17,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2019-11-07 03:58:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 03:58:17,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:17,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:17,684 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:17,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:17,686 INFO L82 PathProgramCache]: Analyzing trace with hash -510578472, now seen corresponding path program 1 times [2019-11-07 03:58:17,687 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:17,687 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278913859] [2019-11-07 03:58:17,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:17,736 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278913859] [2019-11-07 03:58:17,737 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:17,737 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:17,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540433511] [2019-11-07 03:58:17,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:17,738 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:17,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:17,738 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 4 states. [2019-11-07 03:58:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:17,761 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2019-11-07 03:58:17,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:17,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-07 03:58:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:17,762 INFO L225 Difference]: With dead ends: 47 [2019-11-07 03:58:17,762 INFO L226 Difference]: Without dead ends: 45 [2019-11-07 03:58:17,764 INFO L630 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-11-07 03:58:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-07 03:58:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-11-07 03:58:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2019-11-07 03:58:17,769 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 17 [2019-11-07 03:58:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:17,769 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2019-11-07 03:58:17,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2019-11-07 03:58:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 03:58:17,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:17,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:17,771 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1352151671, now seen corresponding path program 1 times [2019-11-07 03:58:17,771 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:17,771 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50821032] [2019-11-07 03:58:17,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:17,808 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50821032] [2019-11-07 03:58:17,808 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:17,808 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:17,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947487637] [2019-11-07 03:58:17,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:17,809 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:17,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:17,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:17,811 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 4 states. [2019-11-07 03:58:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:17,835 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2019-11-07 03:58:17,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:17,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-07 03:58:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:17,837 INFO L225 Difference]: With dead ends: 45 [2019-11-07 03:58:17,837 INFO L226 Difference]: Without dead ends: 43 [2019-11-07 03:58:17,837 INFO L630 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-11-07 03:58:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-07 03:58:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-11-07 03:58:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-11-07 03:58:17,843 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 18 [2019-11-07 03:58:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:17,843 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-07 03:58:17,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-11-07 03:58:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 03:58:17,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:17,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:17,846 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1032755699, now seen corresponding path program 1 times [2019-11-07 03:58:17,849 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:17,850 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101129306] [2019-11-07 03:58:17,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:17,888 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101129306] [2019-11-07 03:58:17,888 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:17,889 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:17,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349945409] [2019-11-07 03:58:17,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:17,890 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:17,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:17,891 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 4 states. [2019-11-07 03:58:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:17,908 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2019-11-07 03:58:17,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:17,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-07 03:58:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:17,910 INFO L225 Difference]: With dead ends: 43 [2019-11-07 03:58:17,910 INFO L226 Difference]: Without dead ends: 41 [2019-11-07 03:58:17,911 INFO L630 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-11-07 03:58:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-07 03:58:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-11-07 03:58:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2019-11-07 03:58:17,915 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 19 [2019-11-07 03:58:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:17,915 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-11-07 03:58:17,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2019-11-07 03:58:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 03:58:17,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:17,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:17,917 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:17,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1950439796, now seen corresponding path program 1 times [2019-11-07 03:58:17,918 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:17,918 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138974196] [2019-11-07 03:58:17,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:17,959 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138974196] [2019-11-07 03:58:17,960 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:17,960 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:17,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212397144] [2019-11-07 03:58:17,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:17,961 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:17,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:17,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:17,961 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand 4 states. [2019-11-07 03:58:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,016 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-11-07 03:58:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:18,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-07 03:58:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:18,020 INFO L225 Difference]: With dead ends: 41 [2019-11-07 03:58:18,020 INFO L226 Difference]: Without dead ends: 39 [2019-11-07 03:58:18,021 INFO L630 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-11-07 03:58:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-07 03:58:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-07 03:58:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:58:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2019-11-07 03:58:18,024 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2019-11-07 03:58:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:18,024 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2019-11-07 03:58:18,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2019-11-07 03:58:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 03:58:18,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:18,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:18,026 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash -333875390, now seen corresponding path program 1 times [2019-11-07 03:58:18,026 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:18,026 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996720317] [2019-11-07 03:58:18,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:18,071 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996720317] [2019-11-07 03:58:18,071 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:18,071 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:18,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542982087] [2019-11-07 03:58:18,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:18,073 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:18,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:18,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,074 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand 4 states. [2019-11-07 03:58:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,094 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2019-11-07 03:58:18,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:18,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-07 03:58:18,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:18,095 INFO L225 Difference]: With dead ends: 35 [2019-11-07 03:58:18,095 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 03:58:18,095 INFO L630 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-11-07 03:58:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 03:58:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 03:58:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 03:58:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 03:58:18,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-07 03:58:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:18,099 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 03:58:18,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 03:58:18,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 03:58:18,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 03:58:18,121 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 03:58:18,121 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 03:58:18,121 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 03:58:18,121 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 03:58:18,121 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 03:58:18,121 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 03:58:18,122 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,122 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2019-11-07 03:58:18,122 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,122 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,122 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-07 03:58:18,122 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-07 03:58:18,122 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-07 03:58:18,123 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,123 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,123 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,123 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2019-11-07 03:58:18,123 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-07 03:58:18,123 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-07 03:58:18,123 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2019-11-07 03:58:18,123 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-11-07 03:58:18,124 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,124 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-11-07 03:58:18,124 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,124 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-11-07 03:58:18,124 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-07 03:58:18,124 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-07 03:58:18,124 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,124 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,125 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-11-07 03:58:18,125 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-07 03:58:18,125 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-07 03:58:18,125 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-07 03:58:18,125 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-11-07 03:58:18,125 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,125 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-11-07 03:58:18,125 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-07 03:58:18,126 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-07 03:58:18,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:58:18 BoogieIcfgContainer [2019-11-07 03:58:18,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 03:58:18,140 INFO L168 Benchmark]: Toolchain (without parser) took 2932.44 ms. Allocated memory was 138.9 MB in the beginning and 235.4 MB in the end (delta: 96.5 MB). Free memory was 104.2 MB in the beginning and 125.7 MB in the end (delta: -21.6 MB). Peak memory consumption was 74.9 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:18,141 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 03:58:18,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.49 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 103.9 MB in the beginning and 181.0 MB in the end (delta: -77.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:18,148 INFO L168 Benchmark]: Boogie Preprocessor took 38.79 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 178.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:18,149 INFO L168 Benchmark]: RCFGBuilder took 683.52 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 137.6 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:18,150 INFO L168 Benchmark]: TraceAbstraction took 1756.89 ms. Allocated memory was 201.9 MB in the beginning and 235.4 MB in the end (delta: 33.6 MB). Free memory was 137.0 MB in the beginning and 125.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:18,161 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 444.49 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 103.9 MB in the beginning and 181.0 MB in the end (delta: -77.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.79 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 178.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 683.52 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 137.6 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1756.89 ms. Allocated memory was 201.9 MB in the beginning and 235.4 MB in the end (delta: 33.6 MB). Free memory was 137.0 MB in the beginning and 125.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 578 SDtfs, 446 SDslu, 829 SDs, 0 SdLazy, 108 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 12 MinimizatonAttempts, 176 StatesRemovedByMinimization, 11 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.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 10658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...