./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 676e29c704408ba5cb62ef3917e5c4d703cda2e4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:26:20,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:26:20,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:26:20,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:26:20,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:26:20,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:26:20,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:26:20,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:26:20,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:26:20,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:26:20,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:26:20,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:26:20,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:26:20,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:26:20,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:26:20,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:26:20,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:26:20,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:26:20,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:26:20,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:26:20,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:26:20,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:26:20,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:26:20,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:26:20,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:26:20,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:26:20,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:26:20,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:26:20,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:26:20,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:26:20,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:26:20,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:26:20,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:26:20,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:26:20,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:26:20,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:26:20,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:26:20,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:26:20,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:26:20,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:26:20,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:26:20,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:26:20,274 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:26:20,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:26:20,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:26:20,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:26:20,276 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:26:20,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:26:20,276 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:26:20,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:26:20,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:26:20,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:26:20,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:26:20,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:26:20,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:26:20,278 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:26:20,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:26:20,279 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:26:20,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:26:20,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:26:20,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:26:20,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:26:20,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:26:20,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:26:20,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:26:20,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:26:20,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:26:20,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:26:20,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:26:20,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:26:20,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 676e29c704408ba5cb62ef3917e5c4d703cda2e4 [2019-11-28 00:26:20,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:26:20,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:26:20,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:26:20,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:26:20,684 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:26:20,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2019-11-28 00:26:20,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0e091f0/16ca667a0f434d3483fca9235e6a57ce/FLAG6d240db81 [2019-11-28 00:26:21,244 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:26:21,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2019-11-28 00:26:21,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0e091f0/16ca667a0f434d3483fca9235e6a57ce/FLAG6d240db81 [2019-11-28 00:26:21,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a0e091f0/16ca667a0f434d3483fca9235e6a57ce [2019-11-28 00:26:21,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:26:21,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:26:21,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:26:21,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:26:21,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:26:21,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:21,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bbd7332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21, skipping insertion in model container [2019-11-28 00:26:21,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:21,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:26:21,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:26:21,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:26:21,860 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:26:21,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:26:21,890 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:26:21,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21 WrapperNode [2019-11-28 00:26:21,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:26:21,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:26:21,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:26:21,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:26:21,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:21,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:21,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:26:21,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:26:21,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:26:21,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:26:22,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:22,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:22,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:22,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:22,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:22,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:22,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (1/1) ... [2019-11-28 00:26:22,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:26:22,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:26:22,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:26:22,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:26:22,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:26:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 00:26:22,084 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 00:26:22,084 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 00:26:22,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:26:22,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:26:22,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:26:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 00:26:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:26:22,087 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2019-11-28 00:26:22,087 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2019-11-28 00:26:22,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 00:26:22,302 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:26:22,302 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:26:22,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:22 BoogieIcfgContainer [2019-11-28 00:26:22,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:26:22,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:26:22,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:26:22,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:26:22,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:26:21" (1/3) ... [2019-11-28 00:26:22,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b184444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:26:22, skipping insertion in model container [2019-11-28 00:26:22,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:21" (2/3) ... [2019-11-28 00:26:22,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b184444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:26:22, skipping insertion in model container [2019-11-28 00:26:22,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:22" (3/3) ... [2019-11-28 00:26:22,313 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2019-11-28 00:26:22,325 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:26:22,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:26:22,346 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:26:22,371 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:26:22,372 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:26:22,372 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:26:22,372 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:26:22,372 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:26:22,372 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:26:22,372 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:26:22,372 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:26:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-28 00:26:22,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 00:26:22,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:22,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:22,396 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:22,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:22,403 INFO L82 PathProgramCache]: Analyzing trace with hash -694887038, now seen corresponding path program 1 times [2019-11-28 00:26:22,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:22,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852451483] [2019-11-28 00:26:22,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:22,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852451483] [2019-11-28 00:26:22,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:22,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:26:22,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930711970] [2019-11-28 00:26:22,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:26:22,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:22,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:26:22,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:26:22,806 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-11-28 00:26:22,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:22,906 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-11-28 00:26:22,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:26:22,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-11-28 00:26:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:22,919 INFO L225 Difference]: With dead ends: 33 [2019-11-28 00:26:22,920 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 00:26:22,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:26:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 00:26:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-28 00:26:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 00:26:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-11-28 00:26:22,958 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2019-11-28 00:26:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:22,958 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-11-28 00:26:22,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:26:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-11-28 00:26:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:26:22,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:22,960 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:22,960 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2070363059, now seen corresponding path program 1 times [2019-11-28 00:26:22,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:22,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227585440] [2019-11-28 00:26:22,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:23,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227585440] [2019-11-28 00:26:23,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975366183] [2019-11-28 00:26:23,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 00:26:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:23,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 00:26:23,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:23,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 00:26:23,265 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 00:26:23,270 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 00:26:23,271 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 00:26:23,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-28 00:26:23,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 00:26:23,295 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 00:26:23,302 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 00:26:23,303 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 00:26:23,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-28 00:26:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:23,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:23,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-11-28 00:26:23,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684275757] [2019-11-28 00:26:23,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:26:23,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:26:23,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:26:23,407 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-11-28 00:26:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:23,599 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-28 00:26:23,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:26:23,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-11-28 00:26:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:23,601 INFO L225 Difference]: With dead ends: 22 [2019-11-28 00:26:23,601 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 00:26:23,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:26:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 00:26:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-28 00:26:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 00:26:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-11-28 00:26:23,609 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2019-11-28 00:26:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:23,610 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-11-28 00:26:23,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:26:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-11-28 00:26:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:26:23,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:23,612 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:23,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:23,816 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash -176397214, now seen corresponding path program 2 times [2019-11-28 00:26:23,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:23,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054912854] [2019-11-28 00:26:23,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:24,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054912854] [2019-11-28 00:26:24,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462424377] [2019-11-28 00:26:24,197 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-28 00:26:24,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:24,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:24,278 WARN L253 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-28 00:26:24,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:24,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 00:26:24,299 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 00:26:24,312 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 00:26:24,313 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 00:26:24,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-28 00:26:24,470 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 00:26:24,471 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2019-11-28 00:26:24,473 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 00:26:24,486 INFO L588 ElimStorePlain]: treesize reduction 11, result has 50.0 percent of original size [2019-11-28 00:26:24,486 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 00:26:24,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-28 00:26:24,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 00:26:24,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2019-11-28 00:26:24,616 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 00:26:24,627 INFO L588 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-11-28 00:26:24,628 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 00:26:24,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:11 [2019-11-28 00:26:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:24,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:24,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-28 00:26:24,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571353865] [2019-11-28 00:26:24,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 00:26:24,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:24,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 00:26:24,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:26:24,729 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 24 states. [2019-11-28 00:26:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:25,093 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-11-28 00:26:25,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:26:25,094 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 17 [2019-11-28 00:26:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:25,095 INFO L225 Difference]: With dead ends: 27 [2019-11-28 00:26:25,095 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 00:26:25,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2019-11-28 00:26:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 00:26:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-28 00:26:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 00:26:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-11-28 00:26:25,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2019-11-28 00:26:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:25,103 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-11-28 00:26:25,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 00:26:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-11-28 00:26:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:26:25,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:25,105 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:25,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:25,315 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:25,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:25,315 INFO L82 PathProgramCache]: Analyzing trace with hash -978155155, now seen corresponding path program 3 times [2019-11-28 00:26:25,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:25,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899030191] [2019-11-28 00:26:25,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:25,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899030191] [2019-11-28 00:26:25,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936842191] [2019-11-28 00:26:25,561 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-11-28 00:26:25,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 00:26:25,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:25,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 00:26:25,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:25,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 00:26:25,706 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 00:26:25,714 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 00:26:25,714 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 00:26:25,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-28 00:26:25,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 00:26:25,794 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 00:26:25,799 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 00:26:25,800 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 00:26:25,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-11-28 00:26:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:26:25,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:25,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 24 [2019-11-28 00:26:25,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688283047] [2019-11-28 00:26:25,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 00:26:25,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:25,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 00:26:25,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:26:25,828 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 24 states. [2019-11-28 00:26:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:26,377 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 00:26:26,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 00:26:26,378 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-11-28 00:26:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:26,378 INFO L225 Difference]: With dead ends: 30 [2019-11-28 00:26:26,378 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:26:26,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2019-11-28 00:26:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:26:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:26:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:26:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:26:26,381 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-28 00:26:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:26,382 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:26:26,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 00:26:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:26:26,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:26:26,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:26,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:26:26,885 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-11-28 00:26:27,034 INFO L246 CegarLoopResult]: For program point fooEXIT(lines 9 18) no Hoare annotation was computed. [2019-11-28 00:26:27,034 INFO L242 CegarLoopResult]: At program point fooENTRY(lines 9 18) the Hoare annotation is: (let ((.cse3 (select |#memory_int| |foo_#in~p.base|))) (let ((.cse1 (not (= 0 |foo_#in~p.offset|))) (.cse0 (select .cse3 |foo_#in~p.offset|)) (.cse2 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (= .cse0 12) .cse1 (not (= 12 .cse2))) (or .cse1 (= (select .cse3 0) 11) (not (= 11 .cse2))) (or .cse1 (= .cse0 10) (not (= 10 .cse2))) (or (<= .cse0 13) (not (<= .cse2 13))) (or (<= .cse0 20) (not (<= .cse2 20)))))) [2019-11-28 00:26:27,035 INFO L246 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2019-11-28 00:26:27,035 INFO L246 CegarLoopResult]: For program point fooErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2019-11-28 00:26:27,035 INFO L246 CegarLoopResult]: For program point L12(lines 12 17) no Hoare annotation was computed. [2019-11-28 00:26:27,035 INFO L242 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |foo_#in~p.base|)) (.cse6 (select |#memory_int| foo_~p.base))) (let ((.cse3 (select .cse6 foo_~p.offset)) (.cse0 (select .cse5 |foo_#in~p.offset|)) (.cse2 (not (= 0 |foo_#in~p.offset|))) (.cse4 (= 0 foo_~p.offset)) (.cse1 (select (select |old(#memory_int)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (<= .cse0 13) (not (<= .cse1 13))) (or .cse2 (and (<= .cse3 12) (<= .cse0 12)) (not (= 12 .cse1))) (or (and (<= .cse0 20) (<= .cse3 19)) (not (<= .cse1 20))) (or (and .cse4 (= 10 .cse3) (= .cse0 10)) .cse2 (not (= 10 .cse1))) (or .cse2 (and (= (select .cse5 0) 11) .cse4 (= 11 (select .cse6 0))) (not (= 11 .cse1)))))) [2019-11-28 00:26:27,035 INFO L246 CegarLoopResult]: For program point L10(lines 10 17) no Hoare annotation was computed. [2019-11-28 00:26:27,035 INFO L246 CegarLoopResult]: For program point L10-1(lines 9 18) no Hoare annotation was computed. [2019-11-28 00:26:27,036 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:26:27,036 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:26:27,036 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:26:27,036 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:26:27,036 INFO L242 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~p~0.offset) (= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 10)) [2019-11-28 00:26:27,036 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-28 00:26:27,036 INFO L246 CegarLoopResult]: For program point L20(lines 20 26) no Hoare annotation was computed. [2019-11-28 00:26:27,036 INFO L246 CegarLoopResult]: For program point plusFINAL(lines 4 7) no Hoare annotation was computed. [2019-11-28 00:26:27,036 INFO L242 CegarLoopResult]: At program point plusENTRY(lines 4 7) the Hoare annotation is: (let ((.cse3 (select |#memory_int| |plus_#in~p.base|)) (.cse5 (select |old(#memory_int)| |plus_#in~p.base|))) (let ((.cse1 (select .cse5 |plus_#in~p.offset|)) (.cse2 (not (= 0 |plus_#in~p.offset|))) (.cse4 (select .cse5 0)) (.cse0 (select .cse3 |plus_#in~p.offset|))) (and (or (<= .cse0 19) (not (<= .cse1 19))) (or (<= .cse0 12) (not (<= .cse1 12))) (or .cse2 (= 11 (select .cse3 0)) (not (= .cse4 11))) (or .cse2 (not (= .cse4 10)) (= 10 .cse0))))) [2019-11-28 00:26:27,037 INFO L246 CegarLoopResult]: For program point plusEXIT(lines 4 7) no Hoare annotation was computed. [2019-11-28 00:26:27,037 INFO L242 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (let ((.cse6 (select |#memory_int| plus_~p.base)) (.cse8 (select |old(#memory_int)| |plus_#in~p.base|)) (.cse7 (select |#memory_int| |plus_#in~p.base|))) (let ((.cse0 (select .cse7 |plus_#in~p.offset|)) (.cse3 (not (= 0 |plus_#in~p.offset|))) (.cse1 (= 0 plus_~p.offset)) (.cse4 (select .cse8 0)) (.cse2 (select .cse6 plus_~p.offset)) (.cse5 (select .cse8 |plus_#in~p.offset|))) (and (or (and (<= .cse0 12) .cse1 (= .cse2 12)) .cse3 (not (= .cse4 11))) (or (not (<= .cse5 12)) (and (<= .cse2 13) (<= .cse0 19))) (or .cse3 (and (= 11 (select .cse6 0)) (= 11 (select .cse7 0)) .cse1) (not (= .cse4 10))) (or (<= .cse2 20) (not (<= .cse5 19)))))) [2019-11-28 00:26:27,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:26:27 BoogieIcfgContainer [2019-11-28 00:26:27,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:26:27,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:26:27,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:26:27,044 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:26:27,045 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:22" (3/4) ... [2019-11-28 00:26:27,049 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:26:27,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-11-28 00:26:27,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure plus [2019-11-28 00:26:27,062 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 00:26:27,062 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 00:26:27,062 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:26:27,063 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:26:27,110 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:26:27,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:26:27,112 INFO L168 Benchmark]: Toolchain (without parser) took 5486.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:27,112 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:27,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.82 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:27,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:27,114 INFO L168 Benchmark]: Boogie Preprocessor took 29.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:27,115 INFO L168 Benchmark]: RCFGBuilder took 283.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:27,116 INFO L168 Benchmark]: TraceAbstraction took 4738.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.7 MB). Peak memory consumption was 69.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:27,116 INFO L168 Benchmark]: Witness Printer took 66.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 00:26:27,119 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.61 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.82 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 283.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4738.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -1.7 MB). Peak memory consumption was 69.0 MB. Max. memory is 11.5 GB. * Witness Printer took 66.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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 3 procedures, 19 locations, 1 error locations. Result: SAFE, OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 44 SDtfs, 14 SDslu, 154 SDs, 0 SdLazy, 432 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 21 PreInvPairs, 21 NumberOfFragments, 411 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 201 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 109 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 9466 SizeOfPredicates, 44 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 20/64 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...