/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-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:38:24,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:38:24,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:38:24,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:38:24,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:38:24,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:38:24,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:38:24,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:38:24,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:38:24,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:38:24,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:38:24,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:38:24,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:38:24,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:38:24,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:38:24,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:38:24,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:38:24,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:38:24,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:38:24,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:38:24,340 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:38:24,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:38:24,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:38:24,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:38:24,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:38:24,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:38:24,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:38:24,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:38:24,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:38:24,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:38:24,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:38:24,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:38:24,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:38:24,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:38:24,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:38:24,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:38:24,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:38:24,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:38:24,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:38:24,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:38:24,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:38:24,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:38:24,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:38:24,365 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:38:24,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:38:24,366 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:38:24,366 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:38:24,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:38:24,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:38:24,366 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:38:24,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:38:24,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:38:24,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:38:24,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:38:24,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:38:24,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:38:24,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:38:24,367 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:38:24,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:38:24,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:38:24,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:38:24,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:38:24,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:38:24,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:38:24,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:38:24,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:38:24,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:38:24,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:38:24,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:38:24,368 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:38:24,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:38:24,368 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:38:24,369 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-27 21:38:24,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:38:24,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:38:24,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:38:24,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:38:24,587 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:38:24,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-27 21:38:24,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc097b73/54f38a3b48d44f108db40e2574855d17/FLAG8ec0cdeb3 [2022-04-27 21:38:25,000 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:38:25,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-27 21:38:25,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc097b73/54f38a3b48d44f108db40e2574855d17/FLAG8ec0cdeb3 [2022-04-27 21:38:25,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc097b73/54f38a3b48d44f108db40e2574855d17 [2022-04-27 21:38:25,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:38:25,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:38:25,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:38:25,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:38:25,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:38:25,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f36ce95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25, skipping insertion in model container [2022-04-27 21:38:25,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:38:25,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:38:25,170 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-invgen/nested6.i[893,906] [2022-04-27 21:38:25,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:38:25,194 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:38:25,202 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-invgen/nested6.i[893,906] [2022-04-27 21:38:25,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:38:25,213 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:38:25,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25 WrapperNode [2022-04-27 21:38:25,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:38:25,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:38:25,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:38:25,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:38:25,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:38:25,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:38:25,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:38:25,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:38:25,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:38:25,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:38:25,296 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-27 21:38:25,305 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-27 21:38:25,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:38:25,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:38:25,332 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:38:25,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:38:25,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:38:25,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:38:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:38:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:38:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:38:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:38:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:38:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:38:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:38:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:38:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:38:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:38:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:38:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:38:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:38:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:38:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:38:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:38:25,381 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:38:25,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:38:25,506 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:38:25,515 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:38:25,515 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 21:38:25,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:38:25 BoogieIcfgContainer [2022-04-27 21:38:25,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:38:25,517 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:38:25,517 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:38:25,519 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:38:25,521 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:38:25" (1/1) ... [2022-04-27 21:38:25,522 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:38:25,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:38:25 BasicIcfg [2022-04-27 21:38:25,567 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:38:25,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:38:25,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:38:25,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:38:25,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:38:25" (1/4) ... [2022-04-27 21:38:25,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21287768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:38:25, skipping insertion in model container [2022-04-27 21:38:25,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:25" (2/4) ... [2022-04-27 21:38:25,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21287768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:38:25, skipping insertion in model container [2022-04-27 21:38:25,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:38:25" (3/4) ... [2022-04-27 21:38:25,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21287768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:38:25, skipping insertion in model container [2022-04-27 21:38:25,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:38:25" (4/4) ... [2022-04-27 21:38:25,572 INFO L111 eAbstractionObserver]: Analyzing ICFG nested6.iqvasr [2022-04-27 21:38:25,581 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:38:25,581 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:38:25,615 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:38:25,624 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d26d853, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@725c64c [2022-04-27 21:38:25,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:38:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:38:25,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:38:25,639 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:25,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:25,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:25,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:25,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1002152396, now seen corresponding path program 1 times [2022-04-27 21:38:25,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:25,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267271647] [2022-04-27 21:38:25,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:25,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:25,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:38:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:25,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {33#true} is VALID [2022-04-27 21:38:25,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 21:38:25,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 21:38:25,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:38:25,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {33#true} is VALID [2022-04-27 21:38:25,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 21:38:25,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 21:38:25,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 21:38:25,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {33#true} is VALID [2022-04-27 21:38:25,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 21:38:25,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 21:38:25,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#(<= main_~n~0 main_~k~0)} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 21:38:25,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(<= main_~n~0 main_~k~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 21:38:25,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(<= main_~n~0 main_~k~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 21:38:25,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(<= main_~n~0 main_~k~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {38#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 21:38:25,958 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#(<= main_~n~0 main_~k~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:38:25,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:38:25,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {34#false} is VALID [2022-04-27 21:38:25,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 21:38:25,959 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-27 21:38:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:38:25,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267271647] [2022-04-27 21:38:25,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267271647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:38:25,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:38:25,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:38:25,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423371908] [2022-04-27 21:38:25,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:38:25,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-27 21:38:25,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:38:25,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-27 21:38:25,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:25,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:38:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:38:26,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:38:26,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:38:26,023 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 22 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-27 21:38:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:26,349 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2022-04-27 21:38:26,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:38:26,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-04-27 21:38:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:38:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-27 21:38:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-27 21:38:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-27 21:38:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-27 21:38:26,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2022-04-27 21:38:26,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:26,422 INFO L225 Difference]: With dead ends: 58 [2022-04-27 21:38:26,422 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 21:38:26,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:38:26,426 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:38:26,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 52 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:38:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 21:38:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 21:38:26,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:38:26,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:38:26,449 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:38:26,449 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:38:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:26,452 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 21:38:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 21:38:26,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:26,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:26,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 21:38:26,453 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 21:38:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:26,455 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 21:38:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 21:38:26,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:26,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:26,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:38:26,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:38:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:38:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-27 21:38:26,458 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2022-04-27 21:38:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:38:26,458 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-27 21:38:26,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-27 21:38:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 21:38:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:38:26,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:26,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:26,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:38:26,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1031567308, now seen corresponding path program 1 times [2022-04-27 21:38:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:26,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170190120] [2022-04-27 21:38:26,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:26,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:38:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:26,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {231#true} is VALID [2022-04-27 21:38:26,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:38:26,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:38:26,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:38:26,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {231#true} is VALID [2022-04-27 21:38:26,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:38:26,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:38:26,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:38:26,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {231#true} is VALID [2022-04-27 21:38:26,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:38:26,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:38:26,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {231#true} is VALID [2022-04-27 21:38:26,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {236#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-27 21:38:26,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {236#(<= (* main_~i~0 2) main_~j~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {236#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-27 21:38:26,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {236#(<= (* main_~i~0 2) main_~j~0)} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {237#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-27 21:38:26,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#(<= (* main_~i~0 2) main_~k~0)} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {237#(<= (* main_~i~0 2) main_~k~0)} is VALID [2022-04-27 21:38:26,530 INFO L272 TraceCheckUtils]: 13: Hoare triple {237#(<= (* main_~i~0 2) main_~k~0)} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:38:26,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {238#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {239#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:38:26,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {232#false} is VALID [2022-04-27 21:38:26,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {232#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:38:26,531 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-27 21:38:26,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:38:26,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170190120] [2022-04-27 21:38:26,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170190120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:38:26,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:38:26,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:38:26,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422613433] [2022-04-27 21:38:26,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:38:26,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-27 21:38:26,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:38:26,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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-27 21:38:26,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:26,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:38:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:38:26,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:38:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:38:26,544 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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-27 21:38:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:26,923 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 21:38:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:38:26,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-27 21:38:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:38:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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-27 21:38:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-27 21:38:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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-27 21:38:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-27 21:38:26,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-27 21:38:26,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:26,967 INFO L225 Difference]: With dead ends: 41 [2022-04-27 21:38:26,967 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 21:38:26,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:38:26,968 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:38:26,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:38:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 21:38:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-27 21:38:26,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:38:26,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:38:26,983 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:38:26,983 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:38:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:26,985 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 21:38:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 21:38:26,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:26,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:26,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-27 21:38:26,987 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-27 21:38:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:26,988 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 21:38:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 21:38:26,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:26,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:26,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:38:26,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:38:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:38:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-27 21:38:26,991 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-04-27 21:38:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:38:26,992 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-27 21:38:26,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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-27 21:38:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 21:38:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 21:38:26,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:26,993 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:26,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:38:26,993 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1187235258, now seen corresponding path program 1 times [2022-04-27 21:38:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:26,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976327711] [2022-04-27 21:38:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:38:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:27,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {434#true} is VALID [2022-04-27 21:38:27,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-27 21:38:27,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-27 21:38:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 21:38:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:27,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {434#true} [130] __VERIFIER_assertENTRY-->L18: 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] {434#true} is VALID [2022-04-27 21:38:27,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-27 21:38:27,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-27 21:38:27,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {439#(<= main_~k~0 main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:27,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:38:27,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {434#true} is VALID [2022-04-27 21:38:27,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-27 21:38:27,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-27 21:38:27,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-27 21:38:27,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {434#true} is VALID [2022-04-27 21:38:27,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {434#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-27 21:38:27,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:27,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#(<= main_~k~0 main_~n~0)} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:27,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#(<= main_~k~0 main_~n~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:27,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {439#(<= main_~k~0 main_~n~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:27,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#(<= main_~k~0 main_~n~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:27,066 INFO L272 TraceCheckUtils]: 12: Hoare triple {439#(<= main_~k~0 main_~n~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {434#true} is VALID [2022-04-27 21:38:27,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} [130] __VERIFIER_assertENTRY-->L18: 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] {434#true} is VALID [2022-04-27 21:38:27,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-27 21:38:27,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {434#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-27 21:38:27,067 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {434#true} {439#(<= main_~k~0 main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {439#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:27,068 INFO L272 TraceCheckUtils]: 17: Hoare triple {439#(<= main_~k~0 main_~n~0)} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {444#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:38:27,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {444#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {445#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:38:27,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {445#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {435#false} is VALID [2022-04-27 21:38:27,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {435#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-27 21:38:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:38:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:38:27,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976327711] [2022-04-27 21:38:27,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976327711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:38:27,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:38:27,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:38:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763976117] [2022-04-27 21:38:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:38:27,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 21:38:27,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:38:27,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:27,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:27,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:38:27,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:38:27,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:38:27,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:38:27,091 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:27,342 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-04-27 21:38:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:38:27,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 21:38:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:38:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 21:38:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 21:38:27,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-27 21:38:27,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:27,384 INFO L225 Difference]: With dead ends: 46 [2022-04-27 21:38:27,384 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 21:38:27,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:38:27,386 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:38:27,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 42 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:38:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 21:38:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 21:38:27,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:38:27,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 21:38:27,406 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 21:38:27,406 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 21:38:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:27,409 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 21:38:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 21:38:27,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:27,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:27,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-27 21:38:27,413 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-27 21:38:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:27,416 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 21:38:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 21:38:27,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:27,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:27,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:38:27,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:38:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 21:38:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-27 21:38:27,419 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2022-04-27 21:38:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:38:27,419 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-27 21:38:27,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 21:38:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 21:38:27,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:27,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:27,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:38:27,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:27,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1420692427, now seen corresponding path program 1 times [2022-04-27 21:38:27,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:27,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476981937] [2022-04-27 21:38:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:27,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:27,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:38:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:27,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {671#true} is VALID [2022-04-27 21:38:27,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {671#true} {671#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-27 21:38:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:27,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {671#true} [130] __VERIFIER_assertENTRY-->L18: 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] {671#true} is VALID [2022-04-27 21:38:27,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {671#true} {678#(<= (+ main_~k~0 1) main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:27,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {671#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:38:27,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {671#true} is VALID [2022-04-27 21:38:27,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {671#true} {671#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {671#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {671#true} is VALID [2022-04-27 21:38:27,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {671#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {671#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {676#(= main_~i~0 0)} is VALID [2022-04-27 21:38:27,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {676#(= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {677#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:38:27,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {677#(<= (+ main_~j~0 1) main_~n~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {677#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:38:27,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {677#(<= (+ main_~j~0 1) main_~n~0)} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:27,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:27,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:27,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:27,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:27,526 INFO L272 TraceCheckUtils]: 16: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {671#true} is VALID [2022-04-27 21:38:27,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {671#true} [130] __VERIFIER_assertENTRY-->L18: 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] {671#true} is VALID [2022-04-27 21:38:27,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {671#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {671#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:27,527 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {671#true} {678#(<= (+ main_~k~0 1) main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {678#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:27,527 INFO L272 TraceCheckUtils]: 21: Hoare triple {678#(<= (+ main_~k~0 1) main_~n~0)} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {683#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:38:27,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {683#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {684#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:38:27,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {684#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {672#false} is VALID [2022-04-27 21:38:27,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {672#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#false} is VALID [2022-04-27 21:38:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:38:27,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:38:27,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476981937] [2022-04-27 21:38:27,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476981937] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:38:27,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349890994] [2022-04-27 21:38:27,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:27,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:38:27,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:38:27,538 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-27 21:38:27,541 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-27 21:38:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:27,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 21:38:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:27,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:38:28,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {671#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:28,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#true} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {671#true} is VALID [2022-04-27 21:38:28,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:28,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {671#true} {671#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:28,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {671#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:28,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {671#true} is VALID [2022-04-27 21:38:28,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {671#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:28,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 21:38:28,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {671#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {713#(<= main_~i~0 0)} is VALID [2022-04-27 21:38:28,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(<= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {717#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} is VALID [2022-04-27 21:38:28,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {717#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} is VALID [2022-04-27 21:38:28,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(and (< (div (- main_~j~0) (- 2)) main_~n~0) (<= (div (- main_~j~0) (- 2)) 0))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {724#(and (<= (div (* (- 1) main_~k~0) (- 2)) 0) (< (div (* (- 1) main_~k~0) (- 2)) main_~n~0))} is VALID [2022-04-27 21:38:28,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#(and (<= (div (* (- 1) main_~k~0) (- 2)) 0) (< (div (* (- 1) main_~k~0) (- 2)) main_~n~0))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {672#false} is VALID [2022-04-27 21:38:28,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {672#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {672#false} is VALID [2022-04-27 21:38:28,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {672#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {672#false} is VALID [2022-04-27 21:38:28,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {672#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {672#false} is VALID [2022-04-27 21:38:28,824 INFO L272 TraceCheckUtils]: 16: Hoare triple {672#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {672#false} is VALID [2022-04-27 21:38:28,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {672#false} [130] __VERIFIER_assertENTRY-->L18: 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] {672#false} is VALID [2022-04-27 21:38:28,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {672#false} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {672#false} is VALID [2022-04-27 21:38:28,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {672#false} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#false} is VALID [2022-04-27 21:38:28,824 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {672#false} {672#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {672#false} is VALID [2022-04-27 21:38:28,824 INFO L272 TraceCheckUtils]: 21: Hoare triple {672#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {672#false} is VALID [2022-04-27 21:38:28,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {672#false} [130] __VERIFIER_assertENTRY-->L18: 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] {672#false} is VALID [2022-04-27 21:38:28,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {672#false} [132] L18-->L19: 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[] {672#false} is VALID [2022-04-27 21:38:28,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {672#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#false} is VALID [2022-04-27 21:38:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:38:28,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:38:28,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349890994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:38:28,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 21:38:28,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-27 21:38:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130147665] [2022-04-27 21:38:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:38:28,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-27 21:38:28,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:38:28,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:28,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:28,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:38:28,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:38:28,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:38:28,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:38:28,842 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:29,089 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2022-04-27 21:38:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:38:29,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-27 21:38:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:38:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-27 21:38:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-27 21:38:29,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-04-27 21:38:29,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:29,160 INFO L225 Difference]: With dead ends: 107 [2022-04-27 21:38:29,160 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 21:38:29,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:38:29,162 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:38:29,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 89 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:38:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 21:38:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 48. [2022-04-27 21:38:29,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:38:29,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 21:38:29,204 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 21:38:29,204 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 21:38:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:29,207 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-27 21:38:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-27 21:38:29,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:29,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:29,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 72 states. [2022-04-27 21:38:29,209 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 72 states. [2022-04-27 21:38:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:29,214 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-27 21:38:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-27 21:38:29,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:29,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:29,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:38:29,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:38:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 21:38:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-27 21:38:29,216 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2022-04-27 21:38:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:38:29,216 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-27 21:38:29,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 21:38:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 21:38:29,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:29,217 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:29,236 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-27 21:38:29,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:38:29,428 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1754984885, now seen corresponding path program 1 times [2022-04-27 21:38:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:29,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055333887] [2022-04-27 21:38:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:29,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:38:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:29,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {1155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {1135#true} is VALID [2022-04-27 21:38:29,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1135#true} {1135#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 21:38:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:29,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {1135#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1135#true} is VALID [2022-04-27 21:38:29,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1147#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:29,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 21:38:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:29,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {1135#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1135#true} is VALID [2022-04-27 21:38:29,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1148#(<= main_~k~0 main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:29,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {1135#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:38:29,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {1135#true} is VALID [2022-04-27 21:38:29,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1135#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {1135#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {1135#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1135#true} is VALID [2022-04-27 21:38:29,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {1135#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {1135#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {1135#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1140#(= main_~i~0 0)} is VALID [2022-04-27 21:38:29,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {1140#(= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1141#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:29,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1141#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:29,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {1141#(and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (= main_~i~0 0))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-27 21:38:29,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-27 21:38:29,560 INFO L272 TraceCheckUtils]: 13: Hoare triple {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1135#true} is VALID [2022-04-27 21:38:29,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {1135#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1135#true} is VALID [2022-04-27 21:38:29,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {1135#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {1135#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,562 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1135#true} {1142#(and (= main_~i~0 0) (<= (+ main_~k~0 1) (+ main_~i~0 main_~n~0)))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1147#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:29,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#(<= (+ main_~k~0 1) main_~n~0)} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:29,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {1148#(<= main_~k~0 main_~n~0)} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:29,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {1148#(<= main_~k~0 main_~n~0)} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:29,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {1148#(<= main_~k~0 main_~n~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:29,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {1148#(<= main_~k~0 main_~n~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:29,564 INFO L272 TraceCheckUtils]: 23: Hoare triple {1148#(<= main_~k~0 main_~n~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1135#true} is VALID [2022-04-27 21:38:29,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {1135#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1135#true} is VALID [2022-04-27 21:38:29,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {1135#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {1135#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,564 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1135#true} {1148#(<= main_~k~0 main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1148#(<= main_~k~0 main_~n~0)} is VALID [2022-04-27 21:38:29,565 INFO L272 TraceCheckUtils]: 28: Hoare triple {1148#(<= main_~k~0 main_~n~0)} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:38:29,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {1153#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {1154#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:38:29,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {1154#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {1136#false} is VALID [2022-04-27 21:38:29,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {1136#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#false} is VALID [2022-04-27 21:38:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 21:38:29,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:38:29,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055333887] [2022-04-27 21:38:29,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055333887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:38:29,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626845770] [2022-04-27 21:38:29,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:29,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:38:29,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:38:29,568 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-27 21:38:29,572 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-27 21:38:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:29,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 21:38:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:29,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:38:29,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {1135#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#true} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {1135#true} is VALID [2022-04-27 21:38:29,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1135#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {1135#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {1135#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1135#true} is VALID [2022-04-27 21:38:29,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {1135#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {1135#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {1135#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1135#true} is VALID [2022-04-27 21:38:29,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {1135#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1135#true} is VALID [2022-04-27 21:38:29,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {1135#true} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {1135#true} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 21:38:29,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(<= main_~k~0 main_~j~0)} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 21:38:29,780 INFO L272 TraceCheckUtils]: 13: Hoare triple {1192#(<= main_~k~0 main_~j~0)} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1135#true} is VALID [2022-04-27 21:38:29,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {1135#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1135#true} is VALID [2022-04-27 21:38:29,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {1135#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {1135#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,782 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1135#true} {1192#(<= main_~k~0 main_~j~0)} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 21:38:29,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(<= main_~k~0 main_~j~0)} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1214#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2022-04-27 21:38:29,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {1214#(<= main_~k~0 (+ main_~j~0 1))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1218#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2022-04-27 21:38:29,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {1218#(<= main_~n~0 (+ main_~j~0 1))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1222#(<= main_~n~0 main_~j~0)} is VALID [2022-04-27 21:38:29,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {1222#(<= main_~n~0 main_~j~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1136#false} is VALID [2022-04-27 21:38:29,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1136#false} is VALID [2022-04-27 21:38:29,789 INFO L272 TraceCheckUtils]: 23: Hoare triple {1136#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1136#false} is VALID [2022-04-27 21:38:29,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {1136#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1136#false} is VALID [2022-04-27 21:38:29,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#false} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1136#false} is VALID [2022-04-27 21:38:29,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#false} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#false} is VALID [2022-04-27 21:38:29,789 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1136#false} {1136#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1136#false} is VALID [2022-04-27 21:38:29,789 INFO L272 TraceCheckUtils]: 28: Hoare triple {1136#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1136#false} is VALID [2022-04-27 21:38:29,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {1136#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1136#false} is VALID [2022-04-27 21:38:29,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {1136#false} [132] L18-->L19: 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[] {1136#false} is VALID [2022-04-27 21:38:29,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {1136#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#false} is VALID [2022-04-27 21:38:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:38:29,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:38:29,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {1136#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#false} is VALID [2022-04-27 21:38:29,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {1136#false} [132] L18-->L19: 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[] {1136#false} is VALID [2022-04-27 21:38:29,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {1136#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1136#false} is VALID [2022-04-27 21:38:29,902 INFO L272 TraceCheckUtils]: 28: Hoare triple {1136#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1136#false} is VALID [2022-04-27 21:38:29,903 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1135#true} {1136#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1136#false} is VALID [2022-04-27 21:38:29,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {1135#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {1135#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {1135#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1135#true} is VALID [2022-04-27 21:38:29,903 INFO L272 TraceCheckUtils]: 23: Hoare triple {1136#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1135#true} is VALID [2022-04-27 21:38:29,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1136#false} is VALID [2022-04-27 21:38:29,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {1222#(<= main_~n~0 main_~j~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1136#false} is VALID [2022-04-27 21:38:29,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {1218#(<= main_~n~0 (+ main_~j~0 1))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1222#(<= main_~n~0 main_~j~0)} is VALID [2022-04-27 21:38:29,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {1214#(<= main_~k~0 (+ main_~j~0 1))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1218#(<= main_~n~0 (+ main_~j~0 1))} is VALID [2022-04-27 21:38:29,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(<= main_~k~0 main_~j~0)} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1214#(<= main_~k~0 (+ main_~j~0 1))} is VALID [2022-04-27 21:38:29,907 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1135#true} {1192#(<= main_~k~0 main_~j~0)} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 21:38:29,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {1135#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {1135#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {1135#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1135#true} is VALID [2022-04-27 21:38:29,908 INFO L272 TraceCheckUtils]: 13: Hoare triple {1192#(<= main_~k~0 main_~j~0)} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1135#true} is VALID [2022-04-27 21:38:29,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(<= main_~k~0 main_~j~0)} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 21:38:29,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {1135#true} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1192#(<= main_~k~0 main_~j~0)} is VALID [2022-04-27 21:38:29,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {1135#true} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {1135#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1135#true} is VALID [2022-04-27 21:38:29,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {1135#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1135#true} is VALID [2022-04-27 21:38:29,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {1135#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {1135#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {1135#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1135#true} is VALID [2022-04-27 21:38:29,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {1135#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1135#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {1135#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {1135#true} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {1135#true} is VALID [2022-04-27 21:38:29,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {1135#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-27 21:38:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 21:38:29,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626845770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:38:29,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:38:29,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-27 21:38:29,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750653412] [2022-04-27 21:38:29,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:38:29,914 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2022-04-27 21:38:29,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:38:29,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 21:38:29,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:29,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 21:38:29,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:38:29,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 21:38:29,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:38:29,949 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 21:38:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:31,147 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-27 21:38:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 21:38:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2022-04-27 21:38:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:38:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 21:38:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 114 transitions. [2022-04-27 21:38:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 21:38:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 114 transitions. [2022-04-27 21:38:31,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 114 transitions. [2022-04-27 21:38:31,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:31,244 INFO L225 Difference]: With dead ends: 118 [2022-04-27 21:38:31,244 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 21:38:31,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 21:38:31,246 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 87 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 21:38:31,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 66 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 21:38:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 21:38:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2022-04-27 21:38:31,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:38:31,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 21:38:31,339 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 21:38:31,339 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 21:38:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:31,342 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-27 21:38:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-27 21:38:31,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:31,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:31,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 94 states. [2022-04-27 21:38:31,343 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 94 states. [2022-04-27 21:38:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:31,345 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-27 21:38:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-27 21:38:31,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:31,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:31,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:38:31,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:38:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 21:38:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2022-04-27 21:38:31,350 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 32 [2022-04-27 21:38:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:38:31,350 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2022-04-27 21:38:31,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 21:38:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2022-04-27 21:38:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 21:38:31,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:31,353 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:31,369 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-27 21:38:31,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:38:31,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:31,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1763990758, now seen corresponding path program 1 times [2022-04-27 21:38:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:31,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781088793] [2022-04-27 21:38:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:31,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:38:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:31,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {1875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {1856#true} is VALID [2022-04-27 21:38:31,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1856#true} {1856#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 21:38:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:31,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {1856#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1856#true} is VALID [2022-04-27 21:38:31,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 21:38:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:31,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {1856#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1856#true} is VALID [2022-04-27 21:38:31,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1857#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1857#false} is VALID [2022-04-27 21:38:31,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {1856#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:38:31,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {1856#true} is VALID [2022-04-27 21:38:31,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {1856#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1856#true} is VALID [2022-04-27 21:38:31,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {1856#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1861#(= main_~i~0 0)} is VALID [2022-04-27 21:38:31,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {1861#(= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1862#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:31,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {1862#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1862#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:31,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {1862#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:31,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:31,691 INFO L272 TraceCheckUtils]: 13: Hoare triple {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1856#true} is VALID [2022-04-27 21:38:31,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {1856#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1856#true} is VALID [2022-04-27 21:38:31,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {1856#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,707 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1856#true} {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:31,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {1863#(and (= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1868#(and (<= main_~k~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:31,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {1868#(and (<= main_~k~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 21:38:31,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 21:38:31,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 21:38:31,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {1869#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1870#(<= main_~n~0 main_~i~0)} is VALID [2022-04-27 21:38:31,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {1870#(<= main_~n~0 main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1857#false} is VALID [2022-04-27 21:38:31,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {1857#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:31,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {1857#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1857#false} is VALID [2022-04-27 21:38:31,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {1857#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:31,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {1857#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1857#false} is VALID [2022-04-27 21:38:31,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {1857#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:31,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {1857#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1857#false} is VALID [2022-04-27 21:38:31,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {1857#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1857#false} is VALID [2022-04-27 21:38:31,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {1857#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:31,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {1857#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1857#false} is VALID [2022-04-27 21:38:31,711 INFO L272 TraceCheckUtils]: 33: Hoare triple {1857#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1856#true} is VALID [2022-04-27 21:38:31,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {1856#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1856#true} is VALID [2022-04-27 21:38:31,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {1856#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {1856#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:31,711 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1856#true} {1857#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1857#false} is VALID [2022-04-27 21:38:31,712 INFO L272 TraceCheckUtils]: 38: Hoare triple {1857#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1857#false} is VALID [2022-04-27 21:38:31,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {1857#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1857#false} is VALID [2022-04-27 21:38:31,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {1857#false} [132] L18-->L19: 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[] {1857#false} is VALID [2022-04-27 21:38:31,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {1857#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 21:38:31,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:38:31,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781088793] [2022-04-27 21:38:31,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781088793] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:38:31,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503589780] [2022-04-27 21:38:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:31,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:38:31,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:38:31,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:38:31,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 21:38:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:31,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 21:38:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:31,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:38:32,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {1856#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {1856#true} is VALID [2022-04-27 21:38:32,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {1856#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1856#true} is VALID [2022-04-27 21:38:32,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {1856#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1903#(<= main_~i~0 0)} is VALID [2022-04-27 21:38:32,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {1903#(<= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1907#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:32,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {1907#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1907#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:32,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {1907#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:32,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:32,266 INFO L272 TraceCheckUtils]: 13: Hoare triple {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1856#true} is VALID [2022-04-27 21:38:32,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {1856#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1856#true} is VALID [2022-04-27 21:38:32,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {1856#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,266 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1856#true} {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:32,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {1914#(and (<= main_~i~0 0) (<= main_~k~0 (* main_~i~0 2)))} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1936#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 21:38:32,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {1936#(and (<= main_~i~0 0) (<= main_~k~0 (+ (* main_~i~0 2) 1)))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 21:38:32,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 21:38:32,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 21:38:32,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {1940#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1950#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} is VALID [2022-04-27 21:38:32,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {1950#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1857#false} is VALID [2022-04-27 21:38:32,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {1857#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {1857#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1857#false} is VALID [2022-04-27 21:38:32,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {1857#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {1857#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1857#false} is VALID [2022-04-27 21:38:32,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {1857#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {1857#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1857#false} is VALID [2022-04-27 21:38:32,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {1857#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1857#false} is VALID [2022-04-27 21:38:32,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {1857#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {1857#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1857#false} is VALID [2022-04-27 21:38:32,271 INFO L272 TraceCheckUtils]: 33: Hoare triple {1857#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1857#false} is VALID [2022-04-27 21:38:32,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {1857#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1857#false} is VALID [2022-04-27 21:38:32,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {1857#false} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {1857#false} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,271 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1857#false} {1857#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1857#false} is VALID [2022-04-27 21:38:32,271 INFO L272 TraceCheckUtils]: 38: Hoare triple {1857#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1857#false} is VALID [2022-04-27 21:38:32,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {1857#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1857#false} is VALID [2022-04-27 21:38:32,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {1857#false} [132] L18-->L19: 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[] {1857#false} is VALID [2022-04-27 21:38:32,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {1857#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 21:38:32,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:38:32,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {1857#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {1857#false} [132] L18-->L19: 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[] {1857#false} is VALID [2022-04-27 21:38:32,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {1857#false} [130] __VERIFIER_assertENTRY-->L18: 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] {1857#false} is VALID [2022-04-27 21:38:32,434 INFO L272 TraceCheckUtils]: 38: Hoare triple {1857#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1857#false} is VALID [2022-04-27 21:38:32,434 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1856#true} {1857#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1857#false} is VALID [2022-04-27 21:38:32,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {1856#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {1856#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {1856#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1856#true} is VALID [2022-04-27 21:38:32,435 INFO L272 TraceCheckUtils]: 33: Hoare triple {1857#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1856#true} is VALID [2022-04-27 21:38:32,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {1857#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1857#false} is VALID [2022-04-27 21:38:32,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {1857#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {1857#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1857#false} is VALID [2022-04-27 21:38:32,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {1857#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1857#false} is VALID [2022-04-27 21:38:32,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {1857#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {1857#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {1857#false} is VALID [2022-04-27 21:38:32,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {1857#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {1857#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {1857#false} is VALID [2022-04-27 21:38:32,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {1857#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {1857#false} is VALID [2022-04-27 21:38:32,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {1870#(<= main_~n~0 main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1857#false} is VALID [2022-04-27 21:38:32,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {2065#(<= main_~n~0 (+ main_~i~0 1))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {1870#(<= main_~n~0 main_~i~0)} is VALID [2022-04-27 21:38:32,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#(<= main_~n~0 (+ main_~i~0 1))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2065#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-27 21:38:32,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {2065#(<= main_~n~0 (+ main_~i~0 1))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2065#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-27 21:38:32,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {2075#(<= main_~k~0 (+ main_~i~0 1))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2065#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-27 21:38:32,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {2079#(<= main_~k~0 main_~i~0)} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {2075#(<= main_~k~0 (+ main_~i~0 1))} is VALID [2022-04-27 21:38:32,439 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1856#true} {2079#(<= main_~k~0 main_~i~0)} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {2079#(<= main_~k~0 main_~i~0)} is VALID [2022-04-27 21:38:32,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {1856#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {1856#true} [130] __VERIFIER_assertENTRY-->L18: 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] {1856#true} is VALID [2022-04-27 21:38:32,439 INFO L272 TraceCheckUtils]: 13: Hoare triple {2079#(<= main_~k~0 main_~i~0)} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {1856#true} is VALID [2022-04-27 21:38:32,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {2079#(<= main_~k~0 main_~i~0)} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {2079#(<= main_~k~0 main_~i~0)} is VALID [2022-04-27 21:38:32,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {2101#(<= main_~j~0 main_~i~0)} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2079#(<= main_~k~0 main_~i~0)} is VALID [2022-04-27 21:38:32,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {2101#(<= main_~j~0 main_~i~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2101#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 21:38:32,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {1903#(<= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2101#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 21:38:32,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1903#(<= main_~i~0 0)} is VALID [2022-04-27 21:38:32,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {1856#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {1856#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1856#true} is VALID [2022-04-27 21:38:32,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {1856#true} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {1856#true} is VALID [2022-04-27 21:38:32,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {1856#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-27 21:38:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 21:38:32,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503589780] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:38:32,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:38:32,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-27 21:38:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383104002] [2022-04-27 21:38:32,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:38:32,443 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-27 21:38:32,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:38:32,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 21:38:32,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:32,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 21:38:32,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:38:32,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 21:38:32,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-27 21:38:32,482 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 21:38:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:33,263 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2022-04-27 21:38:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:38:33,263 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-27 21:38:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:38:33,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 21:38:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-04-27 21:38:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 21:38:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-04-27 21:38:33,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 93 transitions. [2022-04-27 21:38:33,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:33,347 INFO L225 Difference]: With dead ends: 129 [2022-04-27 21:38:33,347 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 21:38:33,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-27 21:38:33,348 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 92 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:38:33,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 45 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:38:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 21:38:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2022-04-27 21:38:33,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:38:33,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 21:38:33,483 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 21:38:33,483 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 21:38:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:33,485 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-27 21:38:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-27 21:38:33,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:33,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:33,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 82 states. [2022-04-27 21:38:33,486 INFO L87 Difference]: Start difference. First operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 82 states. [2022-04-27 21:38:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:33,489 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-27 21:38:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-27 21:38:33,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:33,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:33,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:38:33,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:38:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 21:38:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-27 21:38:33,491 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 42 [2022-04-27 21:38:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:38:33,491 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-27 21:38:33,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 21:38:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-27 21:38:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 21:38:33,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:33,492 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:33,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 21:38:33,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:38:33,700 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1192666941, now seen corresponding path program 1 times [2022-04-27 21:38:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:33,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319523963] [2022-04-27 21:38:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:33,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:38:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:33,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {2636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {2614#true} is VALID [2022-04-27 21:38:33,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2614#true} {2614#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 21:38:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:33,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:33,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:33,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 21:38:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:33,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:33,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-27 21:38:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:33,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:33,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2615#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2615#false} is VALID [2022-04-27 21:38:33,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {2614#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:38:33,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {2636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {2614#true} is VALID [2022-04-27 21:38:33,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2614#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {2614#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {2614#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:33,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {2614#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {2614#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {2614#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {2619#(= main_~i~0 0)} is VALID [2022-04-27 21:38:33,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {2619#(= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:33,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:33,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:33,788 INFO L272 TraceCheckUtils]: 12: Hoare triple {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:33,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:33,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,789 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2614#true} {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:33,790 INFO L272 TraceCheckUtils]: 17: Hoare triple {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:33,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:33,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,790 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2614#true} {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:33,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {2620#(and (<= main_~j~0 (* main_~i~0 2)) (= main_~i~0 0))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2629#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} is VALID [2022-04-27 21:38:33,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (= main_~i~0 0))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2630#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {2630#(and (= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2631#(<= main_~n~0 main_~i~0)} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {2631#(<= main_~n~0 main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2615#false} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {2615#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {2615#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2615#false} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {2615#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {2615#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2615#false} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {2615#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {2615#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2615#false} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {2615#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2615#false} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {2615#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:33,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {2615#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2615#false} is VALID [2022-04-27 21:38:33,792 INFO L272 TraceCheckUtils]: 35: Hoare triple {2615#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:33,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:33,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:33,793 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2614#true} {2615#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2615#false} is VALID [2022-04-27 21:38:33,793 INFO L272 TraceCheckUtils]: 40: Hoare triple {2615#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2615#false} is VALID [2022-04-27 21:38:33,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {2615#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2615#false} is VALID [2022-04-27 21:38:33,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {2615#false} [132] L18-->L19: 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[] {2615#false} is VALID [2022-04-27 21:38:33,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {2615#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 21:38:33,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:38:33,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319523963] [2022-04-27 21:38:33,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319523963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:38:33,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124223511] [2022-04-27 21:38:33,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:33,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:38:33,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:38:33,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:38:33,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 21:38:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:33,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 21:38:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:33,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:38:34,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {2614#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {2614#true} is VALID [2022-04-27 21:38:34,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2614#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {2614#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {2614#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:34,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {2614#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {2614#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {2614#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {2664#(<= main_~i~0 0)} is VALID [2022-04-27 21:38:34,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {2664#(<= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:34,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:34,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:34,260 INFO L272 TraceCheckUtils]: 12: Hoare triple {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:34,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:34,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,261 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2614#true} {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:34,261 INFO L272 TraceCheckUtils]: 17: Hoare triple {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:34,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:34,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,262 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2614#true} {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:34,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {2668#(and (<= main_~i~0 0) (<= main_~j~0 (* main_~i~0 2)))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2708#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (<= main_~i~0 0))} is VALID [2022-04-27 21:38:34,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {2708#(and (<= main_~j~0 (+ (* main_~i~0 2) 1)) (<= main_~i~0 0))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2712#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} is VALID [2022-04-27 21:38:34,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {2712#(and (<= main_~i~0 0) (<= main_~n~0 (+ (* main_~i~0 2) 1)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2716#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} is VALID [2022-04-27 21:38:34,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {2716#(and (<= (+ (div (+ (* (- 1) main_~n~0) 1) (- 2)) 1) main_~i~0) (<= (div (+ (* (- 1) main_~n~0) 1) (- 2)) 0))} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2615#false} is VALID [2022-04-27 21:38:34,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {2615#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {2615#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2615#false} is VALID [2022-04-27 21:38:34,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {2615#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {2615#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2615#false} is VALID [2022-04-27 21:38:34,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {2615#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {2615#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2615#false} is VALID [2022-04-27 21:38:34,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {2615#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2615#false} is VALID [2022-04-27 21:38:34,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {2615#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {2615#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2615#false} is VALID [2022-04-27 21:38:34,265 INFO L272 TraceCheckUtils]: 35: Hoare triple {2615#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2615#false} is VALID [2022-04-27 21:38:34,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {2615#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2615#false} is VALID [2022-04-27 21:38:34,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {2615#false} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {2615#false} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,265 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2615#false} {2615#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2615#false} is VALID [2022-04-27 21:38:34,265 INFO L272 TraceCheckUtils]: 40: Hoare triple {2615#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2615#false} is VALID [2022-04-27 21:38:34,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {2615#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2615#false} is VALID [2022-04-27 21:38:34,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {2615#false} [132] L18-->L19: 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[] {2615#false} is VALID [2022-04-27 21:38:34,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {2615#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 21:38:34,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:38:34,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {2615#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,431 INFO L290 TraceCheckUtils]: 42: Hoare triple {2615#false} [132] L18-->L19: 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[] {2615#false} is VALID [2022-04-27 21:38:34,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {2615#false} [130] __VERIFIER_assertENTRY-->L18: 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] {2615#false} is VALID [2022-04-27 21:38:34,431 INFO L272 TraceCheckUtils]: 40: Hoare triple {2615#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2615#false} is VALID [2022-04-27 21:38:34,431 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2614#true} {2615#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2615#false} is VALID [2022-04-27 21:38:34,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:34,431 INFO L272 TraceCheckUtils]: 35: Hoare triple {2615#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:34,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {2615#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2615#false} is VALID [2022-04-27 21:38:34,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {2615#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {2615#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2615#false} is VALID [2022-04-27 21:38:34,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {2615#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2615#false} is VALID [2022-04-27 21:38:34,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {2615#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {2615#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2615#false} is VALID [2022-04-27 21:38:34,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {2615#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {2615#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {2615#false} is VALID [2022-04-27 21:38:34,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {2615#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2615#false} is VALID [2022-04-27 21:38:34,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {2631#(<= main_~n~0 main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2615#false} is VALID [2022-04-27 21:38:34,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {2831#(<= main_~n~0 (+ main_~i~0 1))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {2631#(<= main_~n~0 main_~i~0)} is VALID [2022-04-27 21:38:34,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {2835#(<= main_~j~0 (+ main_~i~0 1))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {2831#(<= main_~n~0 (+ main_~i~0 1))} is VALID [2022-04-27 21:38:34,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {2839#(<= main_~j~0 main_~i~0)} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {2835#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-27 21:38:34,434 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2614#true} {2839#(<= main_~j~0 main_~i~0)} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2839#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 21:38:34,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:34,435 INFO L272 TraceCheckUtils]: 17: Hoare triple {2839#(<= main_~j~0 main_~i~0)} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:34,435 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2614#true} {2839#(<= main_~j~0 main_~i~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2839#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 21:38:34,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {2614#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {2614#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#true} [130] __VERIFIER_assertENTRY-->L18: 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] {2614#true} is VALID [2022-04-27 21:38:34,436 INFO L272 TraceCheckUtils]: 12: Hoare triple {2839#(<= main_~j~0 main_~i~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:34,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {2839#(<= main_~j~0 main_~i~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {2839#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 21:38:34,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {2839#(<= main_~j~0 main_~i~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {2839#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 21:38:34,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {2664#(<= main_~i~0 0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {2839#(<= main_~j~0 main_~i~0)} is VALID [2022-04-27 21:38:34,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {2614#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {2664#(<= main_~i~0 0)} is VALID [2022-04-27 21:38:34,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {2614#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {2614#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {2614#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {2614#true} is VALID [2022-04-27 21:38:34,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {2614#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2614#true} {2614#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {2614#true} is VALID [2022-04-27 21:38:34,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {2614#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-27 21:38:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 21:38:34,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124223511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:38:34,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:38:34,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-04-27 21:38:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216058555] [2022-04-27 21:38:34,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:38:34,461 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 44 [2022-04-27 21:38:34,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:38:34,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 21:38:34,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:34,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 21:38:34,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:38:34,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 21:38:34,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-27 21:38:34,505 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 21:38:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:35,325 INFO L93 Difference]: Finished difference Result 138 states and 178 transitions. [2022-04-27 21:38:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:38:35,325 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 44 [2022-04-27 21:38:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:38:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 21:38:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-27 21:38:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 21:38:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-27 21:38:35,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2022-04-27 21:38:35,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:35,406 INFO L225 Difference]: With dead ends: 138 [2022-04-27 21:38:35,406 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 21:38:35,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-04-27 21:38:35,407 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 83 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:38:35,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 69 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:38:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 21:38:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2022-04-27 21:38:35,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:38:35,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 21:38:35,532 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 21:38:35,533 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 21:38:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:35,535 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-27 21:38:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-27 21:38:35,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:35,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:35,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 93 states. [2022-04-27 21:38:35,536 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 93 states. [2022-04-27 21:38:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:35,538 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-27 21:38:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-27 21:38:35,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:35,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:35,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:38:35,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:38:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 59 states have internal predecessors, (70), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 21:38:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2022-04-27 21:38:35,541 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 44 [2022-04-27 21:38:35,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:38:35,541 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2022-04-27 21:38:35,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 15 states have internal predecessors, (44), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 21:38:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2022-04-27 21:38:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 21:38:35,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:35,541 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:35,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 21:38:35,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:38:35,753 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:35,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:35,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1839163900, now seen corresponding path program 1 times [2022-04-27 21:38:35,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:35,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066177215] [2022-04-27 21:38:35,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:35,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:38:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:35,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {3455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {3430#true} is VALID [2022-04-27 21:38:35,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3430#true} {3430#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 21:38:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:35,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:35,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 21:38:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:35,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:35,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:35,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 21:38:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:35,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:35,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {3430#true} is VALID [2022-04-27 21:38:35,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 21:38:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:35,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:35,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3448#(<= (+ main_~k~0 1) main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {3430#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:38:35,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {3455#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {3430#true} is VALID [2022-04-27 21:38:35,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {3430#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {3430#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {3430#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {3430#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {3430#true} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {3430#true} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L272 TraceCheckUtils]: 12: Hoare triple {3430#true} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3430#true} {3430#true} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L272 TraceCheckUtils]: 17: Hoare triple {3430#true} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,834 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3430#true} {3430#true} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {3430#true} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {3430#true} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {3430#true} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {3430#true} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L272 TraceCheckUtils]: 26: Hoare triple {3430#true} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3430#true} {3430#true} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {3430#true} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {3430#true} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {3430#true} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {3430#true} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {3430#true} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {3430#true} is VALID [2022-04-27 21:38:35,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {3430#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {3430#true} is VALID [2022-04-27 21:38:35,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {3430#true} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3447#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {3447#(<= (+ main_~j~0 1) main_~n~0)} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,837 INFO L290 TraceCheckUtils]: 43: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,838 INFO L290 TraceCheckUtils]: 45: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,838 INFO L272 TraceCheckUtils]: 46: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:35,838 INFO L290 TraceCheckUtils]: 47: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:35,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:35,838 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3430#true} {3448#(<= (+ main_~k~0 1) main_~n~0)} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3448#(<= (+ main_~k~0 1) main_~n~0)} is VALID [2022-04-27 21:38:35,839 INFO L272 TraceCheckUtils]: 51: Hoare triple {3448#(<= (+ main_~k~0 1) main_~n~0)} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3453#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:38:35,839 INFO L290 TraceCheckUtils]: 52: Hoare triple {3453#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L18: 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] {3454#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:38:35,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {3454#(not (= __VERIFIER_assert_~cond 0))} [132] L18-->L19: 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[] {3431#false} is VALID [2022-04-27 21:38:35,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {3431#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-27 21:38:35,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:38:35,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066177215] [2022-04-27 21:38:35,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066177215] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:38:35,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883778089] [2022-04-27 21:38:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:35,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:38:35,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:38:35,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:38:35,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 21:38:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:35,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 21:38:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:35,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:38:36,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {3430#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {3430#true} is VALID [2022-04-27 21:38:36,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {3430#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {3430#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:36,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {3430#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {3430#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {3430#true} is VALID [2022-04-27 21:38:36,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 21:38:36,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 21:38:36,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 21:38:36,412 INFO L272 TraceCheckUtils]: 12: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:36,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:36,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,413 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3430#true} {3486#(<= main_~j~0 (* main_~i~0 2))} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 21:38:36,413 INFO L272 TraceCheckUtils]: 17: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:36,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:36,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,413 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3430#true} {3486#(<= main_~j~0 (* main_~i~0 2))} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 21:38:36,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 21:38:36,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 21:38:36,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 21:38:36,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 21:38:36,415 INFO L272 TraceCheckUtils]: 26: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {3430#true} is VALID [2022-04-27 21:38:36,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:36,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,415 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3430#true} {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 21:38:36,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {3555#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:36,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {3555#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:36,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:36,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:36,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {3569#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} is VALID [2022-04-27 21:38:36,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {3569#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {3573#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) (div main_~j~0 2))} is VALID [2022-04-27 21:38:36,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) (div main_~j~0 2))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {3431#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {3431#false} is VALID [2022-04-27 21:38:36,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {3431#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {3431#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {3431#false} is VALID [2022-04-27 21:38:36,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {3431#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {3431#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {3431#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {3431#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {3431#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L272 TraceCheckUtils]: 46: Hoare triple {3431#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {3431#false} [130] __VERIFIER_assertENTRY-->L18: 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] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {3431#false} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {3431#false} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3431#false} {3431#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L272 TraceCheckUtils]: 51: Hoare triple {3431#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {3431#false} [130] __VERIFIER_assertENTRY-->L18: 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] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {3431#false} [132] L18-->L19: 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[] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {3431#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 21:38:36,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:38:36,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {3431#false} [134] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {3431#false} [132] L18-->L19: 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[] {3431#false} is VALID [2022-04-27 21:38:36,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {3431#false} [130] __VERIFIER_assertENTRY-->L18: 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] {3431#false} is VALID [2022-04-27 21:38:36,633 INFO L272 TraceCheckUtils]: 51: Hoare triple {3431#false} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3431#false} is VALID [2022-04-27 21:38:36,633 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3430#true} {3431#false} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3431#false} is VALID [2022-04-27 21:38:36,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:36,634 INFO L272 TraceCheckUtils]: 46: Hoare triple {3431#false} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:36,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {3431#false} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {3431#false} is VALID [2022-04-27 21:38:36,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {3431#false} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,634 INFO L290 TraceCheckUtils]: 43: Hoare triple {3431#false} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {3431#false} is VALID [2022-04-27 21:38:36,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {3431#false} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {3431#false} is VALID [2022-04-27 21:38:36,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {3431#false} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {3431#false} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {3431#false} is VALID [2022-04-27 21:38:36,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {3431#false} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {3431#false} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {3431#false} is VALID [2022-04-27 21:38:36,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {3679#(not (< main_~j~0 main_~n~0))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3431#false} is VALID [2022-04-27 21:38:36,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {3569#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {3679#(not (< main_~j~0 main_~n~0))} is VALID [2022-04-27 21:38:36,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [120] L33-2-->L33-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {3569#(<= (+ (div (+ 2 (* (- 1) main_~n~0)) (- 2)) 1) main_~i~0)} is VALID [2022-04-27 21:38:36,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [118] L34-2-->L33-2: Formula: (not (< v_main_~j~0_5 v_main_~n~0_10)) InVars {main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:36,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:36,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {3555#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} [124] L36-2-->L42: Formula: (not (< v_main_~k~0_7 v_main_~n~0_12)) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} OutVars{main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] {3559#(<= main_~n~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:36,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [131] L37-1-->L36-2: Formula: (= v_main_~k~0_10 (+ v_main_~k~0_11 1)) InVars {main_~k~0=v_main_~k~0_11} OutVars{main_~k~0=v_main_~k~0_10, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {3555#(<= main_~k~0 (+ 2 (* main_~i~0 2)))} is VALID [2022-04-27 21:38:36,643 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3430#true} {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [139] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 21:38:36,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:36,643 INFO L272 TraceCheckUtils]: 26: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [128] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (* v_main_~i~0_8 2) v_main_~k~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0] {3430#true} is VALID [2022-04-27 21:38:36,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} [125] L36-2-->L37: Formula: (< v_main_~k~0_8 v_main_~n~0_13) InVars {main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} OutVars{main_~k~0=v_main_~k~0_8, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 21:38:36,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} [121] L35-->L36-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~j~0_7 v_main_~k~0_6)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {3533#(<= main_~k~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 21:38:36,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 21:38:36,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} [127] L42-->L34-2: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post4] {3526#(<= main_~j~0 (+ (* main_~i~0 2) 1))} is VALID [2022-04-27 21:38:36,649 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3430#true} {3486#(<= main_~j~0 (* main_~i~0 2))} [141] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 21:38:36,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:36,649 INFO L272 TraceCheckUtils]: 17: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} [129] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~k~0_16 v_main_~n~0_17) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_16, main_~n~0=v_main_~n~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:36,650 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3430#true} {3486#(<= main_~j~0 (* main_~i~0 2))} [140] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 21:38:36,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {3430#true} [136] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {3430#true} [133] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {3430#true} [130] __VERIFIER_assertENTRY-->L18: 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] {3430#true} is VALID [2022-04-27 21:38:36,650 INFO L272 TraceCheckUtils]: 12: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} [126] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~n~0_16 v_main_~k~0_15) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~k~0=v_main_~k~0_15, main_~n~0=v_main_~n~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:36,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} [122] L35-->L41: Formula: (= |v_main_#t~nondet5_5| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 21:38:36,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {3486#(<= main_~j~0 (* main_~i~0 2))} [119] L34-2-->L35: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (< v_main_~j~0_6 v_main_~n~0_11) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~n~0=v_main_~n~0_11, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 21:38:36,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#true} [116] L33-3-->L34-2: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {3486#(<= main_~j~0 (* main_~i~0 2))} is VALID [2022-04-27 21:38:36,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#true} [112] L29-1-->L33-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {3430#true} is VALID [2022-04-27 21:38:36,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {3430#true} [110] L29-->L29-1: Formula: (= v_main_~k~0_4 v_main_~n~0_6) InVars {main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {3430#true} [108] L28-->L29: Formula: (< v_main_~n~0_5 1000000) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {3430#true} [105] mainENTRY-->L28: Formula: (and (= v_main_~k~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {3430#true} is VALID [2022-04-27 21:38:36,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {3430#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3430#true} {3430#true} [137] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} [103] 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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (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] {3430#true} is VALID [2022-04-27 21:38:36,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {3430#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-27 21:38:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 21:38:36,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883778089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:38:36,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:38:36,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2022-04-27 21:38:36,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563402950] [2022-04-27 21:38:36,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:38:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 55 [2022-04-27 21:38:36,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:38:36,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 21:38:36,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:36,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 21:38:36,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:38:36,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 21:38:36,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-04-27 21:38:36,710 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 21:38:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:38,348 INFO L93 Difference]: Finished difference Result 166 states and 226 transitions. [2022-04-27 21:38:38,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 21:38:38,348 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 55 [2022-04-27 21:38:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:38:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 21:38:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 119 transitions. [2022-04-27 21:38:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 21:38:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 119 transitions. [2022-04-27 21:38:38,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 119 transitions. [2022-04-27 21:38:38,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:38,450 INFO L225 Difference]: With dead ends: 166 [2022-04-27 21:38:38,450 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:38:38,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1462, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 21:38:38,454 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 82 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 21:38:38,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 74 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 21:38:38,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:38:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:38:38,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:38:38,455 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-27 21:38:38,455 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-27 21:38:38,455 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-27 21:38:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:38,455 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:38:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:38:38,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:38,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:38,455 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-27 21:38:38,456 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-27 21:38:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:38,456 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:38:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:38:38,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:38,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:38,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:38:38,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:38:38,456 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-27 21:38:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:38:38,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2022-04-27 21:38:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:38:38,456 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:38:38,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 13 states have internal predecessors, (60), 5 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 21:38:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:38:38,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:38,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:38:38,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 21:38:38,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:38:38,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:38:39,483 INFO L895 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-27 21:38:39,483 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:38:39,483 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:38:39,483 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:38:39,483 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:38:39,483 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 48) the Hoare annotation is: true [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 48) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 32) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 48) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L902 garLoopResultBuilder]: At program point L46(lines 24 48) the Hoare annotation is: true [2022-04-27 21:38:39,484 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 45) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 main_~n~0)) (.cse1 (<= main_~n~0 main_~k~0))) (or (and .cse0 (<= main_~n~0 main_~j~0) .cse1) (and (= main_~i~0 0) .cse0 .cse1))) [2022-04-27 21:38:39,484 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 44) the Hoare annotation is: (and (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 33 45) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 43) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 38) the Hoare annotation is: (let ((.cse0 (* main_~i~0 2))) (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0))) [2022-04-27 21:38:39,484 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point L42(lines 34 44) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (* main_~i~0 2))) (and (<= (+ main_~j~0 1) main_~n~0) (<= (+ main_~k~0 1) main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0))) [2022-04-27 21:38:39,484 INFO L895 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0) (<= (* main_~i~0 2) main_~j~0) (<= main_~n~0 main_~k~0)) [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 36 38) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:38:39,484 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:38:39,485 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:38:39,485 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:38:39,487 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:39,488 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 21:38:39,491 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:38:39,492 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:38:39,492 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:38:39,492 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:38:39,492 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 21:38:39,492 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:38:39,492 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:38:39,492 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:38:39,492 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:38:39,492 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:38:39,493 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 21:38:39,493 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 21:38:39,493 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-27 21:38:39,493 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-27 21:38:39,493 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 21:38:39,493 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 21:38:39,493 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 21:38:39,495 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-27 21:38:39,495 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 21:38:39,495 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 21:38:39,495 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:38:39,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:38:39 BasicIcfg [2022-04-27 21:38:39,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:38:39,505 INFO L158 Benchmark]: Toolchain (without parser) took 14488.44ms. Allocated memory was 206.6MB in the beginning and 317.7MB in the end (delta: 111.1MB). Free memory was 155.5MB in the beginning and 178.6MB in the end (delta: -23.1MB). Peak memory consumption was 157.0MB. Max. memory is 8.0GB. [2022-04-27 21:38:39,505 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 206.6MB. Free memory was 171.7MB in the beginning and 171.6MB in the end (delta: 71.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:38:39,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.59ms. Allocated memory was 206.6MB in the beginning and 264.2MB in the end (delta: 57.7MB). Free memory was 155.3MB in the beginning and 240.4MB in the end (delta: -85.1MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-27 21:38:39,505 INFO L158 Benchmark]: Boogie Preprocessor took 35.13ms. Allocated memory is still 264.2MB. Free memory was 240.4MB in the beginning and 238.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:38:39,505 INFO L158 Benchmark]: RCFGBuilder took 266.64ms. Allocated memory is still 264.2MB. Free memory was 238.8MB in the beginning and 224.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 21:38:39,506 INFO L158 Benchmark]: IcfgTransformer took 49.70ms. Allocated memory is still 264.2MB. Free memory was 224.7MB in the beginning and 223.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:38:39,506 INFO L158 Benchmark]: TraceAbstraction took 13936.16ms. Allocated memory was 264.2MB in the beginning and 317.7MB in the end (delta: 53.5MB). Free memory was 222.6MB in the beginning and 178.6MB in the end (delta: 43.9MB). Peak memory consumption was 166.1MB. Max. memory is 8.0GB. [2022-04-27 21:38:39,507 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.10ms. Allocated memory is still 206.6MB. Free memory was 171.7MB in the beginning and 171.6MB in the end (delta: 71.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.59ms. Allocated memory was 206.6MB in the beginning and 264.2MB in the end (delta: 57.7MB). Free memory was 155.3MB in the beginning and 240.4MB in the end (delta: -85.1MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.13ms. Allocated memory is still 264.2MB. Free memory was 240.4MB in the beginning and 238.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.64ms. Allocated memory is still 264.2MB. Free memory was 238.8MB in the beginning and 224.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 49.70ms. Allocated memory is still 264.2MB. Free memory was 224.7MB in the beginning and 223.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 13936.16ms. Allocated memory was 264.2MB in the beginning and 317.7MB in the end (delta: 53.5MB). Free memory was 222.6MB in the beginning and 178.6MB in the end (delta: 43.9MB). Peak memory consumption was 166.1MB. 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 479 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 482 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1661 IncrementalHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 411 mSolverCounterUnsat, 184 mSDtfsCounter, 1661 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 383 SyntacticMatches, 5 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=7, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 68 PreInvPairs, 137 NumberOfFragments, 119 HoareAnnotationTreeSize, 68 FomulaSimplifications, -276 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 12 FomulaSimplificationsInter, 19230 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 606 ConstructedInterpolants, 0 QuantifiedInterpolants, 1499 SizeOfPredicates, 21 NumberOfNonLiveVariables, 555 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 398/439 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((k <= n && n <= j) && n <= k) || ((i == 0 && k <= n) && n <= k) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((j + 1 <= n && k <= n) && i * 2 <= j) && i * 2 <= k - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (k <= n && i * 2 <= j) && n <= k RESULT: Ultimate proved your program to be correct! [2022-04-27 21:38:39,532 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...