java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:04:44,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:04:44,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:04:44,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:04:44,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:04:44,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:04:44,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:04:44,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:04:44,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:04:44,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:04:44,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:04:44,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:04:44,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:04:44,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:04:44,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:04:44,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:04:44,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:04:44,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:04:44,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:04:44,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:04:44,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:04:44,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:04:44,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:04:44,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:04:44,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:04:44,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:04:44,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:04:44,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:04:44,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:04:44,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:04:44,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:04:44,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:04:44,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:04:44,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:04:44,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:04:44,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:04:44,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:04:44,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:04:44,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:04:44,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:04:44,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:04:44,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:04:44,368 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:04:44,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:04:44,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:04:44,369 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:04:44,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:04:44,369 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:04:44,370 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:04:44,370 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:04:44,370 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:04:44,370 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:04:44,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:04:44,371 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:04:44,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:04:44,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:04:44,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:04:44,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:04:44,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:04:44,372 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:04:44,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:04:44,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:04:44,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:04:44,373 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:04:44,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:04:44,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:04:44,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:04:44,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:04:44,374 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:04:44,374 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:04:44,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:04:44,375 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:04:44,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:04:44,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:04:44,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:04:44,420 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:04:44,421 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:04:44,422 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2019-09-10 03:04:44,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5a39000/89d7304c517349dfac6fd2c3589f61be/FLAG6d63ddd39 [2019-09-10 03:04:44,885 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:04:44,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2019-09-10 03:04:44,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5a39000/89d7304c517349dfac6fd2c3589f61be/FLAG6d63ddd39 [2019-09-10 03:04:45,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5a39000/89d7304c517349dfac6fd2c3589f61be [2019-09-10 03:04:45,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:04:45,307 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:04:45,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:04:45,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:04:45,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:04:45,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:04:45" (1/1) ... [2019-09-10 03:04:45,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5073470f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45, skipping insertion in model container [2019-09-10 03:04:45,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:04:45" (1/1) ... [2019-09-10 03:04:45,323 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:04:45,341 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:04:45,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:04:45,531 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:04:45,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:04:45,557 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:04:45,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45 WrapperNode [2019-09-10 03:04:45,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:04:45,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:04:45,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:04:45,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:04:45,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45" (1/1) ... [2019-09-10 03:04:45,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45" (1/1) ... [2019-09-10 03:04:45,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45" (1/1) ... [2019-09-10 03:04:45,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45" (1/1) ... [2019-09-10 03:04:45,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45" (1/1) ... [2019-09-10 03:04:45,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45" (1/1) ... [2019-09-10 03:04:45,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45" (1/1) ... [2019-09-10 03:04:45,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:04:45,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:04:45,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:04:45,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:04:45,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:04:45,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:04:45,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:04:45,732 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-09-10 03:04:45,732 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-09-10 03:04:45,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:04:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:04:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:04:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-09-10 03:04:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-09-10 03:04:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:04:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:04:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:04:45,916 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:04:45,917 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:04:45,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:04:45 BoogieIcfgContainer [2019-09-10 03:04:45,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:04:45,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:04:45,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:04:45,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:04:45,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:04:45" (1/3) ... [2019-09-10 03:04:45,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5a9479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:04:45, skipping insertion in model container [2019-09-10 03:04:45,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:04:45" (2/3) ... [2019-09-10 03:04:45,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5a9479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:04:45, skipping insertion in model container [2019-09-10 03:04:45,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:04:45" (3/3) ... [2019-09-10 03:04:45,946 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2019-09-10 03:04:45,973 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:04:45,988 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:04:46,021 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:04:46,063 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:04:46,063 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:04:46,064 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:04:46,064 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:04:46,064 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:04:46,064 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:04:46,064 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:04:46,064 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:04:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-10 03:04:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:04:46,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:04:46,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:04:46,087 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:04:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:46,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2019-09-10 03:04:46,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:04:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:46,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:04:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:46,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:04:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:04:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:04:46,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:04:46,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:04:46,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:04:46,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:04:46,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:04:46,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:04:46,273 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2019-09-10 03:04:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:04:46,393 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-09-10 03:04:46,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:04:46,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:04:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:04:46,406 INFO L225 Difference]: With dead ends: 35 [2019-09-10 03:04:46,406 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:04:46,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:04:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:04:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:04:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:04:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-10 03:04:46,462 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2019-09-10 03:04:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:04:46,463 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-10 03:04:46,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:04:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-10 03:04:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 03:04:46,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:04:46,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:04:46,466 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:04:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:46,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2019-09-10 03:04:46,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:04:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:46,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:04:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:46,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:04:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:04:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:04:46,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:04:46,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:04:46,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:04:46,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:04:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:04:46,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:04:46,544 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-09-10 03:04:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:04:46,633 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-09-10 03:04:46,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:04:46,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-10 03:04:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:04:46,637 INFO L225 Difference]: With dead ends: 32 [2019-09-10 03:04:46,638 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 03:04:46,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:04:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 03:04:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-10 03:04:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:04:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-10 03:04:46,657 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2019-09-10 03:04:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:04:46,657 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-10 03:04:46,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:04:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-10 03:04:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 03:04:46,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:04:46,661 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:04:46,661 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:04:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:46,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2019-09-10 03:04:46,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:04:46,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:46,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:04:46,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:46,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:04:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:04:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:04:46,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:46,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:04:46,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-09-10 03:04:46,800 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2019-09-10 03:04:46,842 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:04:46,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:04:46,928 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:04:46,930 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 8 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:04:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:46,935 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:04:46,994 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:04:46,995 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:04:47,036 INFO L420 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2019-09-10 03:04:47,036 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:04:47,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:04:47,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-10 03:04:47,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:04:47,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:04:47,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:04:47,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:04:47,040 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2019-09-10 03:04:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:04:47,264 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-09-10 03:04:47,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:04:47,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-10 03:04:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:04:47,267 INFO L225 Difference]: With dead ends: 48 [2019-09-10 03:04:47,267 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:04:47,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:04:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:04:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-10 03:04:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 03:04:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-09-10 03:04:47,278 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2019-09-10 03:04:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:04:47,278 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-09-10 03:04:47,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:04:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-09-10 03:04:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 03:04:47,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:04:47,281 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:04:47,282 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:04:47,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2019-09-10 03:04:47,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:04:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:47,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:04:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:47,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:04:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:04:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:04:47,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:47,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:04:47,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2019-09-10 03:04:47,370 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:04:47,373 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:04:47,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:04:47,392 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:04:47,403 INFO L272 AbstractInterpreter]: Visited 16 different actions 30 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 3. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:04:47,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:47,404 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:04:47,420 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:04:47,420 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:04:47,459 INFO L420 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2019-09-10 03:04:47,460 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:04:47,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:04:47,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-09-10 03:04:47,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:04:47,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:04:47,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:04:47,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:04:47,462 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2019-09-10 03:04:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:04:47,735 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-09-10 03:04:47,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:04:47,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-09-10 03:04:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:04:47,739 INFO L225 Difference]: With dead ends: 55 [2019-09-10 03:04:47,739 INFO L226 Difference]: Without dead ends: 55 [2019-09-10 03:04:47,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:04:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-10 03:04:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-10 03:04:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 03:04:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-09-10 03:04:47,756 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2019-09-10 03:04:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:04:47,757 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-09-10 03:04:47,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:04:47,757 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-09-10 03:04:47,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 03:04:47,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:04:47,763 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:04:47,764 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:04:47,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:47,764 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2019-09-10 03:04:47,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:04:47,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:47,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:04:47,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:47,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:04:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:04:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:04:47,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:47,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:04:47,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:04:47,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:04:47,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:47,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:04:47,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:04:47,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:04:47,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:04:47,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:04:47,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:04:47,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:04:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 03:04:48,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:04:48,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:48,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 03:04:48,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:04:48,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2019-09-10 03:04:48,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:04:48,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:04:48,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:04:48,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:04:48,562 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2019-09-10 03:04:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:04:48,877 INFO L93 Difference]: Finished difference Result 84 states and 117 transitions. [2019-09-10 03:04:48,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:04:48,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-09-10 03:04:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:04:48,882 INFO L225 Difference]: With dead ends: 84 [2019-09-10 03:04:48,882 INFO L226 Difference]: Without dead ends: 76 [2019-09-10 03:04:48,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-09-10 03:04:48,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-10 03:04:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-09-10 03:04:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 03:04:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-09-10 03:04:48,904 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2019-09-10 03:04:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:04:48,905 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-09-10 03:04:48,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:04:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-09-10 03:04:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:04:48,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:04:48,910 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:04:48,910 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:04:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:48,911 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2019-09-10 03:04:48,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:04:48,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:48,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:04:48,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:48,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:04:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:04:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 03:04:49,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:49,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:04:49,029 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-09-10 03:04:49,029 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:04:49,034 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:04:49,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:04:49,056 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:04:49,057 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 3. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:04:49,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:49,057 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:04:49,087 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:04:49,087 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:04:49,137 INFO L420 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2019-09-10 03:04:49,137 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:04:49,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:04:49,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2019-09-10 03:04:49,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:04:49,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:04:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:04:49,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:04:49,142 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2019-09-10 03:04:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:04:49,535 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-09-10 03:04:49,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:04:49,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-09-10 03:04:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:04:49,537 INFO L225 Difference]: With dead ends: 68 [2019-09-10 03:04:49,540 INFO L226 Difference]: Without dead ends: 68 [2019-09-10 03:04:49,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:04:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-10 03:04:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-10 03:04:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-10 03:04:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-09-10 03:04:49,557 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2019-09-10 03:04:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:04:49,557 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-09-10 03:04:49,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:04:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-09-10 03:04:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 03:04:49,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:04:49,565 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:04:49,565 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:04:49,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:49,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2019-09-10 03:04:49,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:04:49,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:49,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:04:49,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:49,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:04:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:04:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 03:04:49,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:49,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:04:49,656 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2019-09-10 03:04:49,656 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:04:49,658 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:04:49,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:04:49,682 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:04:49,683 INFO L272 AbstractInterpreter]: Visited 33 different actions 135 times. Never merged. Never widened. Performed 132 root evaluator evaluations with a maximum evaluation depth of 3. Performed 132 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:04:49,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:49,683 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:04:49,711 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 49.35% of their original sizes. [2019-09-10 03:04:49,711 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:04:50,401 INFO L420 sIntCurrentIteration]: We unified 66 AI predicates to 66 [2019-09-10 03:04:50,401 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:04:50,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:04:50,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [8] total 46 [2019-09-10 03:04:50,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:04:50,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 03:04:50,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 03:04:50,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1474, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 03:04:50,404 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 40 states. [2019-09-10 03:04:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:04:53,145 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2019-09-10 03:04:53,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:04:53,146 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 67 [2019-09-10 03:04:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:04:53,147 INFO L225 Difference]: With dead ends: 104 [2019-09-10 03:04:53,147 INFO L226 Difference]: Without dead ends: 104 [2019-09-10 03:04:53,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=3348, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 03:04:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-10 03:04:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2019-09-10 03:04:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-10 03:04:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-09-10 03:04:53,159 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 67 [2019-09-10 03:04:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:04:53,160 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-09-10 03:04:53,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 03:04:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-09-10 03:04:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 03:04:53,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:04:53,162 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:04:53,163 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:04:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1540036056, now seen corresponding path program 2 times [2019-09-10 03:04:53,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:04:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:04:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:53,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:04:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:04:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-09-10 03:04:53,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:53,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:04:53,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:04:53,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:04:53,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:53,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:04:53,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:04:53,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:04:53,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 03:04:53,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:04:53,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-10 03:04:53,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:04:54,242 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-09-10 03:04:54,242 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:04:54,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:54,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:54,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:54,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:54,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:55,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:55,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-09-10 03:04:55,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:04:55,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 28 [2019-09-10 03:04:55,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:04:55,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 03:04:55,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 03:04:55,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-09-10 03:04:55,116 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 28 states. [2019-09-10 03:04:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:04:55,543 INFO L93 Difference]: Finished difference Result 159 states and 205 transitions. [2019-09-10 03:04:55,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 03:04:55,543 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 109 [2019-09-10 03:04:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:04:55,547 INFO L225 Difference]: With dead ends: 159 [2019-09-10 03:04:55,547 INFO L226 Difference]: Without dead ends: 154 [2019-09-10 03:04:55,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 206 SyntacticMatches, 18 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2019-09-10 03:04:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-10 03:04:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 111. [2019-09-10 03:04:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-10 03:04:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2019-09-10 03:04:55,569 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 109 [2019-09-10 03:04:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:04:55,570 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2019-09-10 03:04:55,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 03:04:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2019-09-10 03:04:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 03:04:55,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:04:55,572 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:04:55,572 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:04:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1377787652, now seen corresponding path program 1 times [2019-09-10 03:04:55,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:04:55,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:55,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:04:55,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:55,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:04:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:04:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 55 proven. 63 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-10 03:04:55,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:55,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:04:55,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 03:04:55,662 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:04:55,666 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:04:55,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:04:55,685 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:04:55,685 INFO L272 AbstractInterpreter]: Visited 29 different actions 74 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:04:55,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:55,686 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:04:55,736 INFO L227 lantSequenceWeakener]: Weakened 45 states. On average, predicates are now at 48.52% of their original sizes. [2019-09-10 03:04:55,738 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:04:56,104 INFO L420 sIntCurrentIteration]: We unified 110 AI predicates to 110 [2019-09-10 03:04:56,104 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:04:56,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:04:56,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [9] total 39 [2019-09-10 03:04:56,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:04:56,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 03:04:56,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 03:04:56,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=924, Unknown=0, NotChecked=0, Total=992 [2019-09-10 03:04:56,106 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 32 states. [2019-09-10 03:04:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:04:58,275 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-09-10 03:04:58,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 03:04:58,275 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 111 [2019-09-10 03:04:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:04:58,277 INFO L225 Difference]: With dead ends: 133 [2019-09-10 03:04:58,277 INFO L226 Difference]: Without dead ends: 125 [2019-09-10 03:04:58,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=2576, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 03:04:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-10 03:04:58,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2019-09-10 03:04:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-10 03:04:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-09-10 03:04:58,286 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 111 [2019-09-10 03:04:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:04:58,287 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-09-10 03:04:58,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 03:04:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-09-10 03:04:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 03:04:58,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:04:58,289 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:04:58,289 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:04:58,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:04:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1521075862, now seen corresponding path program 3 times [2019-09-10 03:04:58,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:04:58,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:58,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:04:58,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:04:58,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:04:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:04:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 96 proven. 18 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-10 03:04:58,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:58,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:04:58,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:04:58,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:04:58,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:04:58,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:04:58,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:04:58,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:04:58,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:04:58,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:04:58,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:04:58,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:04:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 96 proven. 18 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-10 03:04:58,453 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:04:58,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:58,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:58,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:04:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 96 proven. 24 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:04:58,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:04:58,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 13 [2019-09-10 03:04:58,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:04:58,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:04:58,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:04:58,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:04:58,973 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 9 states. [2019-09-10 03:04:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:04:59,105 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2019-09-10 03:04:59,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:04:59,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-10 03:04:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:04:59,107 INFO L225 Difference]: With dead ends: 133 [2019-09-10 03:04:59,107 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 03:04:59,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:04:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 03:04:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 03:04:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 03:04:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 03:04:59,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2019-09-10 03:04:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:04:59,110 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 03:04:59,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:04:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 03:04:59,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 03:04:59,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:04:59 BoogieIcfgContainer [2019-09-10 03:04:59,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:04:59,117 INFO L168 Benchmark]: Toolchain (without parser) took 13808.75 ms. Allocated memory was 135.3 MB in the beginning and 378.0 MB in the end (delta: 242.7 MB). Free memory was 90.4 MB in the beginning and 148.0 MB in the end (delta: -57.6 MB). Peak memory consumption was 185.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:04:59,117 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 108.6 MB in the beginning and 108.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:04:59,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.75 ms. Allocated memory is still 135.3 MB. Free memory was 90.2 MB in the beginning and 80.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:04:59,119 INFO L168 Benchmark]: Boogie Preprocessor took 115.37 ms. Allocated memory was 135.3 MB in the beginning and 202.4 MB in the end (delta: 67.1 MB). Free memory was 80.4 MB in the beginning and 179.0 MB in the end (delta: -98.6 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:04:59,120 INFO L168 Benchmark]: RCFGBuilder took 245.97 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 166.5 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-09-10 03:04:59,121 INFO L168 Benchmark]: TraceAbstraction took 13193.42 ms. Allocated memory was 202.4 MB in the beginning and 378.0 MB in the end (delta: 175.6 MB). Free memory was 165.9 MB in the beginning and 148.0 MB in the end (delta: 17.9 MB). Peak memory consumption was 193.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:04:59,124 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 108.6 MB in the beginning and 108.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.75 ms. Allocated memory is still 135.3 MB. Free memory was 90.2 MB in the beginning and 80.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.37 ms. Allocated memory was 135.3 MB in the beginning and 202.4 MB in the end (delta: 67.1 MB). Free memory was 80.4 MB in the beginning and 179.0 MB in the end (delta: -98.6 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 245.97 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 166.5 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13193.42 ms. Allocated memory was 202.4 MB in the beginning and 378.0 MB in the end (delta: 175.6 MB). Free memory was 165.9 MB in the beginning and 148.0 MB in the end (delta: 17.9 MB). Peak memory consumption was 193.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. SAFE Result, 13.0s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 381 SDtfs, 306 SDslu, 4513 SDs, 0 SdLazy, 1704 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 960 GetRequests, 716 SyntacticMatches, 34 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 5 AbstIntIterations, 5 AbstIntStrong, 0.8083048919226391 AbsIntWeakeningRatio, 0.5665529010238908 AbsIntAvgWeakeningVarsNumRemoved, 0.49146757679180886 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 74 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 867 NumberOfCodeBlocks, 852 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1122 ConstructedInterpolants, 0 QuantifiedInterpolants, 257580 SizeOfPredicates, 10 NumberOfNonLiveVariables, 559 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 1673/2132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...