/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-34549b5 [2022-04-07 22:31:48,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:31:48,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:31:48,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:31:48,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:31:48,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:31:48,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:31:48,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:31:48,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:31:48,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:31:48,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:31:48,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:31:48,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:31:48,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:31:48,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:31:48,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:31:48,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:31:48,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:31:48,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:31:48,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:31:48,901 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:31:48,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:31:48,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:31:48,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:31:48,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:31:48,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:31:48,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:31:48,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:31:48,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:31:48,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:31:48,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:31:48,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:31:48,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:31:48,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:31:48,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:31:48,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:31:48,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:31:48,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:31:48,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:31:48,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:31:48,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:31:48,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:31:48,916 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:31:48,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:31:48,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:31:48,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:31:48,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:31:48,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:31:48,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:31:48,938 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:31:48,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:31:48,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:31:48,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:31:48,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:31:48,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:31:48,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:31:48,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:31:48,941 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:31:48,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:31:48,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:31:48,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:31:48,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:31:48,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:31:48,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:31:48,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:31:48,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:31:48,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:31:48,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:31:48,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:31:48,942 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:31:48,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:31:48,943 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:31:48,943 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-07 22:31:49,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:31:49,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:31:49,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:31:49,155 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:31:49,155 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:31:49,156 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-07 22:31:49,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c3ce573c/716a3864411e4d51abede2d0cd22275b/FLAG16f276101 [2022-04-07 22:31:49,534 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:31:49,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2022-04-07 22:31:49,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c3ce573c/716a3864411e4d51abede2d0cd22275b/FLAG16f276101 [2022-04-07 22:31:49,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c3ce573c/716a3864411e4d51abede2d0cd22275b [2022-04-07 22:31:49,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:31:49,975 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:31:49,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:31:49,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:31:49,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:31:49,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:31:49" (1/1) ... [2022-04-07 22:31:49,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226c369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:49, skipping insertion in model container [2022-04-07 22:31:49,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:31:49" (1/1) ... [2022-04-07 22:31:49,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:31:49,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:31:50,115 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-07 22:31:50,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:31:50,137 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:31:50,146 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-07 22:31:50,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:31:50,157 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:31:50,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:50 WrapperNode [2022-04-07 22:31:50,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:31:50,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:31:50,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:31:50,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:31:50,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:50" (1/1) ... [2022-04-07 22:31:50,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:50" (1/1) ... [2022-04-07 22:31:50,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:50" (1/1) ... [2022-04-07 22:31:50,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:50" (1/1) ... [2022-04-07 22:31:50,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:50" (1/1) ... [2022-04-07 22:31:50,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:50" (1/1) ... [2022-04-07 22:31:50,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:50" (1/1) ... [2022-04-07 22:31:50,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:31:50,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:31:50,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:31:50,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:31:50,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:50" (1/1) ... [2022-04-07 22:31:50,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:31:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:31:50,201 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-07 22:31:50,203 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-07 22:31:50,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:31:50,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:31:50,224 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:31:50,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 22:31:50,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:31:50,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:31:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:31:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:31:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:31:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:31:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:31:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:31:50,266 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:31:50,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:31:50,398 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:31:50,403 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:31:50,404 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 22:31:50,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:31:50 BoogieIcfgContainer [2022-04-07 22:31:50,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:31:50,405 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:31:50,406 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:31:50,406 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:31:50,408 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:31:50" (1/1) ... [2022-04-07 22:31:50,409 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:31:50,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:31:50 BasicIcfg [2022-04-07 22:31:50,447 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:31:50,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:31:50,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:31:50,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:31:50,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:31:49" (1/4) ... [2022-04-07 22:31:50,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4596f4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:31:50, skipping insertion in model container [2022-04-07 22:31:50,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:31:50" (2/4) ... [2022-04-07 22:31:50,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4596f4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:31:50, skipping insertion in model container [2022-04-07 22:31:50,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:31:50" (3/4) ... [2022-04-07 22:31:50,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4596f4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:31:50, skipping insertion in model container [2022-04-07 22:31:50,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:31:50" (4/4) ... [2022-04-07 22:31:50,457 INFO L111 eAbstractionObserver]: Analyzing ICFG nested6.iqvasr [2022-04-07 22:31:50,462 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:31:50,462 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:31:50,496 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:31:50,501 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:31:50,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:31:50,515 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-07 22:31:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 22:31:50,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:31:50,520 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:31:50,520 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:31:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:31:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1002152396, now seen corresponding path program 1 times [2022-04-07 22:31:50,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:31:50,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104879959] [2022-04-07 22:31:50,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:31:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:31:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:50,705 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-07 22:31:50,706 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-07 22:31:50,706 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-07 22:31:50,707 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-07 22:31:50,708 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-07 22:31:50,708 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-07 22:31:50,708 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-07 22:31:50,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-07 22:31:50,708 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-07 22:31:50,709 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-07 22:31:50,709 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-07 22:31:50,710 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-07 22:31:50,710 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-07 22:31:50,711 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-07 22:31:50,711 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-07 22:31:50,712 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-07 22:31:50,713 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-07 22:31:50,713 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-07 22:31:50,713 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-07 22:31:50,714 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-07 22:31:50,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:31:50,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104879959] [2022-04-07 22:31:50,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104879959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:31:50,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:31:50,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 22:31:50,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460451153] [2022-04-07 22:31:50,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:31:50,720 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-07 22:31:50,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:31:50,723 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-07 22:31:50,747 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-07 22:31:50,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 22:31:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:31:50,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 22:31:50,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 22:31:50,763 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-07 22:31:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:51,085 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2022-04-07 22:31:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 22:31:51,085 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-07 22:31:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:31:51,086 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-07 22:31:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-07 22:31:51,092 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-07 22:31:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-04-07 22:31:51,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2022-04-07 22:31:51,171 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-07 22:31:51,183 INFO L225 Difference]: With dead ends: 58 [2022-04-07 22:31:51,183 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 22:31:51,185 INFO L912 BasicCegarLoop]: 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-07 22:31:51,187 INFO L913 BasicCegarLoop]: 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-07 22:31:51,188 INFO L914 BasicCegarLoop]: 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-07 22:31:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 22:31:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-07 22:31:51,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:31:51,219 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-07 22:31:51,220 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-07 22:31:51,220 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-07 22:31:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:51,223 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-07 22:31:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 22:31:51,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:51,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:51,224 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-07 22:31:51,224 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-07 22:31:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:51,226 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-07 22:31:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 22:31:51,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:51,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:51,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:31:51,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:31:51,227 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-07 22:31:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-07 22:31:51,229 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2022-04-07 22:31:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:31:51,229 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-07 22:31:51,230 INFO L479 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-07 22:31:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-07 22:31:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 22:31:51,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:31:51,230 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:31:51,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:31:51,231 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:31:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:31:51,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1031567308, now seen corresponding path program 1 times [2022-04-07 22:31:51,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:31:51,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533137800] [2022-04-07 22:31:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:51,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:31:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:51,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:31:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:51,298 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-07 22:31:51,298 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-07 22:31:51,298 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-07 22:31:51,299 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-07 22:31:51,299 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-07 22:31:51,299 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-07 22:31:51,299 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-07 22:31:51,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-07 22:31:51,299 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-07 22:31:51,300 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-07 22:31:51,300 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-07 22:31:51,300 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-07 22:31:51,300 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-07 22:31:51,301 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-07 22:31:51,301 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-07 22:31:51,302 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-07 22:31:51,302 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-07 22:31:51,303 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-07 22:31:51,303 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-07 22:31:51,303 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-07 22:31:51,304 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-07 22:31:51,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:31:51,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533137800] [2022-04-07 22:31:51,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533137800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:31:51,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:31:51,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 22:31:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875730726] [2022-04-07 22:31:51,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:31:51,305 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-07 22:31:51,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:31:51,306 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-07 22:31:51,317 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-07 22:31:51,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 22:31:51,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:31:51,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 22:31:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 22:31:51,318 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-07 22:31:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:51,699 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 22:31:51,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 22:31:51,700 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-07 22:31:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:31:51,701 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-07 22:31:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-07 22:31:51,705 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-07 22:31:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-07 22:31:51,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-07 22:31:51,745 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-07 22:31:51,748 INFO L225 Difference]: With dead ends: 41 [2022-04-07 22:31:51,748 INFO L226 Difference]: Without dead ends: 39 [2022-04-07 22:31:51,749 INFO L912 BasicCegarLoop]: 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-07 22:31:51,750 INFO L913 BasicCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 22:31:51,750 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 45 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 22:31:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-07 22:31:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-07 22:31:51,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:31:51,768 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-07 22:31:51,769 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-07 22:31:51,770 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-07 22:31:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:51,773 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-07 22:31:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-07 22:31:51,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:51,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:51,775 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-07 22:31:51,775 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-07 22:31:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:51,785 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-07 22:31:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-07 22:31:51,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:51,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:51,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:31:51,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:31:51,786 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-07 22:31:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-07 22:31:51,787 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 17 [2022-04-07 22:31:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:31:51,788 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-07 22:31:51,788 INFO L479 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-07 22:31:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 22:31:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 22:31:51,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:31:51,789 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:31:51,789 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 22:31:51,789 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:31:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:31:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1187235258, now seen corresponding path program 1 times [2022-04-07 22:31:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:31:51,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624172199] [2022-04-07 22:31:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:31:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:51,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:31:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:51,867 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-07 22:31:51,867 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-07 22:31:51,867 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-07 22:31:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 22:31:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:51,872 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-07 22:31:51,872 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-07 22:31:51,873 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-07 22:31:51,873 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-07 22:31:51,874 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-07 22:31:51,874 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-07 22:31:51,874 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-07 22:31:51,874 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-07 22:31:51,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-07 22:31:51,874 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-07 22:31:51,875 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-07 22:31:51,875 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-07 22:31:51,875 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-07 22:31:51,876 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-07 22:31:51,876 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-07 22:31:51,876 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-07 22:31:51,877 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-07 22:31:51,877 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-07 22:31:51,877 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-07 22:31:51,877 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-07 22:31:51,877 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-07 22:31:51,878 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-07 22:31:51,878 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-07 22:31:51,879 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-07 22:31:51,879 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-07 22:31:51,879 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-07 22:31:51,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:31:51,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624172199] [2022-04-07 22:31:51,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624172199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:31:51,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:31:51,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 22:31:51,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029492045] [2022-04-07 22:31:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:31:51,880 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-07 22:31:51,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:31:51,881 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-07 22:31:51,895 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-07 22:31:51,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 22:31:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:31:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 22:31:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 22:31:51,896 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-07 22:31:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:52,124 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-04-07 22:31:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 22:31:52,124 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-07 22:31:52,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:31:52,126 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-07 22:31:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-07 22:31:52,127 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-07 22:31:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-07 22:31:52,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-07 22:31:52,166 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-07 22:31:52,167 INFO L225 Difference]: With dead ends: 46 [2022-04-07 22:31:52,167 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 22:31:52,168 INFO L912 BasicCegarLoop]: 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-07 22:31:52,169 INFO L913 BasicCegarLoop]: 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-07 22:31:52,169 INFO L914 BasicCegarLoop]: 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-07 22:31:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 22:31:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-07 22:31:52,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:31:52,188 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-07 22:31:52,188 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-07 22:31:52,189 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-07 22:31:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:52,190 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-07 22:31:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-07 22:31:52,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:52,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:52,191 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-07 22:31:52,191 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-07 22:31:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:52,192 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-07 22:31:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-07 22:31:52,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:52,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:52,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:31:52,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:31:52,193 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-07 22:31:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-07 22:31:52,194 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2022-04-07 22:31:52,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:31:52,195 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-07 22:31:52,195 INFO L479 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-07 22:31:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-07 22:31:52,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 22:31:52,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:31:52,195 INFO L499 BasicCegarLoop]: 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-07 22:31:52,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 22:31:52,196 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:31:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:31:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1420692427, now seen corresponding path program 1 times [2022-04-07 22:31:52,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:31:52,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878892988] [2022-04-07 22:31:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:52,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:31:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:52,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:31:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:52,260 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-07 22:31:52,260 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-07 22:31:52,260 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-07 22:31:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-07 22:31:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:52,264 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-07 22:31:52,265 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-07 22:31:52,265 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-07 22:31:52,265 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-07 22:31:52,266 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-07 22:31:52,266 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-07 22:31:52,266 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-07 22:31:52,266 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-07 22:31:52,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {671#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-07 22:31:52,267 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-07 22:31:52,267 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-07 22:31:52,267 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-07 22:31:52,267 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-07 22:31:52,268 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-07 22:31:52,268 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-07 22:31:52,269 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-07 22:31:52,269 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-07 22:31:52,269 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-07 22:31:52,270 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-07 22:31:52,270 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-07 22:31:52,270 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-07 22:31:52,270 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-07 22:31:52,271 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-07 22:31:52,271 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-07 22:31:52,271 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-07 22:31:52,272 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-07 22:31:52,272 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-07 22:31:52,273 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-07 22:31:52,273 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-07 22:31:52,273 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-07 22:31:52,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:31:52,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878892988] [2022-04-07 22:31:52,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878892988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:31:52,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099218969] [2022-04-07 22:31:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:52,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:31:52,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:31:52,275 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-07 22:31:52,298 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-07 22:31:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:52,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 22:31:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:52,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:31:53,663 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-07 22:31:53,664 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-07 22:31:53,664 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-07 22:31:53,666 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-07 22:31:53,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {671#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-07 22:31:53,666 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-07 22:31:53,666 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-07 22:31:53,666 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-07 22:31:53,667 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-07 22:31:53,668 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-07 22:31:53,669 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-07 22:31:53,670 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-07 22:31:53,670 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-07 22:31:53,671 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-07 22:31:53,671 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-07 22:31:53,675 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-07 22:31:53,676 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-07 22:31:53,676 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-07 22:31:53,677 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-07 22:31:53,677 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-07 22:31:53,683 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-07 22:31:53,683 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-07 22:31:53,683 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-07 22:31:53,683 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-07 22:31:53,684 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-07 22:31:53,684 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-07 22:31:53,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 22:31:53,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099218969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:31:53,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 22:31:53,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-04-07 22:31:53,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420892140] [2022-04-07 22:31:53,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:31:53,685 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-07 22:31:53,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:31:53,685 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-07 22:31:53,700 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-07 22:31:53,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 22:31:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:31:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 22:31:53,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-07 22:31:53,705 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-07 22:31:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:53,957 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2022-04-07 22:31:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 22:31:53,957 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-07 22:31:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:31:53,957 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-07 22:31:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-07 22:31:53,960 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-07 22:31:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-07 22:31:53,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-04-07 22:31:54,021 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-07 22:31:54,023 INFO L225 Difference]: With dead ends: 107 [2022-04-07 22:31:54,023 INFO L226 Difference]: Without dead ends: 72 [2022-04-07 22:31:54,024 INFO L912 BasicCegarLoop]: 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-07 22:31:54,029 INFO L913 BasicCegarLoop]: 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-07 22:31:54,030 INFO L914 BasicCegarLoop]: 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-07 22:31:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-07 22:31:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 48. [2022-04-07 22:31:54,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:31:54,068 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-07 22:31:54,069 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-07 22:31:54,069 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-07 22:31:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:54,072 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-07 22:31:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-07 22:31:54,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:54,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:54,074 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-07 22:31:54,074 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-07 22:31:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:54,077 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-07 22:31:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-04-07 22:31:54,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:54,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:54,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:31:54,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:31:54,079 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-07 22:31:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-07 22:31:54,080 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2022-04-07 22:31:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:31:54,080 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-07 22:31:54,080 INFO L479 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-07 22:31:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-07 22:31:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 22:31:54,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:31:54,081 INFO L499 BasicCegarLoop]: 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-07 22:31:54,100 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-07 22:31:54,297 WARN L460 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-07 22:31:54,298 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:31:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:31:54,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1754984885, now seen corresponding path program 1 times [2022-04-07 22:31:54,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:31:54,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581356668] [2022-04-07 22:31:54,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:31:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:31:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:54,410 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-07 22:31:54,410 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-07 22:31:54,410 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-07 22:31:54,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-07 22:31:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:54,415 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-07 22:31:54,415 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-07 22:31:54,415 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-07 22:31:54,416 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-07 22:31:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-07 22:31:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:54,420 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-07 22:31:54,420 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-07 22:31:54,420 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-07 22:31:54,420 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-07 22:31:54,421 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-07 22:31:54,421 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-07 22:31:54,421 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-07 22:31:54,421 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-07 22:31:54,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {1135#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-07 22:31:54,422 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-07 22:31:54,422 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-07 22:31:54,422 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-07 22:31:54,422 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-07 22:31:54,423 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-07 22:31:54,423 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-07 22:31:54,424 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-07 22:31:54,424 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-07 22:31:54,424 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-07 22:31:54,424 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-07 22:31:54,424 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-07 22:31:54,424 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-07 22:31:54,425 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-07 22:31:54,425 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-07 22:31:54,426 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-07 22:31:54,426 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-07 22:31:54,426 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-07 22:31:54,427 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-07 22:31:54,427 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-07 22:31:54,427 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-07 22:31:54,427 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-07 22:31:54,427 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-07 22:31:54,428 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-07 22:31:54,428 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-07 22:31:54,428 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-07 22:31:54,429 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-07 22:31:54,429 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-07 22:31:54,429 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-07 22:31:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:31:54,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581356668] [2022-04-07 22:31:54,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581356668] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:31:54,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141830428] [2022-04-07 22:31:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:54,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:31:54,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:31:54,430 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-07 22:31:54,432 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-07 22:31:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:54,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 22:31:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:54,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:31:54,592 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-07 22:31:54,592 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-07 22:31:54,593 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-07 22:31:54,593 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-07 22:31:54,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {1135#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-07 22:31:54,594 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-07 22:31:54,594 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-07 22:31:54,594 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-07 22:31:54,595 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-07 22:31:54,595 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-07 22:31:54,595 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-07 22:31:54,595 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-07 22:31:54,596 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-07 22:31:54,596 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-07 22:31:54,596 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-07 22:31:54,597 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-07 22:31:54,597 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-07 22:31:54,600 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-07 22:31:54,601 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-07 22:31:54,601 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-07 22:31:54,601 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-07 22:31:54,602 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-07 22:31:54,602 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-07 22:31:54,602 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-07 22:31:54,602 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-07 22:31:54,602 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-07 22:31:54,602 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-07 22:31:54,602 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-07 22:31:54,603 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-07 22:31:54,603 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-07 22:31:54,603 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-07 22:31:54,606 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-07 22:31:54,606 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-07 22:31:54,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:31:54,725 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-07 22:31:54,726 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-07 22:31:54,727 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-07 22:31:54,727 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-07 22:31:54,727 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-07 22:31:54,727 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-07 22:31:54,727 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-07 22:31:54,727 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-07 22:31:54,728 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-07 22:31:54,728 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-07 22:31:54,729 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-07 22:31:54,729 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-07 22:31:54,730 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-07 22:31:54,730 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-07 22:31:54,731 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-07 22:31:54,731 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-07 22:31:54,731 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-07 22:31:54,731 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-07 22:31:54,731 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-07 22:31:54,731 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-07 22:31:54,732 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-07 22:31:54,732 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-07 22:31:54,732 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-07 22:31:54,732 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-07 22:31:54,732 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-07 22:31:54,732 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-07 22:31:54,732 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-07 22:31:54,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {1135#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1135#true} is VALID [2022-04-07 22:31:54,733 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-07 22:31:54,733 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-07 22:31:54,733 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-07 22:31:54,733 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-07 22:31:54,733 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-07 22:31:54,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141830428] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:31:54,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:31:54,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-07 22:31:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194350082] [2022-04-07 22:31:54,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:31:54,734 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-07 22:31:54,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:31:54,735 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-07 22:31:54,766 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-07 22:31:54,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 22:31:54,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:31:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 22:31:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-07 22:31:54,768 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-07 22:31:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:55,896 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-07 22:31:55,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-07 22:31:55,897 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-07 22:31:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:31:55,897 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-07 22:31:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 114 transitions. [2022-04-07 22:31:55,899 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-07 22:31:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 114 transitions. [2022-04-07 22:31:55,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 114 transitions. [2022-04-07 22:31:55,995 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-07 22:31:55,997 INFO L225 Difference]: With dead ends: 118 [2022-04-07 22:31:55,997 INFO L226 Difference]: Without dead ends: 94 [2022-04-07 22:31:55,998 INFO L912 BasicCegarLoop]: 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-07 22:31:55,998 INFO L913 BasicCegarLoop]: 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-07 22:31:55,999 INFO L914 BasicCegarLoop]: 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-07 22:31:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-07 22:31:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2022-04-07 22:31:56,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:31:56,086 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-07 22:31:56,086 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-07 22:31:56,086 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-07 22:31:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:56,089 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-07 22:31:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-07 22:31:56,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:56,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:56,090 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-07 22:31:56,090 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-07 22:31:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:56,092 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2022-04-07 22:31:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-04-07 22:31:56,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:56,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:56,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:31:56,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:31:56,093 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-07 22:31:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2022-04-07 22:31:56,095 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 32 [2022-04-07 22:31:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:31:56,095 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2022-04-07 22:31:56,095 INFO L479 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-07 22:31:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2022-04-07 22:31:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 22:31:56,096 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:31:56,096 INFO L499 BasicCegarLoop]: 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-07 22:31:56,120 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-07 22:31:56,313 WARN L460 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-07 22:31:56,313 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:31:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:31:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1763990758, now seen corresponding path program 1 times [2022-04-07 22:31:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:31:56,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979677979] [2022-04-07 22:31:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:56,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:31:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:56,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:31:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:56,432 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-07 22:31:56,432 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-07 22:31:56,432 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-07 22:31:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-07 22:31:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:56,439 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-07 22:31:56,439 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-07 22:31:56,439 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-07 22:31:56,440 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-07 22:31:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-07 22:31:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:56,445 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-07 22:31:56,445 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-07 22:31:56,445 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-07 22:31:56,445 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-07 22:31:56,446 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-07 22:31:56,446 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-07 22:31:56,446 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-07 22:31:56,447 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-07 22:31:56,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-07 22:31:56,450 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-07 22:31:56,454 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-07 22:31:56,454 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-07 22:31:56,455 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-07 22:31:56,456 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-07 22:31:56,456 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-07 22:31:56,457 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-07 22:31:56,457 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-07 22:31:56,457 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-07 22:31:56,457 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-07 22:31:56,457 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-07 22:31:56,457 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-07 22:31:56,459 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-07 22:31:56,460 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-07 22:31:56,460 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-07 22:31:56,461 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-07 22:31:56,461 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-07 22:31:56,462 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-07 22:31:56,462 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-07 22:31:56,462 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-07 22:31:56,462 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-07 22:31:56,462 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-07 22:31:56,462 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-07 22:31:56,462 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-07 22:31:56,463 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-07 22:31:56,463 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-07 22:31:56,463 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-07 22:31:56,463 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-07 22:31:56,463 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-07 22:31:56,463 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-07 22:31:56,463 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-07 22:31:56,463 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-07 22:31:56,463 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-07 22:31:56,464 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-07 22:31:56,464 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-07 22:31:56,464 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-07 22:31:56,464 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-07 22:31:56,465 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-07 22:31:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:31:56,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979677979] [2022-04-07 22:31:56,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979677979] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:31:56,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564829548] [2022-04-07 22:31:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:56,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:31:56,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:31:56,471 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-07 22:31:56,473 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-07 22:31:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:56,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 22:31:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:56,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:31:57,017 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-07 22:31:57,017 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-07 22:31:57,017 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-07 22:31:57,017 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-07 22:31:57,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-07 22:31:57,018 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-07 22:31:57,018 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-07 22:31:57,018 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-07 22:31:57,018 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-07 22:31:57,019 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-07 22:31:57,019 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-07 22:31:57,019 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-07 22:31:57,020 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-07 22:31:57,020 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-07 22:31:57,020 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-07 22:31:57,020 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-07 22:31:57,020 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-07 22:31:57,021 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-07 22:31:57,022 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-07 22:31:57,022 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-07 22:31:57,023 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-07 22:31:57,023 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-07 22:31:57,032 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-07 22:31:57,032 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-07 22:31:57,032 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,033 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-07 22:31:57,034 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-07 22:31:57,034 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-07 22:31:57,034 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-07 22:31:57,034 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-07 22:31:57,034 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-07 22:31:57,034 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-07 22:31:57,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:31:57,225 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-07 22:31:57,225 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-07 22:31:57,225 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-07 22:31:57,225 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-07 22:31:57,225 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-07 22:31:57,226 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-07 22:31:57,226 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-07 22:31:57,226 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-07 22:31:57,226 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-07 22:31:57,226 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-07 22:31:57,226 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-07 22:31:57,226 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-07 22:31:57,226 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-07 22:31:57,226 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-07 22:31:57,227 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-07 22:31:57,227 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-07 22:31:57,227 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-07 22:31:57,227 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-07 22:31:57,228 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-07 22:31:57,229 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-07 22:31:57,229 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-07 22:31:57,229 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-07 22:31:57,230 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-07 22:31:57,231 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-07 22:31:57,232 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-07 22:31:57,232 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-07 22:31:57,232 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-07 22:31:57,232 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-07 22:31:57,232 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-07 22:31:57,232 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-07 22:31:57,233 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-07 22:31:57,233 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-07 22:31:57,233 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-07 22:31:57,234 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-07 22:31:57,234 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-07 22:31:57,234 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-07 22:31:57,234 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-07 22:31:57,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {1856#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1856#true} is VALID [2022-04-07 22:31:57,234 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-07 22:31:57,234 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-07 22:31:57,234 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-07 22:31:57,234 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-07 22:31:57,235 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-07 22:31:57,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564829548] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:31:57,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:31:57,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-04-07 22:31:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187282506] [2022-04-07 22:31:57,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:31:57,236 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-07 22:31:57,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:31:57,236 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-07 22:31:57,276 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-07 22:31:57,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 22:31:57,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:31:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 22:31:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-07 22:31:57,277 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-07 22:31:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:58,067 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2022-04-07 22:31:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 22:31:58,068 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-07 22:31:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:31:58,068 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-07 22:31:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-04-07 22:31:58,070 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-07 22:31:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2022-04-07 22:31:58,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 93 transitions. [2022-04-07 22:31:58,148 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-07 22:31:58,149 INFO L225 Difference]: With dead ends: 129 [2022-04-07 22:31:58,149 INFO L226 Difference]: Without dead ends: 82 [2022-04-07 22:31:58,150 INFO L912 BasicCegarLoop]: 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-07 22:31:58,150 INFO L913 BasicCegarLoop]: 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-07 22:31:58,151 INFO L914 BasicCegarLoop]: 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-07 22:31:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-07 22:31:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2022-04-07 22:31:58,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:31:58,251 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-07 22:31:58,251 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-07 22:31:58,251 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-07 22:31:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:58,253 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-07 22:31:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-07 22:31:58,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:58,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:58,254 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-07 22:31:58,254 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-07 22:31:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:31:58,257 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-07 22:31:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-04-07 22:31:58,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:31:58,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:31:58,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:31:58,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:31:58,258 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-07 22:31:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-07 22:31:58,259 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 42 [2022-04-07 22:31:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:31:58,260 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-07 22:31:58,260 INFO L479 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-07 22:31:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-07 22:31:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 22:31:58,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:31:58,260 INFO L499 BasicCegarLoop]: 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-07 22:31:58,277 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-07 22:31:58,476 WARN L460 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-07 22:31:58,477 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:31:58,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:31:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1192666941, now seen corresponding path program 1 times [2022-04-07 22:31:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:31:58,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077174977] [2022-04-07 22:31:58,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:31:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:58,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:31:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:58,554 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-07 22:31:58,554 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-07 22:31:58,554 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-07 22:31:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 22:31:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:58,559 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-07 22:31:58,559 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-07 22:31:58,560 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-07 22:31:58,562 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-07 22:31:58,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 22:31:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:58,573 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-07 22:31:58,574 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-07 22:31:58,574 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-07 22:31:58,574 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-07 22:31:58,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-07 22:31:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:58,578 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-07 22:31:58,578 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-07 22:31:58,578 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-07 22:31:58,578 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-07 22:31:58,578 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-07 22:31:58,579 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-07 22:31:58,579 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-07 22:31:58,579 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-07 22:31:58,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {2614#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-07 22:31:58,579 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-07 22:31:58,579 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-07 22:31:58,579 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-07 22:31:58,579 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-07 22:31:58,580 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-07 22:31:58,580 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-07 22:31:58,580 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-07 22:31:58,580 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-07 22:31:58,580 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-07 22:31:58,581 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-07 22:31:58,581 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-07 22:31:58,581 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-07 22:31:58,581 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-07 22:31:58,581 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-07 22:31:58,581 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-07 22:31:58,581 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-07 22:31:58,582 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-07 22:31:58,582 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-07 22:31:58,583 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-07 22:31:58,583 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-07 22:31:58,583 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-07 22:31:58,583 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,584 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-07 22:31:58,585 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-07 22:31:58,585 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-07 22:31:58,585 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-07 22:31:58,585 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-07 22:31:58,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:31:58,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077174977] [2022-04-07 22:31:58,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077174977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:31:58,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129421107] [2022-04-07 22:31:58,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:31:58,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:31:58,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:31:58,587 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-07 22:31:58,588 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-07 22:31:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:58,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 22:31:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:31:58,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:31:59,042 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-07 22:31:59,042 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-07 22:31:59,042 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-07 22:31:59,042 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-07 22:31:59,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {2614#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-07 22:31:59,043 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-07 22:31:59,043 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-07 22:31:59,043 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-07 22:31:59,043 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-07 22:31:59,044 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-07 22:31:59,044 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-07 22:31:59,044 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-07 22:31:59,044 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-07 22:31:59,045 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-07 22:31:59,045 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-07 22:31:59,045 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-07 22:31:59,045 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-07 22:31:59,045 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-07 22:31:59,045 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-07 22:31:59,045 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-07 22:31:59,046 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-07 22:31:59,046 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-07 22:31:59,047 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-07 22:31:59,047 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-07 22:31:59,048 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-07 22:31:59,048 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-07 22:31:59,048 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-07 22:31:59,048 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,049 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-07 22:31:59,050 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-07 22:31:59,050 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-07 22:31:59,050 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-07 22:31:59,050 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-07 22:31:59,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:31:59,218 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-07 22:31:59,218 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-07 22:31:59,218 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-07 22:31:59,218 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-07 22:31:59,218 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-07 22:31:59,218 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-07 22:31:59,218 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-07 22:31:59,219 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-07 22:31:59,219 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-07 22:31:59,219 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-07 22:31:59,219 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-07 22:31:59,219 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-07 22:31:59,219 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-07 22:31:59,219 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-07 22:31:59,219 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-07 22:31:59,219 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-07 22:31:59,219 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-07 22:31:59,219 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-07 22:31:59,221 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-07 22:31:59,221 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-07 22:31:59,222 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-07 22:31:59,222 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-07 22:31:59,223 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-07 22:31:59,223 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-07 22:31:59,223 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-07 22:31:59,223 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-07 22:31:59,223 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-07 22:31:59,223 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-07 22:31:59,223 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-07 22:31:59,224 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-07 22:31:59,224 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-07 22:31:59,224 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-07 22:31:59,235 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-07 22:31:59,235 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-07 22:31:59,236 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-07 22:31:59,236 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-07 22:31:59,236 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-07 22:31:59,236 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-07 22:31:59,236 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-07 22:31:59,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {2614#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2614#true} is VALID [2022-04-07 22:31:59,237 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-07 22:31:59,237 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-07 22:31:59,237 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-07 22:31:59,237 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-07 22:31:59,237 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-07 22:31:59,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129421107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:31:59,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:31:59,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-04-07 22:31:59,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102011212] [2022-04-07 22:31:59,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:31:59,238 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-07 22:31:59,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:31:59,239 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-07 22:31:59,280 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-07 22:31:59,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 22:31:59,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:31:59,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 22:31:59,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-07 22:31:59,281 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-07 22:32:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:00,133 INFO L93 Difference]: Finished difference Result 138 states and 178 transitions. [2022-04-07 22:32:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 22:32:00,133 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-07 22:32:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:32:00,134 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-07 22:32:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-07 22:32:00,135 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-07 22:32:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-07 22:32:00,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2022-04-07 22:32:00,211 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-07 22:32:00,212 INFO L225 Difference]: With dead ends: 138 [2022-04-07 22:32:00,213 INFO L226 Difference]: Without dead ends: 93 [2022-04-07 22:32:00,213 INFO L912 BasicCegarLoop]: 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-07 22:32:00,213 INFO L913 BasicCegarLoop]: 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-07 22:32:00,214 INFO L914 BasicCegarLoop]: 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-07 22:32:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-07 22:32:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2022-04-07 22:32:00,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:32:00,330 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-07 22:32:00,330 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-07 22:32:00,330 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-07 22:32:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:00,333 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-07 22:32:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-07 22:32:00,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:00,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:00,333 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-07 22:32:00,334 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-07 22:32:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:00,336 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-07 22:32:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-07 22:32:00,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:00,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:00,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:32:00,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:32:00,337 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-07 22:32:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2022-04-07 22:32:00,338 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 44 [2022-04-07 22:32:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:32:00,338 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2022-04-07 22:32:00,339 INFO L479 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-07 22:32:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2022-04-07 22:32:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 22:32:00,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:32:00,339 INFO L499 BasicCegarLoop]: 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-07 22:32:00,355 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-07 22:32:00,555 WARN L460 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-07 22:32:00,555 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:32:00,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:32:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1839163900, now seen corresponding path program 1 times [2022-04-07 22:32:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:32:00,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187507665] [2022-04-07 22:32:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:32:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:32:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:00,622 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-07 22:32:00,622 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-07 22:32:00,622 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-07 22:32:00,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 22:32:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:00,624 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-07 22:32:00,624 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-07 22:32:00,624 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-07 22:32:00,624 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-07 22:32:00,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 22:32:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:00,628 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-07 22:32:00,628 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-07 22:32:00,628 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-07 22:32:00,628 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-07 22:32:00,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-07 22:32:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:00,630 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-07 22:32:00,630 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-07 22:32:00,631 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-07 22:32:00,631 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-07 22:32:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-07 22:32:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:00,635 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-07 22:32:00,635 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-07 22:32:00,635 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-07 22:32:00,636 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-07 22:32:00,636 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-07 22:32:00,637 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-07 22:32:00,637 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-07 22:32:00,637 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-07 22:32:00,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {3430#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-07 22:32:00,637 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-07 22:32:00,637 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-07 22:32:00,637 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-07 22:32:00,637 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-07 22:32:00,637 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-07 22:32:00,637 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-07 22:32:00,637 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-07 22:32:00,637 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-07 22:32:00,637 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,638 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-07 22:32:00,639 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-07 22:32:00,639 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-07 22:32:00,639 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-07 22:32:00,639 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-07 22:32:00,639 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-07 22:32:00,639 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-07 22:32:00,639 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-07 22:32:00,639 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-07 22:32:00,639 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-07 22:32:00,639 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-07 22:32:00,639 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-07 22:32:00,640 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-07 22:32:00,640 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-07 22:32:00,641 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-07 22:32:00,641 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-07 22:32:00,641 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-07 22:32:00,641 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-07 22:32:00,642 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-07 22:32:00,642 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-07 22:32:00,642 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-07 22:32:00,642 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-07 22:32:00,642 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-07 22:32:00,642 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-07 22:32:00,642 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-07 22:32:00,643 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-07 22:32:00,643 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-07 22:32:00,644 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-07 22:32:00,644 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-07 22:32:00,644 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-07 22:32:00,644 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-07 22:32:00,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:32:00,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187507665] [2022-04-07 22:32:00,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187507665] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:32:00,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296446564] [2022-04-07 22:32:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:00,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:32:00,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:32:00,646 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-07 22:32:00,647 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-07 22:32:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:00,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 22:32:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:00,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:32:01,173 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-07 22:32:01,173 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-07 22:32:01,173 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-07 22:32:01,174 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-07 22:32:01,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {3430#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-07 22:32:01,174 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-07 22:32:01,174 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-07 22:32:01,174 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-07 22:32:01,174 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-07 22:32:01,174 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-07 22:32:01,175 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-07 22:32:01,175 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-07 22:32:01,175 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-07 22:32:01,175 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-07 22:32:01,175 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-07 22:32:01,175 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-07 22:32:01,176 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-07 22:32:01,176 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-07 22:32:01,176 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-07 22:32:01,176 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-07 22:32:01,176 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-07 22:32:01,180 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-07 22:32:01,180 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-07 22:32:01,180 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-07 22:32:01,181 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-07 22:32:01,181 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-07 22:32:01,181 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-07 22:32:01,181 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-07 22:32:01,181 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-07 22:32:01,181 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-07 22:32:01,182 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-07 22:32:01,182 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-07 22:32:01,182 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-07 22:32:01,183 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-07 22:32:01,183 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-07 22:32:01,183 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-07 22:32:01,184 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-07 22:32:01,184 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,185 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-07 22:32:01,186 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-07 22:32:01,186 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-07 22:32:01,186 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-07 22:32:01,186 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-07 22:32:01,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:32:01,401 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-07 22:32:01,401 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-07 22:32:01,401 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-07 22:32:01,401 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-07 22:32:01,401 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-07 22:32:01,401 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-07 22:32:01,402 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-07 22:32:01,402 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-07 22:32:01,402 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-07 22:32:01,402 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-07 22:32:01,402 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-07 22:32:01,402 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-07 22:32:01,402 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-07 22:32:01,402 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-07 22:32:01,402 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-07 22:32:01,402 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-07 22:32:01,402 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-07 22:32:01,403 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-07 22:32:01,403 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-07 22:32:01,404 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-07 22:32:01,404 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-07 22:32:01,404 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-07 22:32:01,405 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-07 22:32:01,405 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-07 22:32:01,406 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-07 22:32:01,406 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-07 22:32:01,406 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-07 22:32:01,406 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-07 22:32:01,406 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-07 22:32:01,407 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-07 22:32:01,407 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-07 22:32:01,407 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-07 22:32:01,408 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-07 22:32:01,409 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-07 22:32:01,409 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-07 22:32:01,409 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-07 22:32:01,409 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-07 22:32:01,409 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-07 22:32:01,409 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-07 22:32:01,410 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-07 22:32:01,410 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-07 22:32:01,410 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-07 22:32:01,410 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-07 22:32:01,410 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-07 22:32:01,410 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-07 22:32:01,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-07 22:32:01,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-07 22:32:01,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-07 22:32:01,411 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-07 22:32:01,411 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-07 22:32:01,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {3430#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3430#true} is VALID [2022-04-07 22:32:01,411 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-07 22:32:01,411 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-07 22:32:01,411 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-07 22:32:01,412 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-07 22:32:01,412 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-07 22:32:01,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296446564] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:32:01,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:32:01,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2022-04-07 22:32:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618613780] [2022-04-07 22:32:01,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:32:01,413 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-07 22:32:01,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:32:01,413 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-07 22:32:01,464 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-07 22:32:01,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 22:32:01,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:32:01,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 22:32:01,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-04-07 22:32:01,465 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-07 22:32:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:03,130 INFO L93 Difference]: Finished difference Result 166 states and 226 transitions. [2022-04-07 22:32:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 22:32:03,130 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-07 22:32:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:32:03,130 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-07 22:32:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 119 transitions. [2022-04-07 22:32:03,132 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-07 22:32:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 119 transitions. [2022-04-07 22:32:03,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 119 transitions. [2022-04-07 22:32:03,224 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-07 22:32:03,225 INFO L225 Difference]: With dead ends: 166 [2022-04-07 22:32:03,225 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 22:32:03,226 INFO L912 BasicCegarLoop]: 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-07 22:32:03,226 INFO L913 BasicCegarLoop]: 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-07 22:32:03,226 INFO L914 BasicCegarLoop]: 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-07 22:32:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 22:32:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 22:32:03,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:32:03,227 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-07 22:32:03,227 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-07 22:32:03,227 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-07 22:32:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:03,227 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:32:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:32:03,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:03,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:03,227 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-07 22:32:03,227 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-07 22:32:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:03,228 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:32:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:32:03,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:03,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:03,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:32:03,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:32:03,228 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-07 22:32:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 22:32:03,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2022-04-07 22:32:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:32:03,228 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 22:32:03,228 INFO L479 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-07 22:32:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:32:03,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:03,230 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:32:03,252 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-07 22:32:03,447 WARN L460 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-07 22:32:03,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 22:32:04,280 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 22:32:04,281 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:32:04,281 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:32:04,281 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:32:04,281 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 22:32:04,281 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:32:04,281 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:32:04,281 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 48) the Hoare annotation is: true [2022-04-07 22:32:04,281 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-07 22:32:04,281 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 48) no Hoare annotation was computed. [2022-04-07 22:32:04,281 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 32) no Hoare annotation was computed. [2022-04-07 22:32:04,281 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 48) no Hoare annotation was computed. [2022-04-07 22:32:04,281 INFO L882 garLoopResultBuilder]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2022-04-07 22:32:04,281 INFO L885 garLoopResultBuilder]: At program point L46(lines 24 48) the Hoare annotation is: true [2022-04-07 22:32:04,281 INFO L878 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-07 22:32:04,281 INFO L878 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-07 22:32:04,282 INFO L882 garLoopResultBuilder]: For program point L33-2(lines 33 45) no Hoare annotation was computed. [2022-04-07 22:32:04,282 INFO L882 garLoopResultBuilder]: For program point L35(lines 35 43) no Hoare annotation was computed. [2022-04-07 22:32:04,282 INFO L878 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-07 22:32:04,282 INFO L878 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-07 22:32:04,282 INFO L882 garLoopResultBuilder]: For program point L42(lines 34 44) no Hoare annotation was computed. [2022-04-07 22:32:04,282 INFO L878 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-07 22:32:04,282 INFO L878 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-07 22:32:04,282 INFO L882 garLoopResultBuilder]: For program point L37-1(lines 36 38) no Hoare annotation was computed. [2022-04-07 22:32:04,282 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-07 22:32:04,282 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-07 22:32:04,282 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-07 22:32:04,282 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-07 22:32:04,282 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-07 22:32:04,282 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-07 22:32:04,284 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:32:04,285 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:32:04,288 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:32:04,289 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:32:04,290 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-07 22:32:04,290 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-07 22:32:04,290 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-07 22:32:04,290 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-07 22:32:04,290 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 22:32:04,290 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-07 22:32:04,290 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-07 22:32:04,292 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-07 22:32:04,292 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 22:32:04,292 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 22:32:04,292 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-07 22:32:04,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:32:04 BasicIcfg [2022-04-07 22:32:04,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:32:04,305 INFO L158 Benchmark]: Toolchain (without parser) took 14329.65ms. Allocated memory was 182.5MB in the beginning and 282.1MB in the end (delta: 99.6MB). Free memory was 124.7MB in the beginning and 220.6MB in the end (delta: -96.0MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. [2022-04-07 22:32:04,305 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 182.5MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:32:04,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.45ms. Allocated memory was 182.5MB in the beginning and 234.9MB in the end (delta: 52.4MB). Free memory was 124.6MB in the beginning and 205.3MB in the end (delta: -80.8MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-04-07 22:32:04,305 INFO L158 Benchmark]: Boogie Preprocessor took 19.01ms. Allocated memory is still 234.9MB. Free memory was 205.3MB in the beginning and 203.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:32:04,305 INFO L158 Benchmark]: RCFGBuilder took 226.53ms. Allocated memory is still 234.9MB. Free memory was 203.7MB in the beginning and 191.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 22:32:04,305 INFO L158 Benchmark]: IcfgTransformer took 41.26ms. Allocated memory is still 234.9MB. Free memory was 190.6MB in the beginning and 189.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:32:04,306 INFO L158 Benchmark]: TraceAbstraction took 13855.64ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 188.5MB in the beginning and 220.6MB in the end (delta: -32.1MB). Peak memory consumption was 147.7MB. Max. memory is 8.0GB. [2022-04-07 22:32:04,307 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.08ms. Allocated memory is still 182.5MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.45ms. Allocated memory was 182.5MB in the beginning and 234.9MB in the end (delta: 52.4MB). Free memory was 124.6MB in the beginning and 205.3MB in the end (delta: -80.8MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.01ms. Allocated memory is still 234.9MB. Free memory was 205.3MB in the beginning and 203.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 226.53ms. Allocated memory is still 234.9MB. Free memory was 203.7MB in the beginning and 191.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 41.26ms. Allocated memory is still 234.9MB. Free memory was 190.6MB in the beginning and 189.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 13855.64ms. Allocated memory was 234.9MB in the beginning and 282.1MB in the end (delta: 47.2MB). Free memory was 188.5MB in the beginning and 220.6MB in the end (delta: -32.1MB). Peak memory consumption was 147.7MB. 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.8s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 479 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 465 mSDsluCounter, 482 SdHoareTripleChecker+Invalid, 1.8s 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.1s 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-07 22:32:04,342 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...