/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:33:43,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:33:43,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:33:43,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:33:43,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:33:43,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:33:43,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:33:43,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:33:43,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:33:43,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:33:43,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:33:43,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:33:43,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:33:43,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:33:43,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:33:43,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:33:43,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:33:43,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:33:43,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:33:43,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:33:43,224 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:33:43,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:33:43,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:33:43,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:33:43,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:33:43,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:33:43,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:33:43,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:33:43,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:33:43,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:33:43,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:33:43,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:33:43,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:33:43,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:33:43,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:33:43,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:33:43,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:33:43,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:33:43,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:33:43,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:33:43,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:33:43,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:33:43,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:33:43,263 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:33:43,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:33:43,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:33:43,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:33:43,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:33:43,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:33:43,266 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:33:43,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:33:43,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:33:43,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:33:43,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:33:43,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:33:43,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:33:43,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:33:43,267 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:33:43,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:33:43,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:33:43,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:33:43,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:33:43,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:33:43,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:33:43,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:33:43,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:33:43,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:33:43,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:33:43,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:33:43,269 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:33:43,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:33:43,270 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:33:43,270 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 01:33:43,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:33:43,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:33:43,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:33:43,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:33:43,499 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:33:43,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i [2022-04-15 01:33:43,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3542ef4ed/32b3e863847848b8b0ca4cd21b5c5b33/FLAGfee6fa564 [2022-04-15 01:33:43,875 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:33:43,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i [2022-04-15 01:33:43,880 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3542ef4ed/32b3e863847848b8b0ca4cd21b5c5b33/FLAGfee6fa564 [2022-04-15 01:33:43,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3542ef4ed/32b3e863847848b8b0ca4cd21b5c5b33 [2022-04-15 01:33:43,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:33:43,895 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:33:43,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:33:43,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:33:43,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:33:43,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:33:43" (1/1) ... [2022-04-15 01:33:43,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c86846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:43, skipping insertion in model container [2022-04-15 01:33:43,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:33:43" (1/1) ... [2022-04-15 01:33:43,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:33:43,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:33:44,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i[873,886] [2022-04-15 01:33:44,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:33:44,077 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:33:44,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark04_conjunctive.i[873,886] [2022-04-15 01:33:44,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:33:44,142 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:33:44,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:44 WrapperNode [2022-04-15 01:33:44,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:33:44,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:33:44,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:33:44,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:33:44,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:44" (1/1) ... [2022-04-15 01:33:44,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:44" (1/1) ... [2022-04-15 01:33:44,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:44" (1/1) ... [2022-04-15 01:33:44,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:44" (1/1) ... [2022-04-15 01:33:44,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:44" (1/1) ... [2022-04-15 01:33:44,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:44" (1/1) ... [2022-04-15 01:33:44,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:44" (1/1) ... [2022-04-15 01:33:44,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:33:44,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:33:44,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:33:44,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:33:44,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:44" (1/1) ... [2022-04-15 01:33:44,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:33:44,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:33:44,210 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-04-15 01:33:44,221 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-04-15 01:33:44,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:33:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:33:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:33:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:33:44,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:33:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:33:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 01:33:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 01:33:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:33:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:33:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 01:33:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 01:33:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:33:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:33:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:33:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:33:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:33:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:33:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:33:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:33:44,300 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:33:44,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:33:44,394 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:33:44,399 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:33:44,400 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:33:44,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:33:44 BoogieIcfgContainer [2022-04-15 01:33:44,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:33:44,402 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:33:44,402 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:33:44,403 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:33:44,405 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:33:44" (1/1) ... [2022-04-15 01:33:44,407 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:33:44,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:33:44 BasicIcfg [2022-04-15 01:33:44,427 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:33:44,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:33:44,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:33:44,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:33:44,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:33:43" (1/4) ... [2022-04-15 01:33:44,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7730e00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:33:44, skipping insertion in model container [2022-04-15 01:33:44,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:44" (2/4) ... [2022-04-15 01:33:44,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7730e00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:33:44, skipping insertion in model container [2022-04-15 01:33:44,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:33:44" (3/4) ... [2022-04-15 01:33:44,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7730e00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:33:44, skipping insertion in model container [2022-04-15 01:33:44,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:33:44" (4/4) ... [2022-04-15 01:33:44,434 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark04_conjunctive.iqvasr [2022-04-15 01:33:44,438 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:33:44,438 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:33:44,472 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:33:44,484 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-15 01:33:44,484 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:33:44,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:33:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:33:44,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:33:44,520 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:33:44,521 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:33:44,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:33:44,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-15 01:33:44,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:33:44,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029426918] [2022-04-15 01:33:44,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:33:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:33:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:33:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:44,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-15 01:33:44,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:33:44,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:33:44,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:33:44,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-15 01:33:44,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:33:44,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:33:44,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:33:44,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_3 |v_main_#t~nondet1_2|) (= v_main_~j~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {23#true} is VALID [2022-04-15 01:33:44,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L23-->L24-2: Formula: (and (<= 1 v_main_~n~0_5) (<= v_main_~n~0_5 v_main_~k~0_6) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:33:44,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [57] L24-2-->L24-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:33:44,770 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {24#false} is VALID [2022-04-15 01:33:44,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-15 01:33:44,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:33:44,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:33:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:33:44,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:33:44,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029426918] [2022-04-15 01:33:44,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029426918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:33:44,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:33:44,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:33:44,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461673133] [2022-04-15 01:33:44,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:33:44,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:33:44,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:33:44,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:44,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:33:44,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:33:44,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:33:44,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:33:44,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:33:44,847 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:44,946 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 01:33:44,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:33:44,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:33:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:33:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 01:33:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 01:33:44,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-15 01:33:45,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:33:45,023 INFO L225 Difference]: With dead ends: 32 [2022-04-15 01:33:45,023 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 01:33:45,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:33:45,030 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:33:45,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:33:45,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 01:33:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 01:33:45,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:33:45,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,058 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,058 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:45,062 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:33:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:33:45,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:33:45,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:33:45,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 01:33:45,063 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 01:33:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:45,067 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:33:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:33:45,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:33:45,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:33:45,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:33:45,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:33:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 01:33:45,075 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-15 01:33:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:33:45,075 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 01:33:45,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:33:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:33:45,076 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:33:45,077 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:33:45,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:33:45,077 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:33:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:33:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-15 01:33:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:33:45,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885417741] [2022-04-15 01:33:45,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:33:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:33:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:45,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:33:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:45,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {118#true} is VALID [2022-04-15 01:33:45,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:33:45,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:33:45,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:33:45,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {118#true} is VALID [2022-04-15 01:33:45,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:33:45,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:33:45,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:33:45,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_3 |v_main_#t~nondet1_2|) (= v_main_~j~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {118#true} is VALID [2022-04-15 01:33:45,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} [55] L23-->L24-2: Formula: (and (<= 1 v_main_~n~0_5) (<= v_main_~n~0_5 v_main_~k~0_6) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {123#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 01:33:45,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(<= (+ main_~j~0 1) main_~n~0)} [58] L24-2-->L24-3: Formula: (not (<= (+ v_main_~j~0_1 1) v_main_~n~0_1)) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-15 01:33:45,168 INFO L272 TraceCheckUtils]: 8: Hoare triple {119#false} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {119#false} is VALID [2022-04-15 01:33:45,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {119#false} is VALID [2022-04-15 01:33:45,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-15 01:33:45,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-15 01:33:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:33:45,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:33:45,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885417741] [2022-04-15 01:33:45,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885417741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:33:45,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:33:45,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 01:33:45,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805055675] [2022-04-15 01:33:45,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:33:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:33:45,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:33:45,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:33:45,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 01:33:45,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:33:45,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 01:33:45,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 01:33:45,185 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:45,246 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 01:33:45,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 01:33:45,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:33:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:33:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-15 01:33:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-15 01:33:45,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-15 01:33:45,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:33:45,279 INFO L225 Difference]: With dead ends: 19 [2022-04-15 01:33:45,279 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 01:33:45,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 01:33:45,286 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:33:45,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:33:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 01:33:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 01:33:45,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:33:45,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,296 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,297 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:45,298 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:33:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:33:45,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:33:45,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:33:45,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:33:45,299 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:33:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:45,301 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:33:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:33:45,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:33:45,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:33:45,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:33:45,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:33:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 01:33:45,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 01:33:45,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:33:45,304 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 01:33:45,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:33:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 01:33:45,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:33:45,305 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:33:45,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:33:45,306 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:33:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:33:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-15 01:33:45,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:33:45,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883243751] [2022-04-15 01:33:45,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:33:45,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:33:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:45,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:33:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:45,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:33:45,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:33:45,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:33:45,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_3 |v_main_#t~nondet1_2|) (= v_main_~j~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {208#true} is VALID [2022-04-15 01:33:45,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L23-->L24-2: Formula: (and (<= 1 v_main_~n~0_5) (<= v_main_~n~0_5 v_main_~k~0_6) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {213#(<= 1 main_~k~0)} is VALID [2022-04-15 01:33:45,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= 1 main_~k~0)} [59] L24-2-->L24-2: Formula: (let ((.cse0 (+ v_main_~j~0_3 1))) (and (<= .cse0 v_main_~n~0_2) (= .cse0 v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1)))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {214#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:45,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= 0 main_~k~0)} [58] L24-2-->L24-3: Formula: (not (<= (+ v_main_~j~0_1 1) v_main_~n~0_1)) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {214#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:45,442 INFO L272 TraceCheckUtils]: 9: Hoare triple {214#(<= 0 main_~k~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {215#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:33:45,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {215#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {216#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:33:45,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#(not (= __VERIFIER_assert_~cond 0))} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:33:45,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:33:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:33:45,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:33:45,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883243751] [2022-04-15 01:33:45,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883243751] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:33:45,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539557936] [2022-04-15 01:33:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:33:45,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:33:45,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:33:45,446 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-04-15 01:33:45,448 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-04-15 01:33:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:45,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 01:33:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:45,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:33:45,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:33:45,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_3 |v_main_#t~nondet1_2|) (= v_main_~j~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {208#true} is VALID [2022-04-15 01:33:45,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L23-->L24-2: Formula: (and (<= 1 v_main_~n~0_5) (<= v_main_~n~0_5 v_main_~k~0_6) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {213#(<= 1 main_~k~0)} is VALID [2022-04-15 01:33:45,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= 1 main_~k~0)} [59] L24-2-->L24-2: Formula: (let ((.cse0 (+ v_main_~j~0_3 1))) (and (<= .cse0 v_main_~n~0_2) (= .cse0 v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1)))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {214#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:45,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= 0 main_~k~0)} [58] L24-2-->L24-3: Formula: (not (<= (+ v_main_~j~0_1 1) v_main_~n~0_1)) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {214#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:45,717 INFO L272 TraceCheckUtils]: 9: Hoare triple {214#(<= 0 main_~k~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:33:45,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {248#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:33:45,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:33:45,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:33:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:33:45,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:33:45,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:33:45,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:33:45,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {248#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:33:45,903 INFO L272 TraceCheckUtils]: 9: Hoare triple {214#(<= 0 main_~k~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:33:45,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= 0 main_~k~0)} [58] L24-2-->L24-3: Formula: (not (<= (+ v_main_~j~0_1 1) v_main_~n~0_1)) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {214#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:45,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= 1 main_~k~0)} [59] L24-2-->L24-2: Formula: (let ((.cse0 (+ v_main_~j~0_3 1))) (and (<= .cse0 v_main_~n~0_2) (= .cse0 v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1)))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {214#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:45,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L23-->L24-2: Formula: (and (<= 1 v_main_~n~0_5) (<= v_main_~n~0_5 v_main_~k~0_6) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {213#(<= 1 main_~k~0)} is VALID [2022-04-15 01:33:45,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_3 |v_main_#t~nondet1_2|) (= v_main_~j~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {208#true} is VALID [2022-04-15 01:33:45,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:33:45,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:33:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:33:45,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539557936] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:33:45,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:33:45,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 01:33:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499566544] [2022-04-15 01:33:45,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:33:45,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 01:33:45,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:33:45,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:45,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:33:45,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 01:33:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:33:45,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 01:33:45,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 01:33:45,930 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:46,064 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 01:33:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 01:33:46,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 01:33:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:33:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-15 01:33:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-15 01:33:46,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2022-04-15 01:33:46,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:33:46,088 INFO L225 Difference]: With dead ends: 20 [2022-04-15 01:33:46,088 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 01:33:46,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 01:33:46,091 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:33:46,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:33:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 01:33:46,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 01:33:46,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:33:46,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:46,099 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:46,100 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:46,101 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:33:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:33:46,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:33:46,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:33:46,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 01:33:46,102 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 01:33:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:46,103 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:33:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:33:46,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:33:46,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:33:46,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:33:46,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:33:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 01:33:46,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 01:33:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:33:46,107 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 01:33:46,108 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:46,108 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:33:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 01:33:46,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:33:46,109 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:33:46,133 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-04-15 01:33:46,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:33:46,324 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:33:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:33:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash 938486524, now seen corresponding path program 2 times [2022-04-15 01:33:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:33:46,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79018940] [2022-04-15 01:33:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:33:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:33:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:33:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:46,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {390#true} is VALID [2022-04-15 01:33:46,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {390#true} {390#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:33:46,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {399#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {390#true} is VALID [2022-04-15 01:33:46,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_3 |v_main_#t~nondet1_2|) (= v_main_~j~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {390#true} is VALID [2022-04-15 01:33:46,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#true} [55] L23-->L24-2: Formula: (and (<= 1 v_main_~n~0_5) (<= v_main_~n~0_5 v_main_~k~0_6) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {395#(<= main_~n~0 (+ main_~k~0 main_~j~0))} is VALID [2022-04-15 01:33:46,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {395#(<= main_~n~0 (+ main_~k~0 main_~j~0))} [59] L24-2-->L24-2: Formula: (let ((.cse0 (+ v_main_~j~0_3 1))) (and (<= .cse0 v_main_~n~0_2) (= .cse0 v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1)))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {395#(<= main_~n~0 (+ main_~k~0 main_~j~0))} is VALID [2022-04-15 01:33:46,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#(<= main_~n~0 (+ main_~k~0 main_~j~0))} [59] L24-2-->L24-2: Formula: (let ((.cse0 (+ v_main_~j~0_3 1))) (and (<= .cse0 v_main_~n~0_2) (= .cse0 v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1)))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {396#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:46,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {396#(<= 0 main_~k~0)} [58] L24-2-->L24-3: Formula: (not (<= (+ v_main_~j~0_1 1) v_main_~n~0_1)) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {396#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:46,444 INFO L272 TraceCheckUtils]: 10: Hoare triple {396#(<= 0 main_~k~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {397#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:33:46,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {398#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:33:46,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {398#(not (= __VERIFIER_assert_~cond 0))} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-15 01:33:46,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-15 01:33:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 01:33:46,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:33:46,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79018940] [2022-04-15 01:33:46,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79018940] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:33:46,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444095000] [2022-04-15 01:33:46,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 01:33:46,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:33:46,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:33:46,448 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-04-15 01:33:46,449 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-04-15 01:33:46,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 01:33:46,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:33:46,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 01:33:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:33:46,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:33:46,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {390#true} is VALID [2022-04-15 01:33:46,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_3 |v_main_#t~nondet1_2|) (= v_main_~j~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {390#true} is VALID [2022-04-15 01:33:46,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#true} [55] L23-->L24-2: Formula: (and (<= 1 v_main_~n~0_5) (<= v_main_~n~0_5 v_main_~k~0_6) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {421#(and (<= 0 main_~j~0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-15 01:33:46,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(and (<= 0 main_~j~0) (<= main_~n~0 main_~k~0))} [59] L24-2-->L24-2: Formula: (let ((.cse0 (+ v_main_~j~0_3 1))) (and (<= .cse0 v_main_~n~0_2) (= .cse0 v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1)))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {425#(and (<= 1 main_~j~0) (<= main_~n~0 (+ main_~k~0 1)))} is VALID [2022-04-15 01:33:46,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {425#(and (<= 1 main_~j~0) (<= main_~n~0 (+ main_~k~0 1)))} [59] L24-2-->L24-2: Formula: (let ((.cse0 (+ v_main_~j~0_3 1))) (and (<= .cse0 v_main_~n~0_2) (= .cse0 v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1)))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {396#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:46,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {396#(<= 0 main_~k~0)} [58] L24-2-->L24-3: Formula: (not (<= (+ v_main_~j~0_1 1) v_main_~n~0_1)) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {396#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:46,654 INFO L272 TraceCheckUtils]: 10: Hoare triple {396#(<= 0 main_~k~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {435#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:33:46,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {439#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:33:46,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {439#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-15 01:33:46,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-15 01:33:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:33:46,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:33:46,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-15 01:33:46,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {439#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {391#false} is VALID [2022-04-15 01:33:46,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {439#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:33:46,854 INFO L272 TraceCheckUtils]: 10: Hoare triple {396#(<= 0 main_~k~0)} [60] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {435#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:33:46,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {396#(<= 0 main_~k~0)} [58] L24-2-->L24-3: Formula: (not (<= (+ v_main_~j~0_1 1) v_main_~n~0_1)) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {396#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:46,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {461#(or (<= 1 main_~k~0) (not (<= (+ main_~j~0 1) main_~n~0)))} [59] L24-2-->L24-2: Formula: (let ((.cse0 (+ v_main_~j~0_3 1))) (and (<= .cse0 v_main_~n~0_2) (= .cse0 v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1)))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {396#(<= 0 main_~k~0)} is VALID [2022-04-15 01:33:46,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(or (<= 2 main_~k~0) (< main_~n~0 (+ main_~j~0 2)))} [59] L24-2-->L24-2: Formula: (let ((.cse0 (+ v_main_~j~0_3 1))) (and (<= .cse0 v_main_~n~0_2) (= .cse0 v_main_~j~0_2) (= v_main_~k~0_2 (+ v_main_~k~0_1 1)))) InVars {main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {461#(or (<= 1 main_~k~0) (not (<= (+ main_~j~0 1) main_~n~0)))} is VALID [2022-04-15 01:33:46,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#true} [55] L23-->L24-2: Formula: (and (<= 1 v_main_~n~0_5) (<= v_main_~n~0_5 v_main_~k~0_6) (= v_main_~j~0_6 0)) InVars {main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {465#(or (<= 2 main_~k~0) (< main_~n~0 (+ main_~j~0 2)))} is VALID [2022-04-15 01:33:46,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} [52] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_3 |v_main_#t~nondet1_2|) (= v_main_~j~0_4 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~n~0] {390#true} is VALID [2022-04-15 01:33:46,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {390#true} is VALID [2022-04-15 01:33:46,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#true} is VALID [2022-04-15 01:33:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:33:46,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444095000] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:33:46,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:33:46,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-15 01:33:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62735718] [2022-04-15 01:33:46,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:33:46,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 01:33:46,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:33:46,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:46,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:33:46,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 01:33:46,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:33:46,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 01:33:46,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 01:33:46,877 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:47,065 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:33:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 01:33:47,066 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 01:33:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:33:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-15 01:33:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-15 01:33:47,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 15 transitions. [2022-04-15 01:33:47,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:33:47,087 INFO L225 Difference]: With dead ends: 15 [2022-04-15 01:33:47,087 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 01:33:47,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-15 01:33:47,088 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:33:47,088 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:33:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 01:33:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 01:33:47,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:33:47,089 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-04-15 01:33:47,089 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-04-15 01:33:47,089 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-04-15 01:33:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:47,090 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:33:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:33:47,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:33:47,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:33:47,090 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-04-15 01:33:47,090 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-04-15 01:33:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:33:47,090 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:33:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:33:47,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:33:47,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:33:47,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:33:47,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:33:47,091 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-04-15 01:33:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 01:33:47,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-15 01:33:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:33:47,091 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 01:33:47,091 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:33:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:33:47,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:33:47,094 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 01:33:47,119 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-04-15 01:33:47,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 01:33:47,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 01:33:47,366 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 01:33:47,366 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:33:47,366 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:33:47,366 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:33:47,366 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 01:33:47,366 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:33:47,366 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:33:47,367 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-15 01:33:47,367 INFO L882 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-15 01:33:47,367 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 30) no Hoare annotation was computed. [2022-04-15 01:33:47,367 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (and (<= main_~n~0 (+ main_~k~0 main_~j~0)) (<= 0 main_~k~0)) [2022-04-15 01:33:47,367 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 30) no Hoare annotation was computed. [2022-04-15 01:33:47,367 INFO L878 garLoopResultBuilder]: At program point L24-3(lines 24 27) the Hoare annotation is: (<= 0 main_~k~0) [2022-04-15 01:33:47,367 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-15 01:33:47,367 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 01:33:47,367 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-15 01:33:47,367 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-15 01:33:47,368 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-15 01:33:47,368 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-15 01:33:47,368 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-15 01:33:47,370 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 01:33:47,371 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:33:47,382 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:33:47,383 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:33:47,383 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:33:47,383 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:33:47,383 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:33:47,383 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 01:33:47,383 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:33:47,383 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:33:47,383 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:33:47,383 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:33:47,386 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:33:47,386 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:33:47,386 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 01:33:47,386 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:33:47,386 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:33:47,386 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:33:47,386 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 01:33:47,386 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 01:33:47,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:33:47 BasicIcfg [2022-04-15 01:33:47,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:33:47,395 INFO L158 Benchmark]: Toolchain (without parser) took 3500.38ms. Allocated memory was 185.6MB in the beginning and 283.1MB in the end (delta: 97.5MB). Free memory was 127.6MB in the beginning and 187.7MB in the end (delta: -60.1MB). Peak memory consumption was 38.1MB. Max. memory is 8.0GB. [2022-04-15 01:33:47,396 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory was 143.6MB in the beginning and 143.5MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:33:47,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.99ms. Allocated memory was 185.6MB in the beginning and 283.1MB in the end (delta: 97.5MB). Free memory was 127.5MB in the beginning and 256.2MB in the end (delta: -128.8MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2022-04-15 01:33:47,396 INFO L158 Benchmark]: Boogie Preprocessor took 25.92ms. Allocated memory is still 283.1MB. Free memory was 256.2MB in the beginning and 254.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 01:33:47,397 INFO L158 Benchmark]: RCFGBuilder took 230.11ms. Allocated memory is still 283.1MB. Free memory was 254.6MB in the beginning and 242.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 01:33:47,399 INFO L158 Benchmark]: IcfgTransformer took 25.64ms. Allocated memory is still 283.1MB. Free memory was 242.6MB in the beginning and 241.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 01:33:47,399 INFO L158 Benchmark]: TraceAbstraction took 2965.35ms. Allocated memory is still 283.1MB. Free memory was 240.5MB in the beginning and 187.7MB in the end (delta: 52.8MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. [2022-04-15 01:33:47,401 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.11ms. Allocated memory is still 185.6MB. Free memory was 143.6MB in the beginning and 143.5MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.99ms. Allocated memory was 185.6MB in the beginning and 283.1MB in the end (delta: 97.5MB). Free memory was 127.5MB in the beginning and 256.2MB in the end (delta: -128.8MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.92ms. Allocated memory is still 283.1MB. Free memory was 256.2MB in the beginning and 254.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 230.11ms. Allocated memory is still 283.1MB. Free memory was 254.6MB in the beginning and 242.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 25.64ms. Allocated memory is still 283.1MB. Free memory was 242.6MB in the beginning and 241.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2965.35ms. Allocated memory is still 283.1MB. Free memory was 240.5MB in the beginning and 187.7MB in the end (delta: 52.8MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. * 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: 16]: 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 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 51 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 23 HoareAnnotationTreeSize, 10 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 38 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 9 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/12 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: n <= k + j && 0 <= k RESULT: Ultimate proved your program to be correct! [2022-04-15 01:33:47,444 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...