/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-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:46:23,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:46:23,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:46:23,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:46:23,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:46:23,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:46:23,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:46:23,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:46:23,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:46:23,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:46:23,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:46:23,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:46:23,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:46:23,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:46:23,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:46:23,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:46:23,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:46:23,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:46:23,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:46:23,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:46:23,928 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:46:23,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:46:23,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:46:23,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:46:23,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:46:23,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:46:23,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:46:23,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:46:23,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:46:23,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:46:23,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:46:23,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:46:23,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:46:23,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:46:23,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:46:23,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:46:23,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:46:23,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:46:23,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:46:23,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:46:23,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:46:23,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:46:23,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:46:23,983 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:46:23,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:46:23,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:46:23,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:46:23,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:46:23,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:46:23,986 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:46:23,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:46:23,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:46:23,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:46:23,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:46:23,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:46:23,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:46:23,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:46:23,987 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:46:23,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:46:23,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:46:23,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:46:23,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:46:23,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:46:23,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:46:23,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:46:23,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:46:23,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:46:23,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:46:23,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:46:23,989 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:46:23,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:46:23,990 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:46:23,990 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:46:24,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:46:24,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:46:24,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:46:24,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:46:24,248 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:46:24,249 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2022-04-27 21:46:24,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f13f5cce/c41f6bb6035f4aacb7d307fa598d42fc/FLAGfb1d3ca8e [2022-04-27 21:46:24,697 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:46:24,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2022-04-27 21:46:24,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f13f5cce/c41f6bb6035f4aacb7d307fa598d42fc/FLAGfb1d3ca8e [2022-04-27 21:46:24,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f13f5cce/c41f6bb6035f4aacb7d307fa598d42fc [2022-04-27 21:46:24,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:46:24,719 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:46:24,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:46:24,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:46:24,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:46:24,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:46:24" (1/1) ... [2022-04-27 21:46:24,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27aad45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:24, skipping insertion in model container [2022-04-27 21:46:24,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:46:24" (1/1) ... [2022-04-27 21:46:24,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:46:24,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:46:24,919 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-new/half.i[891,904] [2022-04-27 21:46:24,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:46:24,963 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:46:24,982 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-new/half.i[891,904] [2022-04-27 21:46:24,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:46:25,002 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:46:25,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:25 WrapperNode [2022-04-27 21:46:25,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:46:25,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:46:25,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:46:25,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:46:25,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:25" (1/1) ... [2022-04-27 21:46:25,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:25" (1/1) ... [2022-04-27 21:46:25,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:25" (1/1) ... [2022-04-27 21:46:25,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:25" (1/1) ... [2022-04-27 21:46:25,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:25" (1/1) ... [2022-04-27 21:46:25,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:25" (1/1) ... [2022-04-27 21:46:25,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:25" (1/1) ... [2022-04-27 21:46:25,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:46:25,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:46:25,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:46:25,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:46:25,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:25" (1/1) ... [2022-04-27 21:46:25,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:46:25,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:46:25,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:46:25,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:46:25,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:46:25,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:46:25,120 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:46:25,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:46:25,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:46:25,120 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:46:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:46:25,121 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:46:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:46:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:46:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:46:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:46:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:46:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:46:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:46:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:46:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:46:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:46:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:46:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:46:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:46:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:46:25,201 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:46:25,204 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:46:25,355 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:46:25,390 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:46:25,390 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:46:25,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:46:25 BoogieIcfgContainer [2022-04-27 21:46:25,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:46:25,392 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:46:25,392 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:46:25,398 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:46:25,406 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:46:25" (1/1) ... [2022-04-27 21:46:25,408 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:46:25,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:46:25 BasicIcfg [2022-04-27 21:46:25,448 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:46:25,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:46:25,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:46:25,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:46:25,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:46:24" (1/4) ... [2022-04-27 21:46:25,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127ac42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:46:25, skipping insertion in model container [2022-04-27 21:46:25,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:46:25" (2/4) ... [2022-04-27 21:46:25,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127ac42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:46:25, skipping insertion in model container [2022-04-27 21:46:25,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:46:25" (3/4) ... [2022-04-27 21:46:25,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127ac42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:46:25, skipping insertion in model container [2022-04-27 21:46:25,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:46:25" (4/4) ... [2022-04-27 21:46:25,454 INFO L111 eAbstractionObserver]: Analyzing ICFG half.iqvasr [2022-04-27 21:46:25,470 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:46:25,470 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:46:25,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:46:25,529 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@29cf78e2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47f6ac1a [2022-04-27 21:46:25,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:46:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:46:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:46:25,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:46:25,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:46:25,542 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:46:25,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:46:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1612362112, now seen corresponding path program 1 times [2022-04-27 21:46:25,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:46:25,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230129385] [2022-04-27 21:46:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:46:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:25,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:46:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:25,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {25#true} is VALID [2022-04-27 21:46:25,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:46:25,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:46:25,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:46:25,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {25#true} is VALID [2022-04-27 21:46:25,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:46:25,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:46:25,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:46:25,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {25#true} is VALID [2022-04-27 21:46:25,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {25#true} is VALID [2022-04-27 21:46:25,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} [72] L29-3-->L29-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 21:46:25,761 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {26#false} is VALID [2022-04-27 21:46:25,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-27 21:46:25,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 21:46:25,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 21:46:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:25,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:46:25,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230129385] [2022-04-27 21:46:25,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230129385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:46:25,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:46:25,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:46:25,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437553913] [2022-04-27 21:46:25,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:46:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:46:25,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:46:25,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:25,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:25,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:46:25,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:46:25,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:46:25,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:46:25,833 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:25,920 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 21:46:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:46:25,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:46:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:46:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 21:46:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 21:46:25,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-27 21:46:26,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:26,032 INFO L225 Difference]: With dead ends: 34 [2022-04-27 21:46:26,032 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 21:46:26,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:46:26,037 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:46:26,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:46:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 21:46:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 21:46:26,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:46:26,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,067 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,068 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:26,073 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:46:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:46:26,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:26,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:26,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:46:26,074 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:46:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:26,078 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:46:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:46:26,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:26,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:26,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:46:26,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:46:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 21:46:26,092 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 21:46:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:46:26,093 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 21:46:26,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:46:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:46:26,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:46:26,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:46:26,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:46:26,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:46:26,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:46:26,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1611438591, now seen corresponding path program 1 times [2022-04-27 21:46:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:46:26,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893294751] [2022-04-27 21:46:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:26,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:46:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:26,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:46:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:26,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {128#true} is VALID [2022-04-27 21:46:26,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:46:26,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128#true} {128#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:46:26,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {128#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:46:26,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {128#true} is VALID [2022-04-27 21:46:26,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:46:26,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:46:26,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:46:26,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {133#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} is VALID [2022-04-27 21:46:26,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {134#(and (or (= main_~k~0 0) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-27 21:46:26,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {134#(and (or (= main_~k~0 0) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {135#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-27 21:46:26,322 INFO L272 TraceCheckUtils]: 8: Hoare triple {135#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {136#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:46:26,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {137#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:46:26,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {137#(not (= __VERIFIER_assert_~cond 0))} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {129#false} is VALID [2022-04-27 21:46:26,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {129#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#false} is VALID [2022-04-27 21:46:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:26,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:46:26,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893294751] [2022-04-27 21:46:26,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893294751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:46:26,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:46:26,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 21:46:26,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805306642] [2022-04-27 21:46:26,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:46:26,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:46:26,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:46:26,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:26,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:46:26,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:46:26,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:46:26,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:46:26,349 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:26,618 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 21:46:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:46:26,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:46:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:46:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-27 21:46:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-27 21:46:26,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-27 21:46:26,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:26,657 INFO L225 Difference]: With dead ends: 27 [2022-04-27 21:46:26,657 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 21:46:26,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:46:26,660 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:46:26,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:46:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 21:46:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-27 21:46:26,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:46:26,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,665 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,665 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:26,667 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 21:46:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 21:46:26,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:26,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:26,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 21:46:26,668 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 21:46:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:26,669 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 21:46:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 21:46:26,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:26,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:26,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:46:26,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:46:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 21:46:26,671 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-27 21:46:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:46:26,671 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 21:46:26,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 21:46:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:46:26,672 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:46:26,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:46:26,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:46:26,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:46:26,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:46:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1133798095, now seen corresponding path program 1 times [2022-04-27 21:46:26,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:46:26,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726294590] [2022-04-27 21:46:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:46:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:46:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:26,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {258#true} is VALID [2022-04-27 21:46:26,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:26,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:26,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:46:26,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {258#true} is VALID [2022-04-27 21:46:26,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:26,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:26,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:26,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {263#(= main_~n~0 0)} is VALID [2022-04-27 21:46:26,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {263#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {264#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:26,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {265#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:46:26,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {266#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= (+ main_~i~0 (* main_~n~0 2)) (+ (* main_~k~0 2) 1)))} is VALID [2022-04-27 21:46:26,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {266#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= (+ main_~i~0 (* main_~n~0 2)) (+ (* main_~k~0 2) 1)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {267#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:26,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {259#false} is VALID [2022-04-27 21:46:26,808 INFO L272 TraceCheckUtils]: 11: Hoare triple {259#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {259#false} is VALID [2022-04-27 21:46:26,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {259#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {259#false} is VALID [2022-04-27 21:46:26,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {259#false} is VALID [2022-04-27 21:46:26,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {259#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#false} is VALID [2022-04-27 21:46:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:46:26,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726294590] [2022-04-27 21:46:26,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726294590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:46:26,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224085754] [2022-04-27 21:46:26,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:26,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:26,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:46:26,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:46:26,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:46:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:26,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 21:46:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:26,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:46:27,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:27,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} [65] 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] {258#true} is VALID [2022-04-27 21:46:27,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:27,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:27,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:27,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {263#(= main_~n~0 0)} is VALID [2022-04-27 21:46:27,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {263#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {264#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:27,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {265#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:46:27,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(and (= main_~n~0 0) (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {296#(and (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:46:27,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(and (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {300#(and (<= main_~i~0 1) (<= 1 (* main_~k~0 2)))} is VALID [2022-04-27 21:46:27,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {300#(and (<= main_~i~0 1) (<= 1 (* main_~k~0 2)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {259#false} is VALID [2022-04-27 21:46:27,064 INFO L272 TraceCheckUtils]: 11: Hoare triple {259#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {259#false} is VALID [2022-04-27 21:46:27,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {259#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {259#false} is VALID [2022-04-27 21:46:27,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {259#false} is VALID [2022-04-27 21:46:27,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {259#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#false} is VALID [2022-04-27 21:46:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:27,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:46:27,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {259#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#false} is VALID [2022-04-27 21:46:27,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {259#false} is VALID [2022-04-27 21:46:27,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {259#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {259#false} is VALID [2022-04-27 21:46:27,174 INFO L272 TraceCheckUtils]: 11: Hoare triple {259#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {259#false} is VALID [2022-04-27 21:46:27,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#(< main_~i~0 (* main_~k~0 2))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {259#false} is VALID [2022-04-27 21:46:27,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {332#(< (+ main_~i~0 1) (* main_~k~0 2))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {328#(< main_~i~0 (* main_~k~0 2))} is VALID [2022-04-27 21:46:27,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#(< (+ main_~i~0 1) (* main_~k~0 2))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {332#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-27 21:46:27,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {339#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {332#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-27 21:46:27,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {258#true} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {339#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 21:46:27,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {258#true} is VALID [2022-04-27 21:46:27,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:27,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:27,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:27,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} [65] 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] {258#true} is VALID [2022-04-27 21:46:27,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#true} is VALID [2022-04-27 21:46:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:27,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224085754] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:46:27,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:46:27,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 13 [2022-04-27 21:46:27,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986254191] [2022-04-27 21:46:27,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:46:27,181 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:46:27,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:46:27,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:27,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:27,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 21:46:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:46:27,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 21:46:27,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:46:27,204 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:27,578 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 21:46:27,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 21:46:27,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:46:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:46:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2022-04-27 21:46:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2022-04-27 21:46:27,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 43 transitions. [2022-04-27 21:46:27,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:27,627 INFO L225 Difference]: With dead ends: 38 [2022-04-27 21:46:27,627 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 21:46:27,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-04-27 21:46:27,629 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:46:27,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 44 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:46:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 21:46:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-04-27 21:46:27,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:46:27,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:27,637 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:27,637 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:27,639 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 21:46:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 21:46:27,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:27,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:27,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-27 21:46:27,640 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-27 21:46:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:27,641 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 21:46:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 21:46:27,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:27,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:27,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:46:27,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:46:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-27 21:46:27,643 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-04-27 21:46:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:46:27,643 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-27 21:46:27,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-27 21:46:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:46:27,644 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:46:27,644 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:46:27,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:46:27,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:27,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:46:27,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:46:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash 600163970, now seen corresponding path program 1 times [2022-04-27 21:46:27,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:46:27,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635170692] [2022-04-27 21:46:27,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:27,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:46:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:28,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:46:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:28,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {529#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {515#true} is VALID [2022-04-27 21:46:28,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:28,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {515#true} {515#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:28,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {515#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {529#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:46:28,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {515#true} is VALID [2022-04-27 21:46:28,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:28,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:28,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {515#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:28,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {520#(= main_~n~0 0)} is VALID [2022-04-27 21:46:28,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {521#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:28,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {521#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:28,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {521#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {522#(and (= main_~i~0 0) (or (<= 1 main_~n~0) (<= main_~k~0 main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= main_~n~0 1)))} is VALID [2022-04-27 21:46:28,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {522#(and (= main_~i~0 0) (or (<= 1 main_~n~0) (<= main_~k~0 main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= main_~n~0 1)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {523#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 21:46:28,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {523#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {524#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 21:46:28,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {524#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 21:46:28,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {525#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-27 21:46:28,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {525#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {526#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} is VALID [2022-04-27 21:46:28,185 INFO L272 TraceCheckUtils]: 14: Hoare triple {526#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:46:28,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {527#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {528#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:46:28,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#(not (= __VERIFIER_assert_~cond 0))} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {516#false} is VALID [2022-04-27 21:46:28,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {516#false} is VALID [2022-04-27 21:46:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:28,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:46:28,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635170692] [2022-04-27 21:46:28,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635170692] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:46:28,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869913010] [2022-04-27 21:46:28,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:28,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:28,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:46:28,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:46:28,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:46:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:28,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 21:46:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:28,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:46:28,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {515#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:28,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} [65] 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] {515#true} is VALID [2022-04-27 21:46:28,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:28,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:28,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {515#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:28,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {520#(= main_~n~0 0)} is VALID [2022-04-27 21:46:28,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {521#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:28,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {521#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:28,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {521#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {557#(and (= main_~n~0 1) (= main_~i~0 0))} is VALID [2022-04-27 21:46:28,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {557#(and (= main_~n~0 1) (= main_~i~0 0))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {561#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 21:46:28,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {561#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {565#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-27 21:46:28,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {565#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0) (< main_~i~0 (* main_~k~0 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {565#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0) (< main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-27 21:46:28,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {565#(and (= main_~n~0 1) (= (+ (- 1) main_~i~0) 0) (< main_~i~0 (* main_~k~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {572#(and (< 1 (* main_~k~0 2)) (= main_~n~0 1) (<= main_~i~0 2))} is VALID [2022-04-27 21:46:28,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {572#(and (< 1 (* main_~k~0 2)) (= main_~n~0 1) (<= main_~i~0 2))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {576#(and (< 1 (* main_~k~0 2)) (= main_~n~0 1) (<= (* main_~k~0 2) 2))} is VALID [2022-04-27 21:46:28,647 INFO L272 TraceCheckUtils]: 14: Hoare triple {576#(and (< 1 (* main_~k~0 2)) (= main_~n~0 1) (<= (* main_~k~0 2) 2))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:46:28,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:46:28,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {584#(<= 1 __VERIFIER_assert_~cond)} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {516#false} is VALID [2022-04-27 21:46:28,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {516#false} is VALID [2022-04-27 21:46:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:28,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:46:29,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {516#false} is VALID [2022-04-27 21:46:29,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {584#(<= 1 __VERIFIER_assert_~cond)} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {516#false} is VALID [2022-04-27 21:46:29,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:46:29,162 INFO L272 TraceCheckUtils]: 14: Hoare triple {600#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:46:29,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {604#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {600#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 21:46:29,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {608#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {604#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-27 21:46:29,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {608#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 21:46:29,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {615#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {608#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 21:46:29,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {615#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} is VALID [2022-04-27 21:46:29,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {619#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} is VALID [2022-04-27 21:46:29,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {623#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 21:46:29,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {623#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 21:46:29,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {520#(= main_~n~0 0)} is VALID [2022-04-27 21:46:29,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {515#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:29,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:29,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:29,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} [65] 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] {515#true} is VALID [2022-04-27 21:46:29,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {515#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {515#true} is VALID [2022-04-27 21:46:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:29,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869913010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:46:29,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:46:29,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-04-27 21:46:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181261677] [2022-04-27 21:46:29,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:46:29,181 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:46:29,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:46:29,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:29,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:29,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 21:46:29,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:46:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 21:46:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-04-27 21:46:29,243 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:30,514 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-27 21:46:30,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 21:46:30,514 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:46:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:46:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2022-04-27 21:46:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2022-04-27 21:46:30,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 53 transitions. [2022-04-27 21:46:30,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:30,573 INFO L225 Difference]: With dead ends: 47 [2022-04-27 21:46:30,573 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 21:46:30,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=295, Invalid=1511, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 21:46:30,575 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:46:30,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 72 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:46:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 21:46:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-27 21:46:30,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:46:30,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:30,599 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:30,599 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:30,601 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 21:46:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 21:46:30,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:30,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:30,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 21:46:30,602 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 21:46:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:30,603 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 21:46:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 21:46:30,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:30,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:30,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:46:30,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:46:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-27 21:46:30,605 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2022-04-27 21:46:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:46:30,605 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-27 21:46:30,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-27 21:46:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 21:46:30,606 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:46:30,607 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:46:30,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:46:30,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 21:46:30,820 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:46:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:46:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 249106799, now seen corresponding path program 2 times [2022-04-27 21:46:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:46:30,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911287604] [2022-04-27 21:46:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:46:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:31,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:46:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:31,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {860#true} is VALID [2022-04-27 21:46:31,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {860#true} {860#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {860#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:46:31,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {860#true} is VALID [2022-04-27 21:46:31,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {860#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {860#true} {860#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {860#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {860#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {865#(= main_~n~0 0)} is VALID [2022-04-27 21:46:31,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {865#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {866#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:31,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {866#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:31,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {867#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:31,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {868#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:31,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {868#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {868#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:31,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {868#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {868#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:31,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {868#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {869#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 21:46:31,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {869#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {869#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 21:46:31,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {869#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {870#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:31,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {870#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {868#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:31,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {868#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {868#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:31,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {868#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {871#(and (or (<= (+ main_~i~0 3) (* main_~n~0 2)) (<= (+ main_~k~0 1) main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= (* main_~n~0 2) (+ main_~i~0 3))))} is VALID [2022-04-27 21:46:31,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {871#(and (or (<= (+ main_~i~0 3) (* main_~n~0 2)) (<= (+ main_~k~0 1) main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= (* main_~n~0 2) (+ main_~i~0 3))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {872#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= (+ main_~k~0 1) main_~n~0)))} is VALID [2022-04-27 21:46:31,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {872#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= (+ main_~k~0 1) main_~n~0)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {873#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:31,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {873#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {873#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:31,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {873#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {874#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:31,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {874#(and (< main_~n~0 (+ main_~k~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {861#false} is VALID [2022-04-27 21:46:31,101 INFO L272 TraceCheckUtils]: 23: Hoare triple {861#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {861#false} is VALID [2022-04-27 21:46:31,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {861#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {861#false} is VALID [2022-04-27 21:46:31,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {861#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {861#false} is VALID [2022-04-27 21:46:31,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {861#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {861#false} is VALID [2022-04-27 21:46:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:46:31,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:46:31,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911287604] [2022-04-27 21:46:31,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911287604] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:46:31,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471716226] [2022-04-27 21:46:31,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:46:31,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:31,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:46:31,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:46:31,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 21:46:31,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:46:31,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:46:31,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 21:46:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:31,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:46:31,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {860#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#true} [65] 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] {860#true} is VALID [2022-04-27 21:46:31,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {860#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {860#true} {860#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {860#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {860#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {865#(= main_~n~0 0)} is VALID [2022-04-27 21:46:31,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {865#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {866#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:31,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {866#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:31,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {867#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:31,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {906#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:31,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {906#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:31,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {906#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {906#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:31,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {906#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {916#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:31,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {916#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {916#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:31,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {916#(and (<= 1 main_~n~0) (= main_~i~0 2) (<= main_~n~0 1))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {923#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 2))} is VALID [2022-04-27 21:46:31,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {923#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= main_~i~0 2))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {927#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} is VALID [2022-04-27 21:46:31,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {927#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {927#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} is VALID [2022-04-27 21:46:31,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {927#(and (<= main_~n~0 2) (= main_~i~0 3) (<= 2 main_~n~0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {934#(= main_~i~0 3)} is VALID [2022-04-27 21:46:31,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(= main_~i~0 3)} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {938#(= main_~i~0 4)} is VALID [2022-04-27 21:46:31,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {938#(= main_~i~0 4)} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {942#(and (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} is VALID [2022-04-27 21:46:31,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {942#(and (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {942#(and (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} is VALID [2022-04-27 21:46:31,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {942#(and (< main_~i~0 (* main_~k~0 2)) (= main_~i~0 4))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {949#(and (< 4 (* main_~k~0 2)) (<= main_~i~0 5))} is VALID [2022-04-27 21:46:31,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {949#(and (< 4 (* main_~k~0 2)) (<= main_~i~0 5))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {861#false} is VALID [2022-04-27 21:46:31,490 INFO L272 TraceCheckUtils]: 23: Hoare triple {861#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {861#false} is VALID [2022-04-27 21:46:31,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {861#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {861#false} is VALID [2022-04-27 21:46:31,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {861#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {861#false} is VALID [2022-04-27 21:46:31,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {861#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {861#false} is VALID [2022-04-27 21:46:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:31,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:46:31,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {861#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {861#false} is VALID [2022-04-27 21:46:31,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {861#false} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {861#false} is VALID [2022-04-27 21:46:31,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {861#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {861#false} is VALID [2022-04-27 21:46:31,730 INFO L272 TraceCheckUtils]: 23: Hoare triple {861#false} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {861#false} is VALID [2022-04-27 21:46:31,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {977#(< main_~i~0 (* main_~k~0 2))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {861#false} is VALID [2022-04-27 21:46:31,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {981#(< (+ main_~i~0 1) (* main_~k~0 2))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {977#(< main_~i~0 (* main_~k~0 2))} is VALID [2022-04-27 21:46:31,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {981#(< (+ main_~i~0 1) (* main_~k~0 2))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {981#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-27 21:46:31,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {981#(< (+ main_~i~0 1) (* main_~k~0 2))} is VALID [2022-04-27 21:46:31,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 21:46:31,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 21:46:31,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 21:46:31,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 21:46:31,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 21:46:31,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 21:46:31,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 21:46:31,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 21:46:31,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 21:46:31,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {992#(<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))} is VALID [2022-04-27 21:46:31,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 21:46:31,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 21:46:31,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {860#true} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {988#(<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)))} is VALID [2022-04-27 21:46:31,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {860#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {860#true} is VALID [2022-04-27 21:46:31,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {860#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {860#true} {860#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {860#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#true} [65] 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] {860#true} is VALID [2022-04-27 21:46:31,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {860#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {860#true} is VALID [2022-04-27 21:46:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 21:46:31,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471716226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:46:31,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:46:31,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 6] total 25 [2022-04-27 21:46:31,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342959123] [2022-04-27 21:46:31,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:46:31,744 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 21:46:31,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:46:31,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:31,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:31,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 21:46:31,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:46:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 21:46:31,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-04-27 21:46:31,794 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:32,647 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-27 21:46:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 21:46:32,647 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 21:46:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:46:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 51 transitions. [2022-04-27 21:46:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 51 transitions. [2022-04-27 21:46:32,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 51 transitions. [2022-04-27 21:46:32,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:32,702 INFO L225 Difference]: With dead ends: 49 [2022-04-27 21:46:32,703 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 21:46:32,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 21:46:32,704 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:46:32,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 21:46:32,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 21:46:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-04-27 21:46:32,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:46:32,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:32,747 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:32,747 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:32,748 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-27 21:46:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-27 21:46:32,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:32,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:32,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-27 21:46:32,749 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-27 21:46:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:32,751 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-27 21:46:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-27 21:46:32,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:32,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:32,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:46:32,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:46:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-27 21:46:32,752 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2022-04-27 21:46:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:46:32,753 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-27 21:46:32,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:32,753 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 21:46:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 21:46:32,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:46:32,754 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:46:32,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 21:46:32,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:32,971 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:46:32,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:46:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1415796412, now seen corresponding path program 3 times [2022-04-27 21:46:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:46:32,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294198752] [2022-04-27 21:46:32,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:46:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:46:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:46:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:33,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {1284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {1266#true} is VALID [2022-04-27 21:46:33,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {1266#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:33,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1266#true} {1266#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:33,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {1266#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:46:33,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {1284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {1266#true} is VALID [2022-04-27 21:46:33,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {1266#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:33,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1266#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:33,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {1266#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:33,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {1266#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {1271#(= main_~n~0 0)} is VALID [2022-04-27 21:46:33,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {1271#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {1272#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:33,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {1272#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1272#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:33,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {1272#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1273#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:33,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {1273#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:33,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:33,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:33,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1275#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 21:46:33,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {1275#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1275#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 21:46:33,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {1275#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1276#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:33,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {1276#(and (<= (* main_~n~0 2) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:33,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:33,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 21:46:33,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {1274#(and (<= (* main_~n~0 2) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* main_~n~0 2)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1275#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 21:46:33,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {1275#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1275#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} is VALID [2022-04-27 21:46:33,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {1275#(and (<= main_~i~0 (* main_~n~0 2)) (<= (* main_~n~0 2) main_~i~0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1277#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-27 21:46:33,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {1277#(and (or (<= (* main_~n~0 2) (+ main_~i~0 2)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= (+ main_~i~0 2) (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1278#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 21:46:33,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {1278#(and (or (<= (* main_~n~0 2) (+ main_~i~0 1)) (not (<= (+ main_~k~0 1) main_~n~0))) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1279#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 21:46:33,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {1279#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1279#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} is VALID [2022-04-27 21:46:33,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {1279#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~k~0 main_~n~0) (<= (+ main_~i~0 1) (* main_~n~0 2))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1280#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} is VALID [2022-04-27 21:46:33,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {1280#(and (< main_~n~0 (+ main_~k~0 1)) (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {1281#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} is VALID [2022-04-27 21:46:33,297 INFO L272 TraceCheckUtils]: 26: Hoare triple {1281#(and (< main_~n~0 (+ main_~k~0 1)) (<= main_~k~0 main_~n~0))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:46:33,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {1282#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1283#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:46:33,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {1283#(not (= __VERIFIER_assert_~cond 0))} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1267#false} is VALID [2022-04-27 21:46:33,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {1267#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1267#false} is VALID [2022-04-27 21:46:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 21:46:33,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:46:33,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294198752] [2022-04-27 21:46:33,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294198752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:46:33,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28370992] [2022-04-27 21:46:33,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 21:46:33,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:33,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:46:33,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:46:33,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 21:46:33,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-27 21:46:33,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:46:33,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 21:46:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:46:33,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:46:34,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {1266#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:34,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1266#true} [65] 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] {1266#true} is VALID [2022-04-27 21:46:34,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1266#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:34,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1266#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:34,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {1266#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:34,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {1266#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {1271#(= main_~n~0 0)} is VALID [2022-04-27 21:46:34,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {1271#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {1272#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:34,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {1272#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1272#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:46:34,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1272#(and (= main_~n~0 0) (= main_~i~0 0))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1273#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:34,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {1273#(and (<= 1 main_~n~0) (= main_~i~0 0) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1315#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:34,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {1315#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1315#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:34,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {1315#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1315#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:34,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#(and (<= 1 main_~n~0) (= main_~i~0 1) (<= main_~n~0 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1325#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 1) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:34,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {1325#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 1) (<= main_~n~0 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1325#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 1) (<= main_~n~0 1))} is VALID [2022-04-27 21:46:34,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#(and (<= 1 main_~n~0) (= (+ (- 1) main_~i~0) 1) (<= main_~n~0 1))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1332#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-27 21:46:34,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {1332#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ (- 1) main_~i~0) 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1336#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} is VALID [2022-04-27 21:46:34,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {1336#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1336#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} is VALID [2022-04-27 21:46:34,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {1336#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1336#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} is VALID [2022-04-27 21:46:34,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#(and (<= main_~n~0 2) (= (+ (- 2) main_~i~0) 1) (<= 2 main_~n~0))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1346#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-27 21:46:34,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {1346#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1346#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 1))} is VALID [2022-04-27 21:46:34,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {1346#(and (<= main_~n~0 2) (<= 2 main_~n~0) (= (+ main_~i~0 (- 3)) 1))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1353#(and (<= 3 main_~n~0) (= (+ main_~i~0 (- 3)) 1) (<= main_~n~0 3))} is VALID [2022-04-27 21:46:34,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {1353#(and (<= 3 main_~n~0) (= (+ main_~i~0 (- 3)) 1) (<= main_~n~0 3))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1357#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= (+ main_~i~0 (- 4)) 1))} is VALID [2022-04-27 21:46:34,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {1357#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= (+ main_~i~0 (- 4)) 1))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1361#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)) (= (+ main_~i~0 (- 4)) 1))} is VALID [2022-04-27 21:46:34,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {1361#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)) (= (+ main_~i~0 (- 4)) 1))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1361#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)) (= (+ main_~i~0 (- 4)) 1))} is VALID [2022-04-27 21:46:34,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {1361#(and (<= 3 main_~n~0) (<= main_~n~0 3) (< main_~i~0 (* main_~k~0 2)) (= (+ main_~i~0 (- 4)) 1))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1368#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= main_~i~0 6) (<= main_~n~0 3))} is VALID [2022-04-27 21:46:34,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {1368#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= main_~i~0 6) (<= main_~n~0 3))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {1372#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= (* main_~k~0 2) 6) (<= main_~n~0 3))} is VALID [2022-04-27 21:46:34,051 INFO L272 TraceCheckUtils]: 26: Hoare triple {1372#(and (< 5 (* main_~k~0 2)) (<= 3 main_~n~0) (<= (* main_~k~0 2) 6) (<= main_~n~0 3))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:46:34,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {1376#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:46:34,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#(<= 1 __VERIFIER_assert_~cond)} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1267#false} is VALID [2022-04-27 21:46:34,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {1267#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1267#false} is VALID [2022-04-27 21:46:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:34,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:46:35,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {1267#false} [83] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1267#false} is VALID [2022-04-27 21:46:35,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {1380#(<= 1 __VERIFIER_assert_~cond)} [81] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1267#false} is VALID [2022-04-27 21:46:35,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {1376#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:46:35,105 INFO L272 TraceCheckUtils]: 26: Hoare triple {1396#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} [75] L29-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~k~0_7 v_main_~n~0_5) (< v_main_~k~0_7 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_7, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~n~0] {1376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:46:35,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {1400#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [73] L29-3-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[] {1396#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 21:46:35,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {1404#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1400#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-27 21:46:35,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {1404#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1404#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 21:46:35,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {1411#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1404#(or (< (+ main_~i~0 1) (* main_~k~0 2)) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-27 21:46:35,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {1415#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1411#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (+ main_~n~0 1)) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)) (or (<= (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (<= main_~n~0 (div (+ (- 1) (* (- 1) main_~i~0)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)) 1)))} is VALID [2022-04-27 21:46:35,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {1419#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1415#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 1)) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= main_~n~0 (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))))} is VALID [2022-04-27 21:46:35,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {1419#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1419#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 21:46:35,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {1426#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1419#(and (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 2)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 21:46:35,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {1426#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1426#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 21:46:35,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {1426#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1426#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 21:46:35,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 2))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1426#(and (or (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 3)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)) (+ main_~n~0 2))))} is VALID [2022-04-27 21:46:35,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {1440#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1436#(and (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 2))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (+ main_~n~0 1) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))))} is VALID [2022-04-27 21:46:35,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {1440#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1440#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-27 21:46:35,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {1447#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1440#(and (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 4)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-27 21:46:35,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {1447#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} [77] L30-->L29-2: Formula: (not (= (let ((.cse0 (mod v_main_~i~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~i~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1447#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} is VALID [2022-04-27 21:46:35,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {1447#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1447#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} is VALID [2022-04-27 21:46:35,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {1457#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 3))))} [80] L29-2-->L29-3: Formula: (= v_main_~i~0_2 (+ v_main_~i~0_3 1)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1447#(and (or (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (+ main_~n~0 3)) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))) (or (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2))) (< (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 5)) (- 2)))))} is VALID [2022-04-27 21:46:35,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {1461#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} [76] L30-->L29-2: Formula: (and (= v_main_~n~0_2 (+ v_main_~n~0_3 1)) (= 0 (let ((.cse0 (mod v_main_~i~0_7 2))) (ite (and (< v_main_~i~0_7 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)))) InVars {main_~i~0=v_main_~i~0_7, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_7, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~post3, main_~n~0] {1457#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (+ main_~n~0 2) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 3))))} is VALID [2022-04-27 21:46:35,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {1461#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} [74] L29-3-->L30: Formula: (< v_main_~i~0_6 (* v_main_~k~0_5 2)) InVars {main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {1461#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} is VALID [2022-04-27 21:46:35,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {1271#(= main_~n~0 0)} [70] L28-->L29-3: Formula: (and (<= 0 (+ v_main_~k~0_2 1000000)) (= v_main_~i~0_4 0) (<= v_main_~k~0_2 1000000)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~i~0=v_main_~i~0_4, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_~i~0] {1461#(and (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (+ main_~n~0 4))) (or (< (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) 1) (<= (div (+ (* (- 1) main_~i~0) (- 7)) (- 2)) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2))) (<= (+ main_~n~0 3) (div (+ (* (- 1) main_~i~0) (- 6)) (- 2)))))} is VALID [2022-04-27 21:46:35,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {1266#true} [67] mainENTRY-->L28: Formula: (and (= v_main_~i~0_8 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~k~0_6 |v_main_#t~nondet1_2|) (= v_main_~n~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {1271#(= main_~n~0 0)} is VALID [2022-04-27 21:46:35,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {1266#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:35,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1266#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:35,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {1266#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:35,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {1266#true} [65] 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] {1266#true} is VALID [2022-04-27 21:46:35,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {1266#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#true} is VALID [2022-04-27 21:46:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:46:35,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28370992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:46:35,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:46:35,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 40 [2022-04-27 21:46:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811107309] [2022-04-27 21:46:35,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:46:35,123 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 21:46:35,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:46:35,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:35,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:35,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-27 21:46:35,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:46:35,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-27 21:46:35,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1324, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 21:46:35,200 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:36,535 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-27 21:46:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 21:46:36,536 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 21:46:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:46:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2022-04-27 21:46:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2022-04-27 21:46:36,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 40 transitions. [2022-04-27 21:46:36,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:46:36,575 INFO L225 Difference]: With dead ends: 39 [2022-04-27 21:46:36,575 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:46:36,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=579, Invalid=3203, Unknown=0, NotChecked=0, Total=3782 [2022-04-27 21:46:36,578 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 107 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 21:46:36,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 80 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 21:46:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:46:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:46:36,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:46:36,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:46:36,580 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:46:36,580 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:46:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:36,580 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:46:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:46:36,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:36,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:36,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:46:36,581 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:46:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:46:36,581 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:46:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:46:36,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:36,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:46:36,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:46:36,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:46:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:46:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:46:36,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-27 21:46:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:46:36,582 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:46:36,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:46:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:46:36,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:46:36,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:46:36,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 21:46:36,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:46:36,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:46:37,079 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:46:37,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:46:37,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:46:37,079 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:46:37,079 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:46:37,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:46:37,079 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:46:37,079 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 36) the Hoare annotation is: true [2022-04-27 21:46:37,079 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 21:46:37,079 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 36) no Hoare annotation was computed. [2022-04-27 21:46:37,080 INFO L895 garLoopResultBuilder]: At program point L29-3(lines 29 33) the Hoare annotation is: (let ((.cse0 (* main_~n~0 2))) (or (and (= main_~n~0 0) (= main_~i~0 0)) (let ((.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) (< main_~i~0 (* main_~k~0 2)) (<= .cse1 .cse0))) (and (<= main_~i~0 .cse0) (< main_~n~0 (+ main_~k~0 1)) (<= .cse0 main_~i~0)))) [2022-04-27 21:46:37,080 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 36) no Hoare annotation was computed. [2022-04-27 21:46:37,080 INFO L895 garLoopResultBuilder]: At program point L29-4(lines 29 33) the Hoare annotation is: (let ((.cse0 (= main_~n~0 main_~k~0))) (or (and (<= main_~k~0 0) (or (not (= main_~k~0 0)) .cse0)) (let ((.cse4 (* (- 1) main_~i~0))) (let ((.cse2 (div (+ .cse4 (- 2)) (- 2))) (.cse3 (div (+ (- 1) .cse4) (- 2)))) (let ((.cse1 (<= .cse2 .cse3))) (and .cse0 (or .cse1 (<= .cse2 (+ main_~n~0 1))) (or .cse1 (<= main_~n~0 .cse3) (< .cse2 1)))))))) [2022-04-27 21:46:37,080 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 32) no Hoare annotation was computed. [2022-04-27 21:46:37,080 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-04-27 21:46:37,080 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 33) no Hoare annotation was computed. [2022-04-27 21:46:37,080 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:46:37,080 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:46:37,080 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:46:37,080 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:46:37,080 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:46:37,081 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:46:37,083 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-04-27 21:46:37,084 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:46:37,091 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:46:37,091 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:46:37,091 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:46:37,091 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:46:37,091 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:46:37,091 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:46:37,091 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:46:37,091 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:46:37,091 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:46:37,091 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-27 21:46:37,096 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 21:46:37,096 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:46:37,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:46:37 BasicIcfg [2022-04-27 21:46:37,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:46:37,106 INFO L158 Benchmark]: Toolchain (without parser) took 12387.30ms. Allocated memory was 180.4MB in the beginning and 233.8MB in the end (delta: 53.5MB). Free memory was 122.6MB in the beginning and 156.0MB in the end (delta: -33.4MB). Peak memory consumption was 20.9MB. Max. memory is 8.0GB. [2022-04-27 21:46:37,106 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:46:37,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.66ms. Allocated memory was 180.4MB in the beginning and 233.8MB in the end (delta: 53.5MB). Free memory was 122.4MB in the beginning and 205.1MB in the end (delta: -82.7MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 21:46:37,107 INFO L158 Benchmark]: Boogie Preprocessor took 42.91ms. Allocated memory is still 233.8MB. Free memory was 205.1MB in the beginning and 203.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:46:37,108 INFO L158 Benchmark]: RCFGBuilder took 341.90ms. Allocated memory is still 233.8MB. Free memory was 203.5MB in the beginning and 190.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 21:46:37,108 INFO L158 Benchmark]: IcfgTransformer took 55.81ms. Allocated memory is still 233.8MB. Free memory was 190.4MB in the beginning and 188.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:46:37,108 INFO L158 Benchmark]: TraceAbstraction took 11656.19ms. Allocated memory is still 233.8MB. Free memory was 188.3MB in the beginning and 156.0MB in the end (delta: 32.3MB). Peak memory consumption was 33.4MB. Max. memory is 8.0GB. [2022-04-27 21:46:37,110 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.66ms. Allocated memory was 180.4MB in the beginning and 233.8MB in the end (delta: 53.5MB). Free memory was 122.4MB in the beginning and 205.1MB in the end (delta: -82.7MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.91ms. Allocated memory is still 233.8MB. Free memory was 205.1MB in the beginning and 203.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 341.90ms. Allocated memory is still 233.8MB. Free memory was 203.5MB in the beginning and 190.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 55.81ms. Allocated memory is still 233.8MB. Free memory was 190.4MB in the beginning and 188.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 11656.19ms. Allocated memory is still 233.8MB. Free memory was 188.3MB in the beginning and 156.0MB in the end (delta: 32.3MB). Peak memory consumption was 33.4MB. 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 228 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 932 IncrementalHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 75 mSDtfsCounter, 932 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 138 SyntacticMatches, 9 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=5, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 16 PreInvPairs, 31 NumberOfFragments, 133 HoareAnnotationTreeSize, 16 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1272 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 3240 SizeOfPredicates, 14 NumberOfNonLiveVariables, 308 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 15/276 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: 29]: Loop Invariant Derived loop invariant: ((n == 0 && i == 0) || ((n * 2 <= i + 1 && i < k * 2) && i + 1 <= n * 2)) || ((i <= n * 2 && n < k + 1) && n * 2 <= i) RESULT: Ultimate proved your program to be correct! [2022-04-27 21:46:37,140 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...