./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/jm2006_variant.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/loop-lit/jm2006_variant.i -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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4cc4e6594048669dc8576432b007a54cfaf2cb918409d0a11b256ce036aec976 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:04:20,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:04:20,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:04:20,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:04:20,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:04:20,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:04:20,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:04:20,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:04:20,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:04:20,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:04:20,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:04:20,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:04:20,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:04:20,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:04:20,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:04:20,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:04:20,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:04:20,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:04:20,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:04:20,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:04:20,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:04:20,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:04:20,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:04:20,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:04:20,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:04:20,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:04:20,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:04:20,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:04:20,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:04:20,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:04:20,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:04:20,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:04:20,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:04:20,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:04:20,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:04:20,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:04:20,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:04:20,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:04:20,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:04:20,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:04:20,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:04:20,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:04:20,287 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:04:20,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:04:20,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:04:20,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:04:20,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:04:20,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:04:20,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:04:20,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:04:20,290 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:04:20,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:04:20,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:04:20,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:04:20,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:04:20,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:04:20,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:04:20,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:04:20,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:04:20,293 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:04:20,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:04:20,293 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:04:20,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:04:20,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:04:20,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:04:20,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:04:20,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:04:20,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:04:20,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:04:20,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:04:20,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:04:20,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:04:20,295 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:04:20,295 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:04:20,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:04:20,296 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 4cc4e6594048669dc8576432b007a54cfaf2cb918409d0a11b256ce036aec976 [2022-02-20 17:04:20,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:04:20,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:04:20,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:04:20,576 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:04:20,577 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:04:20,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/jm2006_variant.i [2022-02-20 17:04:20,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23651d58f/429da695f39b4350affa502b047e5bac/FLAG9746b684f [2022-02-20 17:04:21,090 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:04:21,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/jm2006_variant.i [2022-02-20 17:04:21,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23651d58f/429da695f39b4350affa502b047e5bac/FLAG9746b684f [2022-02-20 17:04:21,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23651d58f/429da695f39b4350affa502b047e5bac [2022-02-20 17:04:21,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:04:21,123 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:04:21,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:04:21,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:04:21,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:04:21,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311167f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21, skipping insertion in model container [2022-02-20 17:04:21,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:04:21,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:04:21,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/jm2006_variant.i[895,908] [2022-02-20 17:04:21,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:04:21,318 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:04:21,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/jm2006_variant.i[895,908] [2022-02-20 17:04:21,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:04:21,346 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:04:21,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21 WrapperNode [2022-02-20 17:04:21,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:04:21,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:04:21,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:04:21,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:04:21,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,387 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-02-20 17:04:21,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:04:21,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:04:21,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:04:21,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:04:21,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:04:21,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:04:21,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:04:21,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:04:21,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (1/1) ... [2022-02-20 17:04:21,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:04:21,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:04:21,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:04:21,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:04:21,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:04:21,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:04:21,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:04:21,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:04:21,548 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:04:21,549 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:04:21,674 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:04:21,679 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:04:21,680 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:04:21,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:04:21 BoogieIcfgContainer [2022-02-20 17:04:21,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:04:21,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:04:21,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:04:21,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:04:21,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:04:21" (1/3) ... [2022-02-20 17:04:21,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e5b97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:04:21, skipping insertion in model container [2022-02-20 17:04:21,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:21" (2/3) ... [2022-02-20 17:04:21,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e5b97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:04:21, skipping insertion in model container [2022-02-20 17:04:21,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:04:21" (3/3) ... [2022-02-20 17:04:21,689 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006_variant.i [2022-02-20 17:04:21,693 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:04:21,694 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:04:21,749 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:04:21,755 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:04:21,756 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:04:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:04:21,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:04:21,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:04:21,774 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:04:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:04:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash 179632146, now seen corresponding path program 1 times [2022-02-20 17:04:21,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:04:21,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398007556] [2022-02-20 17:04:21,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:04:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:04:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:22,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17#true} is VALID [2022-02-20 17:04:22,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~i~0#1;havoc main_~j~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {17#true} is VALID [2022-02-20 17:04:22,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#true} assume !!(main_~i~0#1 >= 0 && main_~i~0#1 <= 1000000); {17#true} is VALID [2022-02-20 17:04:22,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {17#true} assume !!(main_~j~0#1 >= 0);main_~x~0#1 := main_~i~0#1;main_~y~0#1 := main_~j~0#1;main_~z~0#1 := 0; {19#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)) (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))) (= |ULTIMATE.start_main_~z~0#1| 0))} is VALID [2022-02-20 17:04:22,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {19#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)) (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))) (= |ULTIMATE.start_main_~z~0#1| 0))} assume !(0 != main_~x~0#1); {20#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0)) (or (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))) (= |ULTIMATE.start_main_~z~0#1| 0))} is VALID [2022-02-20 17:04:22,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {20#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0)) (or (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))) (= |ULTIMATE.start_main_~z~0#1| 0))} assume main_~i~0#1 == main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 == -main_~z~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {21#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:04:22,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {18#false} is VALID [2022-02-20 17:04:22,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {18#false} assume !false; {18#false} is VALID [2022-02-20 17:04:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:22,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:04:22,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398007556] [2022-02-20 17:04:22,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398007556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:04:22,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:04:22,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:04:22,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415869934] [2022-02-20 17:04:22,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:04:22,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:04:22,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:04:22,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:22,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:22,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:04:22,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:04:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:04:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:04:22,210 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:22,537 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-02-20 17:04:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:04:22,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:04:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:04:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-02-20 17:04:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-02-20 17:04:22,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-02-20 17:04:22,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:22,630 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:04:22,630 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 17:04:22,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:04:22,638 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:04:22,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 52 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:04:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 17:04:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 17:04:22,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:04:22,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:22,669 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:22,669 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:22,671 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:04:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:04:22,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:22,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:22,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 17:04:22,673 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 17:04:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:22,675 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:04:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:04:22,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:22,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:22,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:04:22,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:04:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-20 17:04:22,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2022-02-20 17:04:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:04:22,679 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-20 17:04:22,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:04:22,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:04:22,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:04:22,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:04:22,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:04:22,681 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:04:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:04:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1275235031, now seen corresponding path program 1 times [2022-02-20 17:04:22,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:04:22,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568631162] [2022-02-20 17:04:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:04:22,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:04:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:22,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {109#true} is VALID [2022-02-20 17:04:22,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~i~0#1;havoc main_~j~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {109#true} is VALID [2022-02-20 17:04:22,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#true} assume !!(main_~i~0#1 >= 0 && main_~i~0#1 <= 1000000); {109#true} is VALID [2022-02-20 17:04:22,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} assume !!(main_~j~0#1 >= 0);main_~x~0#1 := main_~i~0#1;main_~y~0#1 := main_~j~0#1;main_~z~0#1 := 0; {111#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~z~0#1| 0))} is VALID [2022-02-20 17:04:22,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {111#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~z~0#1| 0))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {112#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)) (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))))} is VALID [2022-02-20 17:04:22,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {112#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)) (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))))} assume !(0 != main_~x~0#1); {113#(and (or (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))) (or (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:04:22,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {113#(and (or (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))) (or (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~j~0#1|)))} assume main_~i~0#1 == main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 == -main_~z~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {114#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:04:22,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {114#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {110#false} is VALID [2022-02-20 17:04:22,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 17:04:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:22,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:04:22,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568631162] [2022-02-20 17:04:22,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568631162] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:04:22,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048203781] [2022-02-20 17:04:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:04:22,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:04:22,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:04:22,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:04:22,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:04:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:22,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 17:04:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:22,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:04:23,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {109#true} is VALID [2022-02-20 17:04:23,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~i~0#1;havoc main_~j~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {109#true} is VALID [2022-02-20 17:04:23,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#true} assume !!(main_~i~0#1 >= 0 && main_~i~0#1 <= 1000000); {109#true} is VALID [2022-02-20 17:04:23,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} assume !!(main_~j~0#1 >= 0);main_~x~0#1 := main_~i~0#1;main_~y~0#1 := main_~j~0#1;main_~z~0#1 := 0; {127#(and (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:04:23,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {127#(and (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {131#(and (= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~z~0#1|) 0) (= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:04:23,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#(and (= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~z~0#1|) 0) (= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)))} assume !(0 != main_~x~0#1); {135#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~z~0#1|) 0) (= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:04:23,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {135#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~z~0#1|) 0) (= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)))} assume main_~i~0#1 == main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 == -main_~z~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {139#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:04:23,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {110#false} is VALID [2022-02-20 17:04:23,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 17:04:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:23,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:04:23,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 17:04:23,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {110#false} is VALID [2022-02-20 17:04:23,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(or (= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} assume main_~i~0#1 == main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 == -main_~z~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {139#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:04:23,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#(or (= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~x~0#1| 0)) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} assume !(0 != main_~x~0#1); {152#(or (= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:04:23,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {160#(or (not (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {156#(or (= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~x~0#1| 0)) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:04:23,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} assume !!(main_~j~0#1 >= 0);main_~x~0#1 := main_~i~0#1;main_~y~0#1 := main_~j~0#1;main_~z~0#1 := 0; {160#(or (not (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:04:23,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#true} assume !!(main_~i~0#1 >= 0 && main_~i~0#1 <= 1000000); {109#true} is VALID [2022-02-20 17:04:23,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~i~0#1;havoc main_~j~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {109#true} is VALID [2022-02-20 17:04:23,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {109#true} is VALID [2022-02-20 17:04:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:23,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048203781] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:04:23,297 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:04:23,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-02-20 17:04:23,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79704022] [2022-02-20 17:04:23,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:04:23,299 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:04:23,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:04:23,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:23,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:23,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:04:23,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:04:23,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:04:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:04:23,322 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:23,704 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 17:04:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:04:23,704 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:04:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:04:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2022-02-20 17:04:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2022-02-20 17:04:23,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 22 transitions. [2022-02-20 17:04:23,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:23,729 INFO L225 Difference]: With dead ends: 20 [2022-02-20 17:04:23,729 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 17:04:23,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:04:23,730 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:04:23,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 29 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:04:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 17:04:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 17:04:23,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:04:23,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:23,741 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:23,742 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:23,743 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-20 17:04:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-20 17:04:23,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:23,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:23,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-20 17:04:23,745 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-20 17:04:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:23,748 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-20 17:04:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-20 17:04:23,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:23,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:23,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:04:23,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:04:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-02-20 17:04:23,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2022-02-20 17:04:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:04:23,752 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-02-20 17:04:23,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-20 17:04:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:04:23,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:04:23,754 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:04:23,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:04:23,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:04:23,977 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:04:23,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:04:23,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1159331502, now seen corresponding path program 2 times [2022-02-20 17:04:23,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:04:23,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394184613] [2022-02-20 17:04:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:04:23,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:04:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:24,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {253#true} is VALID [2022-02-20 17:04:24,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~i~0#1;havoc main_~j~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {253#true} is VALID [2022-02-20 17:04:24,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#true} assume !!(main_~i~0#1 >= 0 && main_~i~0#1 <= 1000000); {253#true} is VALID [2022-02-20 17:04:24,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#true} assume !!(main_~j~0#1 >= 0);main_~x~0#1 := main_~i~0#1;main_~y~0#1 := main_~j~0#1;main_~z~0#1 := 0; {255#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~z~0#1| 0))} is VALID [2022-02-20 17:04:24,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {255#(and (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~z~0#1| 0))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {256#(and (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:04:24,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#(and (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {256#(and (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:04:24,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(and (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {256#(and (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:04:24,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(and (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {257#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)) (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))))} is VALID [2022-02-20 17:04:24,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|)) (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|) (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))))} assume !(0 != main_~x~0#1); {258#(and (or (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))) (or (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:04:24,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#(and (or (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (not (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 1) 0))) (or (<= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~j~0#1|)))} assume main_~i~0#1 == main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 == -main_~z~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {259#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:04:24,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {259#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {254#false} is VALID [2022-02-20 17:04:24,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {254#false} assume !false; {254#false} is VALID [2022-02-20 17:04:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:04:24,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:04:24,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394184613] [2022-02-20 17:04:24,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394184613] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:04:24,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345990401] [2022-02-20 17:04:24,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:04:24,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:04:24,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:04:24,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:04:24,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:04:24,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:04:24,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:04:24,202 WARN L261 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-20 17:04:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:24,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:04:24,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {253#true} is VALID [2022-02-20 17:04:24,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~i~0#1;havoc main_~j~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {253#true} is VALID [2022-02-20 17:04:24,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#true} assume !!(main_~i~0#1 >= 0 && main_~i~0#1 <= 1000000); {253#true} is VALID [2022-02-20 17:04:24,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#true} assume !!(main_~j~0#1 >= 0);main_~x~0#1 := main_~i~0#1;main_~y~0#1 := main_~j~0#1;main_~z~0#1 := 0; {272#(and (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:04:24,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {272#(and (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {276#(and (= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) (= |ULTIMATE.start_main_~z~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:04:24,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#(and (= |ULTIMATE.start_main_~i~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) (= |ULTIMATE.start_main_~z~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~y~0#1|)))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {280#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~j~0#1| (- 4))) (= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~x~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:04:24,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {280#(and (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~j~0#1| (- 4))) (= |ULTIMATE.start_main_~i~0#1| (+ 2 |ULTIMATE.start_main_~x~0#1|)) (= (+ (- 1) |ULTIMATE.start_main_~z~0#1|) 1))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {284#(and (= (+ |ULTIMATE.start_main_~j~0#1| (- 6)) |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~z~0#1|) (= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ (- 2) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 17:04:24,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(and (= (+ |ULTIMATE.start_main_~j~0#1| (- 6)) |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~z~0#1|) (= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ (- 2) |ULTIMATE.start_main_~i~0#1|)))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {288#(and (= (+ |ULTIMATE.start_main_~j~0#1| (- 8)) |ULTIMATE.start_main_~y~0#1|) (= (+ 2 |ULTIMATE.start_main_~x~0#1|) (+ (- 2) |ULTIMATE.start_main_~i~0#1|)) (= 3 (+ (- 1) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:04:24,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(and (= (+ |ULTIMATE.start_main_~j~0#1| (- 8)) |ULTIMATE.start_main_~y~0#1|) (= (+ 2 |ULTIMATE.start_main_~x~0#1|) (+ (- 2) |ULTIMATE.start_main_~i~0#1|)) (= 3 (+ (- 1) |ULTIMATE.start_main_~z~0#1|)))} assume !(0 != main_~x~0#1); {292#(and (= (+ |ULTIMATE.start_main_~j~0#1| (- 8)) |ULTIMATE.start_main_~y~0#1|) (= 3 (+ (- 1) |ULTIMATE.start_main_~z~0#1|)) (= (+ |ULTIMATE.start_main_~i~0#1| (- 4)) 0))} is VALID [2022-02-20 17:04:24,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(and (= (+ |ULTIMATE.start_main_~j~0#1| (- 8)) |ULTIMATE.start_main_~y~0#1|) (= 3 (+ (- 1) |ULTIMATE.start_main_~z~0#1|)) (= (+ |ULTIMATE.start_main_~i~0#1| (- 4)) 0))} assume main_~i~0#1 == main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 == -main_~z~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {296#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:04:24,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {254#false} is VALID [2022-02-20 17:04:24,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {254#false} assume !false; {254#false} is VALID [2022-02-20 17:04:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:24,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:04:24,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {254#false} assume !false; {254#false} is VALID [2022-02-20 17:04:24,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {254#false} is VALID [2022-02-20 17:04:24,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#(or (= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} assume main_~i~0#1 == main_~j~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~y~0#1 == -main_~z~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {296#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:04:24,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#(or (= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~x~0#1| 0)) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} assume !(0 != main_~x~0#1); {309#(or (= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:04:24,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {317#(or (not (= |ULTIMATE.start_main_~x~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {313#(or (= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~x~0#1| 0)) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:04:24,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#(or (not (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 1)) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (= 0 (+ (- 2) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {317#(or (not (= |ULTIMATE.start_main_~x~0#1| 1)) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:04:24,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#(or (= (+ (- 3) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= (+ (- 2) |ULTIMATE.start_main_~x~0#1|) 1)) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {321#(or (not (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 1)) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (= 0 (+ (- 2) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:04:24,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#(or (not (= |ULTIMATE.start_main_~x~0#1| 4)) (= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| (- 4)) 0) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} assume !!(0 != main_~x~0#1);main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1;main_~y~0#1 := main_~y~0#1 - 2;main_#t~post4#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {325#(or (= (+ (- 3) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) 0) (not (= (+ (- 2) |ULTIMATE.start_main_~x~0#1|) 1)) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:04:24,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#true} assume !!(main_~j~0#1 >= 0);main_~x~0#1 := main_~i~0#1;main_~y~0#1 := main_~j~0#1;main_~z~0#1 := 0; {329#(or (not (= |ULTIMATE.start_main_~x~0#1| 4)) (= (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| (- 4)) 0) (not (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:04:24,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#true} assume !!(main_~i~0#1 >= 0 && main_~i~0#1 <= 1000000); {253#true} is VALID [2022-02-20 17:04:24,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~post4#1, main_~i~0#1, main_~j~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~i~0#1;havoc main_~j~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~j~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {253#true} is VALID [2022-02-20 17:04:24,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {253#true} is VALID [2022-02-20 17:04:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:24,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345990401] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:04:24,712 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:04:24,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 20 [2022-02-20 17:04:24,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134586406] [2022-02-20 17:04:24,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:04:24,713 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 17:04:24,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:04:24,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:24,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:24,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 17:04:24,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:04:24,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 17:04:24,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:04:24,736 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:25,024 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 17:04:25,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:04:25,025 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 17:04:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:04:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-02-20 17:04:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-02-20 17:04:25,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 17 transitions. [2022-02-20 17:04:25,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:25,043 INFO L225 Difference]: With dead ends: 16 [2022-02-20 17:04:25,044 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:04:25,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2022-02-20 17:04:25,045 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:04:25,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 19 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:04:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:04:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:04:25,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:04:25,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:25,046 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:25,046 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:25,047 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:04:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:04:25,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:25,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:25,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:04:25,048 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:04:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:25,048 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:04:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:04:25,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:25,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:25,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:04:25,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:04:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:04:25,049 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-02-20 17:04:25,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:04:25,049 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:04:25,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:04:25,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:25,052 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:04:25,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:04:25,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:04:25,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:04:25,307 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:04:25,308 INFO L854 garLoopResultBuilder]: At program point L33-2(lines 33 37) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse0 (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~x~0#1|))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-02-20 17:04:25,308 INFO L858 garLoopResultBuilder]: For program point L33-3(lines 24 42) no Hoare annotation was computed. [2022-02-20 17:04:25,308 INFO L858 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-02-20 17:04:25,308 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-02-20 17:04:25,308 INFO L858 garLoopResultBuilder]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2022-02-20 17:04:25,309 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:04:25,309 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:04:25,309 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:04:25,309 INFO L858 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-02-20 17:04:25,309 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-02-20 17:04:25,309 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-02-20 17:04:25,310 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) [2022-02-20 17:04:25,310 INFO L861 garLoopResultBuilder]: At program point L41(lines 24 42) the Hoare annotation is: true [2022-02-20 17:04:25,313 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1] [2022-02-20 17:04:25,314 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:04:25,317 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:04:25,317 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:04:25,317 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 17:04:25,318 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 17:04:25,318 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:04:25,318 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:04:25,318 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:04:25,318 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:04:25,318 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-02-20 17:04:25,318 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-02-20 17:04:25,322 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-02-20 17:04:25,323 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-02-20 17:04:25,323 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:04:25,323 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:04:25,323 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 17:04:25,323 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:04:25,323 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:04:25,323 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 17:04:25,324 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:04:25,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:04:25 BoogieIcfgContainer [2022-02-20 17:04:25,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:04:25,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:04:25,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:04:25,332 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:04:25,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:04:21" (3/4) ... [2022-02-20 17:04:25,335 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:04:25,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 17:04:25,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 17:04:25,343 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:04:25,344 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:04:25,371 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:04:25,373 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:04:25,375 INFO L158 Benchmark]: Toolchain (without parser) took 4251.39ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 87.6MB in the beginning and 76.7MB in the end (delta: 10.9MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2022-02-20 17:04:25,375 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 73.4MB. Free memory is still 37.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:04:25,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.78ms. Allocated memory is still 113.2MB. Free memory was 87.3MB in the beginning and 89.7MB in the end (delta: -2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:04:25,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.61ms. Allocated memory is still 113.2MB. Free memory was 89.7MB in the beginning and 88.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:04:25,376 INFO L158 Benchmark]: Boogie Preprocessor took 22.13ms. Allocated memory is still 113.2MB. Free memory was 88.4MB in the beginning and 87.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:04:25,376 INFO L158 Benchmark]: RCFGBuilder took 269.87ms. Allocated memory is still 113.2MB. Free memory was 87.2MB in the beginning and 76.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:04:25,376 INFO L158 Benchmark]: TraceAbstraction took 3648.60ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 76.1MB in the beginning and 78.8MB in the end (delta: -2.7MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2022-02-20 17:04:25,377 INFO L158 Benchmark]: Witness Printer took 41.57ms. Allocated memory is still 140.5MB. Free memory was 78.8MB in the beginning and 76.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:04:25,379 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 73.4MB. Free memory is still 37.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.78ms. Allocated memory is still 113.2MB. Free memory was 87.3MB in the beginning and 89.7MB in the end (delta: -2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.61ms. Allocated memory is still 113.2MB. Free memory was 89.7MB in the beginning and 88.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.13ms. Allocated memory is still 113.2MB. Free memory was 88.4MB in the beginning and 87.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 269.87ms. Allocated memory is still 113.2MB. Free memory was 87.2MB in the beginning and 76.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3648.60ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 76.1MB in the beginning and 78.8MB in the end (delta: -2.7MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Witness Printer took 41.57ms. Allocated memory is still 140.5MB. Free memory was 78.8MB in the beginning and 76.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 159 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 27 mSDtfsCounter, 159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 22 HoareAnnotationTreeSize, 3 FomulaSimplifications, 77 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 153 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 16 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 3/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: !(cond == 0) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: j + x <= i + y + z && i + y + z <= j + x RESULT: Ultimate proved your program to be correct! [2022-02-20 17:04:25,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE