/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy CAMEL_NO_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-19 21:27:50,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 21:27:50,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 21:27:50,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 21:27:50,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 21:27:50,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 21:27:50,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 21:27:50,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 21:27:50,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 21:27:50,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 21:27:50,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 21:27:50,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 21:27:50,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 21:27:50,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 21:27:50,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 21:27:50,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 21:27:50,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 21:27:50,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 21:27:50,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 21:27:50,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 21:27:50,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 21:27:50,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 21:27:50,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 21:27:50,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 21:27:50,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 21:27:50,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 21:27:50,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 21:27:50,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 21:27:50,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 21:27:50,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 21:27:50,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 21:27:50,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 21:27:50,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 21:27:50,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 21:27:50,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 21:27:50,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 21:27:50,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 21:27:50,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 21:27:50,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 21:27:50,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 21:27:50,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 21:27:50,546 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 [2020-07-19 21:27:50,567 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 21:27:50,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 21:27:50,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 21:27:50,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 21:27:50,569 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 21:27:50,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 21:27:50,570 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 21:27:50,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 21:27:50,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 21:27:50,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 21:27:50,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 21:27:50,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 21:27:50,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 21:27:50,571 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 21:27:50,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 21:27:50,572 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 21:27:50,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 21:27:50,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 21:27:50,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 21:27:50,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 21:27:50,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 21:27:50,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 21:27:50,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 21:27:50,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 21:27:50,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 21:27:50,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 21:27:50,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 21:27:50,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 21:27:50,575 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 21:27:50,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_NO_AM [2020-07-19 21:27:50,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 21:27:51,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 21:27:51,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 21:27:51,014 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 21:27:51,015 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 21:27:51,016 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-19 21:27:51,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6beef86d/d5439ff28ea9443ba31ae34ebfca4e6d/FLAGcc268f3cf [2020-07-19 21:27:51,704 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 21:27:51,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-19 21:27:51,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6beef86d/d5439ff28ea9443ba31ae34ebfca4e6d/FLAGcc268f3cf [2020-07-19 21:27:52,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6beef86d/d5439ff28ea9443ba31ae34ebfca4e6d [2020-07-19 21:27:52,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 21:27:52,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 21:27:52,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 21:27:52,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 21:27:52,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 21:27:52,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:27:52" (1/1) ... [2020-07-19 21:27:52,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129a213e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52, skipping insertion in model container [2020-07-19 21:27:52,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:27:52" (1/1) ... [2020-07-19 21:27:52,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 21:27:52,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 21:27:52,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:27:52,335 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 21:27:52,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:27:52,377 INFO L208 MainTranslator]: Completed translation [2020-07-19 21:27:52,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52 WrapperNode [2020-07-19 21:27:52,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 21:27:52,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 21:27:52,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 21:27:52,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 21:27:52,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52" (1/1) ... [2020-07-19 21:27:52,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52" (1/1) ... [2020-07-19 21:27:52,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52" (1/1) ... [2020-07-19 21:27:52,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52" (1/1) ... [2020-07-19 21:27:52,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52" (1/1) ... [2020-07-19 21:27:52,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52" (1/1) ... [2020-07-19 21:27:52,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52" (1/1) ... [2020-07-19 21:27:52,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 21:27:52,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 21:27:52,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 21:27:52,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 21:27:52,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52" (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 [2020-07-19 21:27:52,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 21:27:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 21:27:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-19 21:27:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 21:27:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-19 21:27:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 21:27:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-19 21:27:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 21:27:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 21:27:52,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 21:27:52,809 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 21:27:52,809 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-19 21:27:52,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:27:52 BoogieIcfgContainer [2020-07-19 21:27:52,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 21:27:52,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 21:27:52,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 21:27:52,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 21:27:52,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:27:52" (1/3) ... [2020-07-19 21:27:52,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4de96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:27:52, skipping insertion in model container [2020-07-19 21:27:52,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:52" (2/3) ... [2020-07-19 21:27:52,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4de96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:27:52, skipping insertion in model container [2020-07-19 21:27:52,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:27:52" (3/3) ... [2020-07-19 21:27:52,834 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-07-19 21:27:52,849 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 21:27:52,865 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-19 21:27:52,884 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-19 21:27:52,920 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 21:27:52,920 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 21:27:52,922 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 21:27:52,922 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 21:27:52,922 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 21:27:52,922 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 21:27:52,923 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 21:27:52,923 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 21:27:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-19 21:27:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-19 21:27:52,966 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:52,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:52,968 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-19 21:27:52,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:52,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077287044] [2020-07-19 21:27:52,991 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 [2020-07-19 21:27:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:27:53,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077287044] [2020-07-19 21:27:53,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:27:53,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 21:27:53,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519887515] [2020-07-19 21:27:53,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 21:27:53,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 21:27:53,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:27:53,265 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-19 21:27:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:53,392 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-19 21:27:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 21:27:53,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-19 21:27:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:53,412 INFO L225 Difference]: With dead ends: 35 [2020-07-19 21:27:53,412 INFO L226 Difference]: Without dead ends: 21 [2020-07-19 21:27:53,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:27:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-19 21:27:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-19 21:27:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-19 21:27:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-19 21:27:53,484 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-19 21:27:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:53,484 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-19 21:27:53,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 21:27:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-19 21:27:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-19 21:27:53,487 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:53,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:53,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 21:27:53,488 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:53,489 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-19 21:27:53,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:53,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342779680] [2020-07-19 21:27:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 [2020-07-19 21:27:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:27:53,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342779680] [2020-07-19 21:27:53,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:27:53,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 21:27:53,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459909949] [2020-07-19 21:27:53,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 21:27:53,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:53,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 21:27:53,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:27:53,579 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-19 21:27:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:53,653 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-19 21:27:53,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 21:27:53,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-19 21:27:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:53,656 INFO L225 Difference]: With dead ends: 27 [2020-07-19 21:27:53,656 INFO L226 Difference]: Without dead ends: 23 [2020-07-19 21:27:53,658 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:27:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-19 21:27:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-19 21:27:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-19 21:27:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-19 21:27:53,668 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-19 21:27:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:53,669 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-19 21:27:53,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 21:27:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-19 21:27:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-19 21:27:53,671 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:53,671 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:53,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 21:27:53,672 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:53,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-19 21:27:53,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:53,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790418780] [2020-07-19 21:27:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 [2020-07-19 21:27:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:27:53,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790418780] [2020-07-19 21:27:53,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101481043] [2020-07-19 21:27:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:53,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-19 21:27:53,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:27:54,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:54,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-07-19 21:27:54,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882206709] [2020-07-19 21:27:54,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 21:27:54,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:54,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 21:27:54,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:27:54,015 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-19 21:27:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:54,232 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-19 21:27:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-19 21:27:54,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-19 21:27:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:54,234 INFO L225 Difference]: With dead ends: 38 [2020-07-19 21:27:54,235 INFO L226 Difference]: Without dead ends: 23 [2020-07-19 21:27:54,236 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:27:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-19 21:27:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-19 21:27:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-19 21:27:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-19 21:27:54,248 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-19 21:27:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:54,248 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-19 21:27:54,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 21:27:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-19 21:27:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-19 21:27:54,251 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:54,251 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:54,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-19 21:27:54,456 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:54,457 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-19 21:27:54,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:54,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985418241] [2020-07-19 21:27:54,458 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 [2020-07-19 21:27:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-19 21:27:54,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985418241] [2020-07-19 21:27:54,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975073980] [2020-07-19 21:27:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:54,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-19 21:27:54,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-19 21:27:54,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:54,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-19 21:27:54,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292411630] [2020-07-19 21:27:54,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-19 21:27:54,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:54,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-19 21:27:54,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-19 21:27:54,696 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2020-07-19 21:27:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:54,798 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-19 21:27:54,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 21:27:54,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-07-19 21:27:54,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:54,801 INFO L225 Difference]: With dead ends: 41 [2020-07-19 21:27:54,801 INFO L226 Difference]: Without dead ends: 37 [2020-07-19 21:27:54,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:27:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-19 21:27:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-19 21:27:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-19 21:27:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-19 21:27:54,816 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-07-19 21:27:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:54,816 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-19 21:27:54,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-19 21:27:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-19 21:27:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-19 21:27:54,819 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:54,819 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:55,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:55,034 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-07-19 21:27:55,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:55,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806856891] [2020-07-19 21:27:55,036 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 [2020-07-19 21:27:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-19 21:27:55,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806856891] [2020-07-19 21:27:55,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951197396] [2020-07-19 21:27:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:55,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-19 21:27:55,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-19 21:27:55,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:55,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-19 21:27:55,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434820575] [2020-07-19 21:27:55,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-19 21:27:55,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:55,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-19 21:27:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:27:55,340 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-07-19 21:27:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:55,633 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-07-19 21:27:55,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-19 21:27:55,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-07-19 21:27:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:55,639 INFO L225 Difference]: With dead ends: 72 [2020-07-19 21:27:55,639 INFO L226 Difference]: Without dead ends: 41 [2020-07-19 21:27:55,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-07-19 21:27:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-19 21:27:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-19 21:27:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-19 21:27:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-07-19 21:27:55,672 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2020-07-19 21:27:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:55,673 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-07-19 21:27:55,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-19 21:27:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-07-19 21:27:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-19 21:27:55,680 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:55,680 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:55,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:55,882 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:55,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:55,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 3 times [2020-07-19 21:27:55,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:55,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101796856] [2020-07-19 21:27:55,885 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 [2020-07-19 21:27:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-19 21:27:56,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101796856] [2020-07-19 21:27:56,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439788540] [2020-07-19 21:27:56,210 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-19 21:27:56,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-19 21:27:56,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:56,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-07-19 21:27:56,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220961442] [2020-07-19 21:27:56,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 21:27:56,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:56,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 21:27:56,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:27:56,336 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 9 states. [2020-07-19 21:27:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:56,524 INFO L93 Difference]: Finished difference Result 83 states and 114 transitions. [2020-07-19 21:27:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-19 21:27:56,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2020-07-19 21:27:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:56,539 INFO L225 Difference]: With dead ends: 83 [2020-07-19 21:27:56,540 INFO L226 Difference]: Without dead ends: 79 [2020-07-19 21:27:56,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:27:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-19 21:27:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2020-07-19 21:27:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-19 21:27:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2020-07-19 21:27:56,588 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 68 [2020-07-19 21:27:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:56,589 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2020-07-19 21:27:56,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 21:27:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2020-07-19 21:27:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-19 21:27:56,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:56,600 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:56,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:56,817 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:56,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2068257585, now seen corresponding path program 4 times [2020-07-19 21:27:56,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:56,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61532973] [2020-07-19 21:27:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 [2020-07-19 21:27:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-07-19 21:27:57,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61532973] [2020-07-19 21:27:57,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312518833] [2020-07-19 21:27:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:57,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-19 21:27:57,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-07-19 21:27:57,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:57,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-07-19 21:27:57,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84427592] [2020-07-19 21:27:57,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 21:27:57,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:57,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 21:27:57,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:27:57,441 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand 10 states. [2020-07-19 21:27:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:57,715 INFO L93 Difference]: Finished difference Result 150 states and 231 transitions. [2020-07-19 21:27:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 21:27:57,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 150 [2020-07-19 21:27:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:57,727 INFO L225 Difference]: With dead ends: 150 [2020-07-19 21:27:57,728 INFO L226 Difference]: Without dead ends: 146 [2020-07-19 21:27:57,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-07-19 21:27:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-19 21:27:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2020-07-19 21:27:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-19 21:27:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2020-07-19 21:27:57,767 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 150 [2020-07-19 21:27:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:57,768 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2020-07-19 21:27:57,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 21:27:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2020-07-19 21:27:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-19 21:27:57,774 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:57,775 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:57,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-19 21:27:57,989 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:57,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:57,990 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 5 times [2020-07-19 21:27:57,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:57,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814810663] [2020-07-19 21:27:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 [2020-07-19 21:27:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 432 proven. 761 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2020-07-19 21:27:58,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814810663] [2020-07-19 21:27:58,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284614777] [2020-07-19 21:27:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:58,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-19 21:27:58,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2020-07-19 21:27:59,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:59,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 17 [2020-07-19 21:27:59,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530352083] [2020-07-19 21:27:59,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-19 21:27:59,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:59,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-19 21:27:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-19 21:27:59,065 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand 17 states. [2020-07-19 21:27:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:59,896 INFO L93 Difference]: Finished difference Result 229 states and 428 transitions. [2020-07-19 21:27:59,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-19 21:27:59,900 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 218 [2020-07-19 21:27:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:59,907 INFO L225 Difference]: With dead ends: 229 [2020-07-19 21:27:59,907 INFO L226 Difference]: Without dead ends: 101 [2020-07-19 21:27:59,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2020-07-19 21:27:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-19 21:27:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2020-07-19 21:27:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-19 21:27:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-19 21:27:59,945 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 218 [2020-07-19 21:27:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:59,947 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-19 21:27:59,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-19 21:27:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-19 21:27:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-07-19 21:27:59,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:59,958 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:28:00,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:28:00,173 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:28:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:28:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 6 times [2020-07-19 21:28:00,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:28:00,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53575484] [2020-07-19 21:28:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 [2020-07-19 21:28:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1358 proven. 1342 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2020-07-19 21:28:01,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53575484] [2020-07-19 21:28:01,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673109678] [2020-07-19 21:28:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:28:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:28:01,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-19 21:28:01,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:28:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1091 proven. 467 refuted. 0 times theorem prover too weak. 4481 trivial. 0 not checked. [2020-07-19 21:28:01,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:28:01,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 21 [2020-07-19 21:28:01,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373629720] [2020-07-19 21:28:01,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-19 21:28:01,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:28:01,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-19 21:28:01,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-19 21:28:01,640 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 21 states. [2020-07-19 21:28:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:28:02,597 INFO L93 Difference]: Finished difference Result 212 states and 396 transitions. [2020-07-19 21:28:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-19 21:28:02,597 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 327 [2020-07-19 21:28:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:28:02,601 INFO L225 Difference]: With dead ends: 212 [2020-07-19 21:28:02,601 INFO L226 Difference]: Without dead ends: 119 [2020-07-19 21:28:02,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2020-07-19 21:28:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-19 21:28:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2020-07-19 21:28:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-19 21:28:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 137 transitions. [2020-07-19 21:28:02,618 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 137 transitions. Word has length 327 [2020-07-19 21:28:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:28:02,619 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 137 transitions. [2020-07-19 21:28:02,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-19 21:28:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 137 transitions. [2020-07-19 21:28:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-19 21:28:02,626 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:28:02,626 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:28:02,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:28:02,841 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:28:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:28:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 7 times [2020-07-19 21:28:02,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:28:02,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519639278] [2020-07-19 21:28:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7b8af71 [2020-07-19 21:28:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 21:28:02,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 21:28:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 21:28:02,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 21:28:03,008 INFO L174 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2020-07-19 21:28:03,009 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-19 21:28:03,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-19 21:28:03,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:28:03 BoogieIcfgContainer [2020-07-19 21:28:03,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 21:28:03,119 INFO L168 Benchmark]: Toolchain (without parser) took 11057.27 ms. Allocated memory was 142.6 MB in the beginning and 391.1 MB in the end (delta: 248.5 MB). Free memory was 100.4 MB in the beginning and 97.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 251.9 MB. Max. memory is 7.1 GB. [2020-07-19 21:28:03,120 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 142.6 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-19 21:28:03,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.98 ms. Allocated memory is still 142.6 MB. Free memory was 100.2 MB in the beginning and 90.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-19 21:28:03,121 INFO L168 Benchmark]: Boogie Preprocessor took 26.44 ms. Allocated memory is still 142.6 MB. Free memory was 90.8 MB in the beginning and 89.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-19 21:28:03,122 INFO L168 Benchmark]: RCFGBuilder took 412.71 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 89.4 MB in the beginning and 166.9 MB in the end (delta: -77.4 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-19 21:28:03,123 INFO L168 Benchmark]: TraceAbstraction took 10293.10 ms. Allocated memory was 199.8 MB in the beginning and 391.1 MB in the end (delta: 191.4 MB). Free memory was 166.9 MB in the beginning and 97.0 MB in the end (delta: 69.9 MB). Peak memory consumption was 261.2 MB. Max. memory is 7.1 GB. [2020-07-19 21:28:03,126 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 142.6 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 313.98 ms. Allocated memory is still 142.6 MB. Free memory was 100.2 MB in the beginning and 90.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.44 ms. Allocated memory is still 142.6 MB. Free memory was 90.8 MB in the beginning and 89.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 412.71 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 89.4 MB in the beginning and 166.9 MB in the end (delta: -77.4 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10293.10 ms. Allocated memory was 199.8 MB in the beginning and 391.1 MB in the end (delta: 191.4 MB). Free memory was 166.9 MB in the beginning and 97.0 MB in the end (delta: 69.9 MB). Peak memory consumption was 261.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.0s, OverallIterations: 10, TraceHistogramMax: 47, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 201 SDtfs, 496 SDslu, 667 SDs, 0 SdLazy, 1327 SolverSat, 453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1264 GetRequests, 1118 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 45 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2025 NumberOfCodeBlocks, 2025 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1723 ConstructedInterpolants, 0 QuantifiedInterpolants, 554179 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1915 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 15807/20072 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...