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/eca-rers2012/Problem01_label03.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:39:04,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:39:04,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:39:04,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:39:04,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:39:04,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:39:04,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:39:04,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:39:04,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:39:04,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:39:04,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:39:04,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:39:04,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:39:04,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:39:04,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:39:04,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:39:04,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:39:04,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:39:04,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:39:04,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:39:04,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:39:04,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:39:04,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:39:04,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:39:04,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:39:04,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:39:04,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:39:04,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:39:04,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:39:04,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:39:04,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:39:04,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:39:04,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:39:04,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:39:04,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:39:04,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:39:04,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:39:04,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:39:04,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:39:04,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:39:04,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:39:04,618 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-15 01:39:04,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:39:04,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:39:04,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:39:04,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:39:04,637 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:39:04,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:39:04,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:39:04,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:39:04,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:39:04,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:39:04,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:39:04,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:39:04,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:39:04,639 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:39:04,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:39:04,639 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:39:04,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:39:04,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:39:04,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:39:04,640 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:39:04,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:39:04,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:39:04,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:39:04,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:39:04,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:39:04,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:39:04,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:39:04,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:39:04,642 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-15 01:39:04,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:39:04,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:39:04,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:39:04,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:39:04,949 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:39:04,950 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label03.c [2019-10-15 01:39:05,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3681cb6d9/f84560396950480895f1e7c158db1755/FLAG33901f266 [2019-10-15 01:39:05,631 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:39:05,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label03.c [2019-10-15 01:39:05,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3681cb6d9/f84560396950480895f1e7c158db1755/FLAG33901f266 [2019-10-15 01:39:05,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3681cb6d9/f84560396950480895f1e7c158db1755 [2019-10-15 01:39:05,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:39:05,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:39:05,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:39:05,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:39:05,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:39:05,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:39:05" (1/1) ... [2019-10-15 01:39:05,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa59c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:05, skipping insertion in model container [2019-10-15 01:39:05,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:39:05" (1/1) ... [2019-10-15 01:39:05,910 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:39:05,966 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:39:06,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:39:06,509 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:39:06,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:39:06,681 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:39:06,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:06 WrapperNode [2019-10-15 01:39:06,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:39:06,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:39:06,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:39:06,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:39:06,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:06" (1/1) ... [2019-10-15 01:39:06,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:06" (1/1) ... [2019-10-15 01:39:06,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:06" (1/1) ... [2019-10-15 01:39:06,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:06" (1/1) ... [2019-10-15 01:39:06,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:06" (1/1) ... [2019-10-15 01:39:06,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:06" (1/1) ... [2019-10-15 01:39:06,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:06" (1/1) ... [2019-10-15 01:39:06,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:39:06,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:39:06,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:39:06,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:39:06,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:06" (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-15 01:39:06,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:39:06,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:39:06,917 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 01:39:06,918 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:39:06,918 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 01:39:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:39:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:39:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:39:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:39:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:39:06,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:39:08,838 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:39:08,839 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:39:08,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:39:08 BoogieIcfgContainer [2019-10-15 01:39:08,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:39:08,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:39:08,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:39:08,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:39:08,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:39:05" (1/3) ... [2019-10-15 01:39:08,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537a5b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:39:08, skipping insertion in model container [2019-10-15 01:39:08,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:39:06" (2/3) ... [2019-10-15 01:39:08,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537a5b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:39:08, skipping insertion in model container [2019-10-15 01:39:08,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:39:08" (3/3) ... [2019-10-15 01:39:08,852 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label03.c [2019-10-15 01:39:08,862 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:39:08,870 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:39:08,881 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:39:08,907 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:39:08,907 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:39:08,907 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:39:08,907 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:39:08,908 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:39:08,908 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:39:08,908 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:39:08,908 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:39:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-10-15 01:39:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:39:08,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:39:08,939 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:39:08,941 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:39:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:39:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -281988410, now seen corresponding path program 1 times [2019-10-15 01:39:08,956 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:39:08,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118806192] [2019-10-15 01:39:08,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:08,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:08,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:39:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:39:09,382 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-15 01:39:09,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118806192] [2019-10-15 01:39:09,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:39:09,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:39:09,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419314024] [2019-10-15 01:39:09,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:39:09,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:39:09,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:39:09,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:39:09,407 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 4 states. [2019-10-15 01:39:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:39:10,198 INFO L93 Difference]: Finished difference Result 325 states and 606 transitions. [2019-10-15 01:39:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:39:10,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-15 01:39:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:39:10,217 INFO L225 Difference]: With dead ends: 325 [2019-10-15 01:39:10,217 INFO L226 Difference]: Without dead ends: 232 [2019-10-15 01:39:10,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-15 01:39:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-15 01:39:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 157. [2019-10-15 01:39:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-15 01:39:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2019-10-15 01:39:10,283 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 77 [2019-10-15 01:39:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:39:10,284 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2019-10-15 01:39:10,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:39:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2019-10-15 01:39:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-15 01:39:10,289 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:39:10,289 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:39:10,289 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:39:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:39:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1931111197, now seen corresponding path program 1 times [2019-10-15 01:39:10,290 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:39:10,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047673017] [2019-10-15 01:39:10,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:10,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:10,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:39:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:39:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:39:10,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047673017] [2019-10-15 01:39:10,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:39:10,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:39:10,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493610440] [2019-10-15 01:39:10,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:39:10,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:39:10,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:39:10,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:39:10,408 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 6 states. [2019-10-15 01:39:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:39:10,981 INFO L93 Difference]: Finished difference Result 479 states and 882 transitions. [2019-10-15 01:39:10,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:39:10,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-15 01:39:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:39:10,989 INFO L225 Difference]: With dead ends: 479 [2019-10-15 01:39:10,990 INFO L226 Difference]: Without dead ends: 327 [2019-10-15 01:39:10,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:39:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-15 01:39:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 315. [2019-10-15 01:39:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-15 01:39:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 558 transitions. [2019-10-15 01:39:11,033 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 558 transitions. Word has length 87 [2019-10-15 01:39:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:39:11,034 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 558 transitions. [2019-10-15 01:39:11,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:39:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 558 transitions. [2019-10-15 01:39:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 01:39:11,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:39:11,038 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:39:11,039 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:39:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:39:11,039 INFO L82 PathProgramCache]: Analyzing trace with hash 311940311, now seen corresponding path program 1 times [2019-10-15 01:39:11,039 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:39:11,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163465639] [2019-10-15 01:39:11,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:11,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:11,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:39:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:39:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:39:11,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163465639] [2019-10-15 01:39:11,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:39:11,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:39:11,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666860283] [2019-10-15 01:39:11,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:39:11,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:39:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:39:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:39:11,170 INFO L87 Difference]: Start difference. First operand 315 states and 558 transitions. Second operand 4 states. [2019-10-15 01:39:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:39:11,821 INFO L93 Difference]: Finished difference Result 775 states and 1399 transitions. [2019-10-15 01:39:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:39:11,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-15 01:39:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:39:11,830 INFO L225 Difference]: With dead ends: 775 [2019-10-15 01:39:11,831 INFO L226 Difference]: Without dead ends: 465 [2019-10-15 01:39:11,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-15 01:39:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-15 01:39:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2019-10-15 01:39:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-10-15 01:39:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 761 transitions. [2019-10-15 01:39:11,906 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 761 transitions. Word has length 88 [2019-10-15 01:39:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:39:11,906 INFO L462 AbstractCegarLoop]: Abstraction has 465 states and 761 transitions. [2019-10-15 01:39:11,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:39:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 761 transitions. [2019-10-15 01:39:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:39:11,913 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:39:11,913 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:39:11,913 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:39:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:39:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1766793137, now seen corresponding path program 1 times [2019-10-15 01:39:11,914 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:39:11,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584304913] [2019-10-15 01:39:11,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:11,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:11,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:39:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:39:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:39:12,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584304913] [2019-10-15 01:39:12,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:39:12,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:39:12,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510180390] [2019-10-15 01:39:12,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:39:12,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:39:12,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:39:12,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:39:12,111 INFO L87 Difference]: Start difference. First operand 465 states and 761 transitions. Second operand 3 states. [2019-10-15 01:39:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:39:12,607 INFO L93 Difference]: Finished difference Result 1150 states and 1923 transitions. [2019-10-15 01:39:12,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:39:12,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-15 01:39:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:39:12,619 INFO L225 Difference]: With dead ends: 1150 [2019-10-15 01:39:12,619 INFO L226 Difference]: Without dead ends: 690 [2019-10-15 01:39:12,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:39:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-15 01:39:12,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-10-15 01:39:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-10-15 01:39:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1044 transitions. [2019-10-15 01:39:12,652 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1044 transitions. Word has length 92 [2019-10-15 01:39:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:39:12,652 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 1044 transitions. [2019-10-15 01:39:12,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:39:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1044 transitions. [2019-10-15 01:39:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:39:12,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:39:12,660 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:39:12,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:39:12,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:39:12,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1472447469, now seen corresponding path program 1 times [2019-10-15 01:39:12,661 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:39:12,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566012197] [2019-10-15 01:39:12,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:12,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:39:12,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:39:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:39:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:39:12,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566012197] [2019-10-15 01:39:12,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:39:12,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:39:12,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441321990] [2019-10-15 01:39:12,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:39:12,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:39:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:39:12,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:39:12,781 INFO L87 Difference]: Start difference. First operand 688 states and 1044 transitions. Second operand 3 states. [2019-10-15 01:39:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:39:13,142 INFO L93 Difference]: Finished difference Result 1521 states and 2345 transitions. [2019-10-15 01:39:13,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:39:13,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-15 01:39:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:39:13,143 INFO L225 Difference]: With dead ends: 1521 [2019-10-15 01:39:13,143 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:39:13,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:39:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:39:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:39:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:39:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:39:13,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2019-10-15 01:39:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:39:13,149 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:39:13,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:39:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:39:13,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:39:13,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:39:13,492 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-10-15 01:39:13,596 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~a16~0 |old(~a16~0)|) [2019-10-15 01:39:13,596 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:39:13,596 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-15 01:39:13,597 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-15 01:39:13,597 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-15 01:39:13,597 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-15 01:39:13,597 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-15 01:39:13,597 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-15 01:39:13,597 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-15 01:39:13,597 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-15 01:39:13,597 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-15 01:39:13,598 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-15 01:39:13,598 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-15 01:39:13,598 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-15 01:39:13,598 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-15 01:39:13,598 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-15 01:39:13,598 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-15 01:39:13,598 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-15 01:39:13,599 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 563) no Hoare annotation was computed. [2019-10-15 01:39:13,599 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-15 01:39:13,599 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-15 01:39:13,599 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-15 01:39:13,599 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-15 01:39:13,599 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-15 01:39:13,600 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-15 01:39:13,600 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-15 01:39:13,600 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-15 01:39:13,600 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-15 01:39:13,600 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-15 01:39:13,600 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-15 01:39:13,600 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-15 01:39:13,601 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-15 01:39:13,601 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:39:13,601 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:39:13,601 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-15 01:39:13,601 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-15 01:39:13,601 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-15 01:39:13,601 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-15 01:39:13,601 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-15 01:39:13,602 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-15 01:39:13,602 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-15 01:39:13,602 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-15 01:39:13,602 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-15 01:39:13,602 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-15 01:39:13,602 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-15 01:39:13,602 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-15 01:39:13,603 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-15 01:39:13,603 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-15 01:39:13,603 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-15 01:39:13,603 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-15 01:39:13,603 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-15 01:39:13,603 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse0 (or (not (= 1 ~a7~0)) (not (= ~a20~0 ~a7~0)))) (.cse2 (and (= |old(~a7~0)| |old(~a20~0)|) (= 1 |old(~a20~0)|))) (.cse3 (= ~a16~0 |old(~a16~0)|)) (.cse4 (not (= ~a8~0 13))) (.cse1 (= 13 |old(~a8~0)|))) (and (or .cse0 .cse1 .cse2) (or (= 5 |old(~a16~0)|) (and .cse3 .cse0) .cse2) (or .cse4 .cse1 .cse2) (or (and (not (= ~a21~0 1)) .cse3) (= 1 |old(~a21~0)|)) (or .cse3 (not (= 4 |old(~a16~0)|))) (or (= 6 |old(~a16~0)|) (and .cse3 .cse4) .cse1))) [2019-10-15 01:39:13,604 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-15 01:39:13,604 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-15 01:39:13,604 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-15 01:39:13,604 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-15 01:39:13,604 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-15 01:39:13,604 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-15 01:39:13,604 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-15 01:39:13,605 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:39:13,605 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-15 01:39:13,605 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-15 01:39:13,605 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-15 01:39:13,605 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-15 01:39:13,605 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-15 01:39:13,605 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-15 01:39:13,606 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-15 01:39:13,606 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-15 01:39:13,606 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-15 01:39:13,606 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-15 01:39:13,606 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-15 01:39:13,606 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-15 01:39:13,606 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-15 01:39:13,607 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-15 01:39:13,607 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-15 01:39:13,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:39:13,607 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 6)) (not (= ~a20~0 ~a7~0)) (not (= ~a8~0 13))) [2019-10-15 01:39:13,607 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:39:13,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:39:13,608 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (= 13 |old(~a8~0)|) (and (= ~a16~0 |old(~a16~0)|) (not (= ~a20~0 ~a7~0)) (not (= ~a8~0 13))) (= |old(~a7~0)| |old(~a20~0)|)) [2019-10-15 01:39:13,608 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-15 01:39:13,608 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (= ~a16~0 4) (= 6 |old(~a16~0)|) (and (not (= ~a16~0 6)) (not (= ~a8~0 13))) (not (= ~a21~0 1)) (= 13 |old(~a8~0)|) (= |old(~a7~0)| |old(~a20~0)|) (and (not (= ~a16~0 5)) (or (not (= 1 ~a7~0)) (not (= ~a20~0 ~a7~0))))) [2019-10-15 01:39:13,608 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-15 01:39:13,608 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-15 01:39:13,608 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (or (= ~a16~0 4) (= 6 |old(~a16~0)|) (and (not (= ~a16~0 6)) (not (= ~a8~0 13))) (not (= ~a21~0 1)) (= 13 |old(~a8~0)|) (= |old(~a7~0)| |old(~a20~0)|) (and (not (= ~a16~0 5)) (or (not (= 1 ~a7~0)) (not (= ~a20~0 ~a7~0))))) [2019-10-15 01:39:13,609 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-15 01:39:13,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:39:13 BoogieIcfgContainer [2019-10-15 01:39:13,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:39:13,629 INFO L168 Benchmark]: Toolchain (without parser) took 7736.68 ms. Allocated memory was 144.7 MB in the beginning and 327.2 MB in the end (delta: 182.5 MB). Free memory was 99.6 MB in the beginning and 246.6 MB in the end (delta: -147.0 MB). Peak memory consumption was 160.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:39:13,630 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:39:13,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.82 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 99.4 MB in the beginning and 170.2 MB in the end (delta: -70.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:39:13,632 INFO L168 Benchmark]: Boogie Preprocessor took 161.87 ms. Allocated memory is still 204.5 MB. Free memory was 170.2 MB in the beginning and 165.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:39:13,633 INFO L168 Benchmark]: RCFGBuilder took 1998.53 ms. Allocated memory was 204.5 MB in the beginning and 251.1 MB in the end (delta: 46.7 MB). Free memory was 165.3 MB in the beginning and 212.1 MB in the end (delta: -46.8 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:39:13,634 INFO L168 Benchmark]: TraceAbstraction took 4782.43 ms. Allocated memory was 251.1 MB in the beginning and 327.2 MB in the end (delta: 76.0 MB). Free memory was 212.1 MB in the beginning and 246.6 MB in the end (delta: -34.5 MB). Peak memory consumption was 166.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:39:13,638 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.24 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.82 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 99.4 MB in the beginning and 170.2 MB in the end (delta: -70.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.87 ms. Allocated memory is still 204.5 MB. Free memory was 170.2 MB in the beginning and 165.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1998.53 ms. Allocated memory was 204.5 MB in the beginning and 251.1 MB in the end (delta: 46.7 MB). Free memory was 165.3 MB in the beginning and 212.1 MB in the end (delta: -46.8 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4782.43 ms. Allocated memory was 251.1 MB in the beginning and 327.2 MB in the end (delta: 76.0 MB). Free memory was 212.1 MB in the beginning and 246.6 MB in the end (delta: -34.5 MB). Peak memory consumption was 166.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 563]: 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: 583]: Loop Invariant Derived loop invariant: (((((a16 == 4 || 6 == \old(a16)) || (!(a16 == 6) && !(a8 == 13))) || !(a21 == 1)) || 13 == \old(a8)) || \old(a7) == \old(a20)) || (!(a16 == 5) && (!(1 == a7) || !(a20 == a7))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Result: SAFE, OverallTime: 4.7s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 382 SDtfs, 516 SDslu, 110 SDs, 0 SdLazy, 1592 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=688occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 89 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 39 PreInvPairs, 61 NumberOfFragments, 214 HoareAnnotationTreeSize, 39 FomulaSimplifications, 510 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 317 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 149754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 58/58 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...