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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:27:53,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:27:53,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:27:53,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:27:53,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:27:53,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:27:53,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:27:53,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:27:53,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:27:53,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:27:53,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:27:53,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:27:53,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:27:53,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:27:53,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:27:53,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:27:53,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:27:53,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:27:53,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:27:53,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:27:53,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:27:53,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:27:53,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:27:53,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:27:53,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:27:53,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:27:53,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:27:53,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:27:53,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:27:53,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:27:53,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:27:53,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:27:53,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:27:53,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:27:53,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:27:53,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:27:53,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:27:53,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:27:53,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:27:53,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:27:53,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:27:53,302 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:27:53,338 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:27:53,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:27:53,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:27:53,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:27:53,340 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:27:53,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:27:53,342 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:27:53,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:27:53,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:27:53,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:27:53,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:27:53,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:27:53,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:27:53,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:27:53,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:27:53,344 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:27:53,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:27:53,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:27:53,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:27:53,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:27:53,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:27:53,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:53,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:27:53,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:27:53,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:27:53,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:27:53,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:27:53,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:27:53,348 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:27:53,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:27:53,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:27:53,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:27:53,699 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:27:53,700 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:27:53,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c [2019-10-15 01:27:53,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e836595/9d392625227844d1a117877d37deac16/FLAG5e1dc38ff [2019-10-15 01:27:54,288 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:27:54,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1a.cil.c [2019-10-15 01:27:54,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e836595/9d392625227844d1a117877d37deac16/FLAG5e1dc38ff [2019-10-15 01:27:54,701 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e836595/9d392625227844d1a117877d37deac16 [2019-10-15 01:27:54,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:27:54,712 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:27:54,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:54,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:27:54,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:27:54,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:54" (1/1) ... [2019-10-15 01:27:54,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50568491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:54, skipping insertion in model container [2019-10-15 01:27:54,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:54" (1/1) ... [2019-10-15 01:27:54,727 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:27:54,751 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:27:54,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:54,950 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:27:54,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:55,085 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:27:55,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:55 WrapperNode [2019-10-15 01:27:55,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:55,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:27:55,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:27:55,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:27:55,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:55" (1/1) ... [2019-10-15 01:27:55,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:55" (1/1) ... [2019-10-15 01:27:55,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:55" (1/1) ... [2019-10-15 01:27:55,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:55" (1/1) ... [2019-10-15 01:27:55,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:55" (1/1) ... [2019-10-15 01:27:55,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:55" (1/1) ... [2019-10-15 01:27:55,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:55" (1/1) ... [2019-10-15 01:27:55,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:27:55,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:27:55,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:27:55,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:27:55,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:55" (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:27:55,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:27:55,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:27:55,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:27:55,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:27:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:27:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:27:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:27:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:27:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:27:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:27:55,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:27:55,570 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:27:55,570 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:27:55,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:55 BoogieIcfgContainer [2019-10-15 01:27:55,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:27:55,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:27:55,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:27:55,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:27:55,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:27:54" (1/3) ... [2019-10-15 01:27:55,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e848400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:55, skipping insertion in model container [2019-10-15 01:27:55,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:55" (2/3) ... [2019-10-15 01:27:55,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e848400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:55, skipping insertion in model container [2019-10-15 01:27:55,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:55" (3/3) ... [2019-10-15 01:27:55,581 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2019-10-15 01:27:55,591 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:27:55,598 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:27:55,608 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:27:55,645 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:27:55,645 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:27:55,648 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:27:55,648 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:27:55,648 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:27:55,648 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:27:55,648 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:27:55,649 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:27:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-10-15 01:27:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-15 01:27:55,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:55,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:55,680 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:55,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:55,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2008919768, now seen corresponding path program 1 times [2019-10-15 01:27:55,692 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:55,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489585471] [2019-10-15 01:27:55,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:55,820 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:27:55,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489585471] [2019-10-15 01:27:55,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:55,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:55,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796279672] [2019-10-15 01:27:55,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:55,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:55,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:55,847 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-10-15 01:27:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:55,981 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2019-10-15 01:27:55,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:55,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-15 01:27:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:55,996 INFO L225 Difference]: With dead ends: 136 [2019-10-15 01:27:55,997 INFO L226 Difference]: Without dead ends: 83 [2019-10-15 01:27:56,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:27:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-15 01:27:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-15 01:27:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-15 01:27:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2019-10-15 01:27:56,055 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 8 [2019-10-15 01:27:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,056 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2019-10-15 01:27:56,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2019-10-15 01:27:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:27:56,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,058 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:56,058 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2066454160, now seen corresponding path program 1 times [2019-10-15 01:27:56,059 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622281373] [2019-10-15 01:27:56,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:56,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622281373] [2019-10-15 01:27:56,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:56,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883029645] [2019-10-15 01:27:56,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:56,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:56,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:56,096 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand 3 states. [2019-10-15 01:27:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,180 INFO L93 Difference]: Finished difference Result 161 states and 253 transitions. [2019-10-15 01:27:56,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:56,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-15 01:27:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,184 INFO L225 Difference]: With dead ends: 161 [2019-10-15 01:27:56,184 INFO L226 Difference]: Without dead ends: 121 [2019-10-15 01:27:56,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:27:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-15 01:27:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-10-15 01:27:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-15 01:27:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2019-10-15 01:27:56,208 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 13 [2019-10-15 01:27:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,208 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2019-10-15 01:27:56,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2019-10-15 01:27:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:27:56,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,210 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:56,211 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1216248382, now seen corresponding path program 1 times [2019-10-15 01:27:56,212 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550455425] [2019-10-15 01:27:56,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:27:56,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550455425] [2019-10-15 01:27:56,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:56,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995031377] [2019-10-15 01:27:56,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:56,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:56,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:56,256 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand 3 states. [2019-10-15 01:27:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,368 INFO L93 Difference]: Finished difference Result 237 states and 369 transitions. [2019-10-15 01:27:56,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:56,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:27:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,372 INFO L225 Difference]: With dead ends: 237 [2019-10-15 01:27:56,372 INFO L226 Difference]: Without dead ends: 159 [2019-10-15 01:27:56,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:27:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-15 01:27:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-10-15 01:27:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-15 01:27:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 243 transitions. [2019-10-15 01:27:56,421 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 243 transitions. Word has length 19 [2019-10-15 01:27:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,422 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 243 transitions. [2019-10-15 01:27:56,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2019-10-15 01:27:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 01:27:56,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,424 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-10-15 01:27:56,425 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1623728883, now seen corresponding path program 1 times [2019-10-15 01:27:56,425 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20650589] [2019-10-15 01:27:56,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:27:56,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20650589] [2019-10-15 01:27:56,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:56,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395370828] [2019-10-15 01:27:56,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:56,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:56,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:56,474 INFO L87 Difference]: Start difference. First operand 159 states and 243 transitions. Second operand 3 states. [2019-10-15 01:27:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,645 INFO L93 Difference]: Finished difference Result 371 states and 583 transitions. [2019-10-15 01:27:56,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:56,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-15 01:27:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,650 INFO L225 Difference]: With dead ends: 371 [2019-10-15 01:27:56,651 INFO L226 Difference]: Without dead ends: 217 [2019-10-15 01:27:56,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:27:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-15 01:27:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2019-10-15 01:27:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-15 01:27:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 295 transitions. [2019-10-15 01:27:56,686 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 295 transitions. Word has length 34 [2019-10-15 01:27:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,687 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 295 transitions. [2019-10-15 01:27:56,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 295 transitions. [2019-10-15 01:27:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:27:56,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,690 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-10-15 01:27:56,690 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1694730092, now seen corresponding path program 1 times [2019-10-15 01:27:56,691 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678597263] [2019-10-15 01:27:56,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:27:56,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678597263] [2019-10-15 01:27:56,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:56,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825871397] [2019-10-15 01:27:56,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:56,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:56,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:56,754 INFO L87 Difference]: Start difference. First operand 211 states and 295 transitions. Second operand 3 states. [2019-10-15 01:27:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,829 INFO L93 Difference]: Finished difference Result 419 states and 592 transitions. [2019-10-15 01:27:56,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:56,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-15 01:27:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,832 INFO L225 Difference]: With dead ends: 419 [2019-10-15 01:27:56,833 INFO L226 Difference]: Without dead ends: 264 [2019-10-15 01:27:56,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:27:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-15 01:27:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-15 01:27:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-15 01:27:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2019-10-15 01:27:56,853 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 48 [2019-10-15 01:27:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,853 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2019-10-15 01:27:56,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:56,854 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2019-10-15 01:27:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:27:56,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,857 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 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] [2019-10-15 01:27:56,857 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 365198397, now seen corresponding path program 1 times [2019-10-15 01:27:56,858 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147920598] [2019-10-15 01:27:56,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:27:56,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147920598] [2019-10-15 01:27:56,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:56,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023507759] [2019-10-15 01:27:56,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:56,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:56,903 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 3 states. [2019-10-15 01:27:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:57,008 INFO L93 Difference]: Finished difference Result 527 states and 756 transitions. [2019-10-15 01:27:57,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:57,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-15 01:27:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:57,012 INFO L225 Difference]: With dead ends: 527 [2019-10-15 01:27:57,013 INFO L226 Difference]: Without dead ends: 192 [2019-10-15 01:27:57,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:27:57,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-15 01:27:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-10-15 01:27:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-15 01:27:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2019-10-15 01:27:57,026 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 51 [2019-10-15 01:27:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:57,027 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2019-10-15 01:27:57,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2019-10-15 01:27:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-15 01:27:57,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:57,031 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 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:27:57,031 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1939547864, now seen corresponding path program 1 times [2019-10-15 01:27:57,031 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:57,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541256580] [2019-10-15 01:27:57,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-15 01:27:57,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541256580] [2019-10-15 01:27:57,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:57,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:57,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227220365] [2019-10-15 01:27:57,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:57,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:57,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:57,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:57,104 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2019-10-15 01:27:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:57,120 INFO L93 Difference]: Finished difference Result 310 states and 379 transitions. [2019-10-15 01:27:57,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:57,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-15 01:27:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:57,121 INFO L225 Difference]: With dead ends: 310 [2019-10-15 01:27:57,121 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:27:57,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:27:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:27:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:27:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:27:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:27:57,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2019-10-15 01:27:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:57,123 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:27:57,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:27:57,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:27:57,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:27:57,379 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:27:57,380 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:27:57,380 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:27:57,380 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:27:57,380 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:27:57,380 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:27:57,380 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 216) no Hoare annotation was computed. [2019-10-15 01:27:57,380 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 218) no Hoare annotation was computed. [2019-10-15 01:27:57,380 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 186) no Hoare annotation was computed. [2019-10-15 01:27:57,381 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 190) no Hoare annotation was computed. [2019-10-15 01:27:57,381 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 75 184) no Hoare annotation was computed. [2019-10-15 01:27:57,381 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 194) no Hoare annotation was computed. [2019-10-15 01:27:57,381 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 75 184) no Hoare annotation was computed. [2019-10-15 01:27:57,381 INFO L439 ceAbstractionStarter]: At program point L177(lines 23 212) the Hoare annotation is: (let ((.cse0 (<= main_~blastFlag~0 3))) (or (and (<= 8640 main_~s__state~0) .cse0 (not (= 0 main_~s__hit~0))) (<= main_~blastFlag~0 2) (and .cse0 (<= 8672 main_~s__state~0)))) [2019-10-15 01:27:57,381 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 198) no Hoare annotation was computed. [2019-10-15 01:27:57,381 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 140) no Hoare annotation was computed. [2019-10-15 01:27:57,382 INFO L439 ceAbstractionStarter]: At program point L70(lines 69 186) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2019-10-15 01:27:57,382 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 202) no Hoare annotation was computed. [2019-10-15 01:27:57,382 INFO L439 ceAbstractionStarter]: At program point L62(lines 61 190) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,382 INFO L439 ceAbstractionStarter]: At program point L54(lines 53 194) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,382 INFO L439 ceAbstractionStarter]: At program point L46(lines 45 198) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,382 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 79 81) no Hoare annotation was computed. [2019-10-15 01:27:57,383 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 218) no Hoare annotation was computed. [2019-10-15 01:27:57,383 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 75 184) no Hoare annotation was computed. [2019-10-15 01:27:57,383 INFO L439 ceAbstractionStarter]: At program point L38(lines 37 202) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,383 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 205) no Hoare annotation was computed. [2019-10-15 01:27:57,383 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 218) the Hoare annotation is: true [2019-10-15 01:27:57,383 INFO L439 ceAbstractionStarter]: At program point L121(lines 114 123) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,384 INFO L439 ceAbstractionStarter]: At program point L113(lines 106 124) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,384 INFO L443 ceAbstractionStarter]: For program point L163-1(lines 163 165) no Hoare annotation was computed. [2019-10-15 01:27:57,384 INFO L439 ceAbstractionStarter]: At program point L31(lines 30 205) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,384 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 124) no Hoare annotation was computed. [2019-10-15 01:27:57,384 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 184) no Hoare annotation was computed. [2019-10-15 01:27:57,385 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 188) no Hoare annotation was computed. [2019-10-15 01:27:57,385 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 192) no Hoare annotation was computed. [2019-10-15 01:27:57,385 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-10-15 01:27:57,385 INFO L446 ceAbstractionStarter]: At program point L214(lines 9 218) the Hoare annotation is: true [2019-10-15 01:27:57,385 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2019-10-15 01:27:57,385 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 196) no Hoare annotation was computed. [2019-10-15 01:27:57,385 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 175) no Hoare annotation was computed. [2019-10-15 01:27:57,386 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-10-15 01:27:57,386 INFO L439 ceAbstractionStarter]: At program point L74(lines 73 184) the Hoare annotation is: (and (<= main_~blastFlag~0 3) (<= 8672 main_~s__state~0)) [2019-10-15 01:27:57,386 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 200) no Hoare annotation was computed. [2019-10-15 01:27:57,386 INFO L439 ceAbstractionStarter]: At program point L66(lines 65 188) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2019-10-15 01:27:57,386 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 204) no Hoare annotation was computed. [2019-10-15 01:27:57,387 INFO L439 ceAbstractionStarter]: At program point L58(lines 57 192) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,387 INFO L439 ceAbstractionStarter]: At program point L50(lines 49 196) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,387 INFO L439 ceAbstractionStarter]: At program point L174(lines 9 218) the Hoare annotation is: false [2019-10-15 01:27:57,387 INFO L439 ceAbstractionStarter]: At program point L42(lines 41 200) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,387 INFO L439 ceAbstractionStarter]: At program point L34(lines 33 204) the Hoare annotation is: (<= main_~blastFlag~0 2) [2019-10-15 01:27:57,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:27:57 BoogieIcfgContainer [2019-10-15 01:27:57,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:27:57,410 INFO L168 Benchmark]: Toolchain (without parser) took 2696.87 ms. Allocated memory was 142.6 MB in the beginning and 233.3 MB in the end (delta: 90.7 MB). Free memory was 100.6 MB in the beginning and 110.0 MB in the end (delta: -9.4 MB). Peak memory consumption was 81.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:27:57,410 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.6 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 01:27:57,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.73 ms. Allocated memory was 142.6 MB in the beginning and 201.3 MB in the end (delta: 58.7 MB). Free memory was 100.2 MB in the beginning and 180.2 MB in the end (delta: -80.0 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:27:57,413 INFO L168 Benchmark]: Boogie Preprocessor took 41.96 ms. Allocated memory is still 201.3 MB. Free memory was 180.2 MB in the beginning and 177.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:27:57,414 INFO L168 Benchmark]: RCFGBuilder took 444.11 ms. Allocated memory is still 201.3 MB. Free memory was 177.9 MB in the beginning and 159.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:27:57,415 INFO L168 Benchmark]: TraceAbstraction took 1832.34 ms. Allocated memory was 201.3 MB in the beginning and 233.3 MB in the end (delta: 32.0 MB). Free memory was 159.4 MB in the beginning and 110.0 MB in the end (delta: 49.4 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:27:57,418 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.21 ms. Allocated memory is still 142.6 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 373.73 ms. Allocated memory was 142.6 MB in the beginning and 201.3 MB in the end (delta: 58.7 MB). Free memory was 100.2 MB in the beginning and 180.2 MB in the end (delta: -80.0 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.96 ms. Allocated memory is still 201.3 MB. Free memory was 180.2 MB in the beginning and 177.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 444.11 ms. Allocated memory is still 201.3 MB. Free memory was 177.9 MB in the beginning and 159.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1832.34 ms. Allocated memory was 201.3 MB in the beginning and 233.3 MB in the end (delta: 32.0 MB). Free memory was 159.4 MB in the beginning and 110.0 MB in the end (delta: 49.4 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 216]: 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: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || blastFlag <= 2) || (blastFlag <= 3 && 8672 <= s__state) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: blastFlag <= 3 && 8672 <= s__state - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 7, TraceHistogramMax: 6, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 457 SDtfs, 250 SDslu, 321 SDs, 0 SdLazy, 196 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=5, 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, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 86 NumberOfFragments, 106 HoareAnnotationTreeSize, 21 FomulaSimplifications, 585 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 25301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 202/202 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...