/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/loops/heavy-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:05:31,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:05:31,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:05:31,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:05:31,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:05:31,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:05:31,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:05:31,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:05:31,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:05:31,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:05:31,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:05:31,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:05:31,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:05:31,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:05:31,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:05:31,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:05:31,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:05:31,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:05:31,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:05:31,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:05:31,443 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:05:31,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:05:31,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:05:31,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:05:31,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:05:31,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:05:31,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:05:31,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:05:31,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:05:31,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:05:31,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:05:31,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:05:31,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:05:31,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:05:31,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:05:31,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:05:31,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:05:31,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:05:31,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:05:31,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:05:31,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:05:31,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:05:31,473 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:05:31,497 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:05:31,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:05:31,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:05:31,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:05:31,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:05:31,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:05:31,499 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:05:31,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:05:31,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:05:31,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:05:31,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:05:31,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:05:31,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:05:31,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:05:31,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:05:31,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:05:31,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:05:31,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:05:31,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:05:31,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:05:31,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:05:31,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:05:31,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:05:31,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:05:31,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:05:31,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:05:31,501 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:05:31,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:05:31,502 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:05:31,502 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:05:31,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:05:31,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:05:31,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:05:31,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:05:31,716 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:05:31,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy-2.c [2022-04-27 21:05:31,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972f92d62/0cb2ee307b9a41c490d130c5fe6af8cb/FLAG9121b4056 [2022-04-27 21:05:32,118 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:05:32,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-2.c [2022-04-27 21:05:32,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972f92d62/0cb2ee307b9a41c490d130c5fe6af8cb/FLAG9121b4056 [2022-04-27 21:05:32,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972f92d62/0cb2ee307b9a41c490d130c5fe6af8cb [2022-04-27 21:05:32,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:05:32,134 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:05:32,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:05:32,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:05:32,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:05:32,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd40169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32, skipping insertion in model container [2022-04-27 21:05:32,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:05:32,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:05:32,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-2.c[600,613] [2022-04-27 21:05:32,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:05:32,309 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:05:32,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-2.c[600,613] [2022-04-27 21:05:32,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:05:32,345 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:05:32,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32 WrapperNode [2022-04-27 21:05:32,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:05:32,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:05:32,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:05:32,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:05:32,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:05:32,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:05:32,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:05:32,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:05:32,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:05:32,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:32,412 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:05:32,416 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:05:32,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:05:32,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:05:32,447 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:05:32,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:05:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:05:32,501 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:05:32,502 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:05:32,651 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:05:32,655 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:05:32,655 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 21:05:32,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:32 BoogieIcfgContainer [2022-04-27 21:05:32,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:05:32,657 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:05:32,657 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:05:32,659 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:05:32,662 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:32" (1/1) ... [2022-04-27 21:05:32,663 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:05:32,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:05:32 BasicIcfg [2022-04-27 21:05:32,679 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:05:32,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:05:32,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:05:32,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:05:32,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:05:32" (1/4) ... [2022-04-27 21:05:32,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c780f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:05:32, skipping insertion in model container [2022-04-27 21:05:32,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:32" (2/4) ... [2022-04-27 21:05:32,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c780f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:05:32, skipping insertion in model container [2022-04-27 21:05:32,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:32" (3/4) ... [2022-04-27 21:05:32,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c780f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:05:32, skipping insertion in model container [2022-04-27 21:05:32,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:05:32" (4/4) ... [2022-04-27 21:05:32,684 INFO L111 eAbstractionObserver]: Analyzing ICFG heavy-2.cqvasr [2022-04-27 21:05:32,693 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:05:32,693 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:05:32,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:05:32,741 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@103bf8af, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15aec82c [2022-04-27 21:05:32,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:05:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:05:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 21:05:32,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:32,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:32,756 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1140822413, now seen corresponding path program 1 times [2022-04-27 21:05:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:32,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458795839] [2022-04-27 21:05:32,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:32,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:32,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:05:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:33,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {22#true} is VALID [2022-04-27 21:05:33,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:05:33,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:05:33,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:05:33,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {22#true} is VALID [2022-04-27 21:05:33,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:05:33,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:05:33,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {22#true} is VALID [2022-04-27 21:05:33,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {27#(= main_~i~0 0)} is VALID [2022-04-27 21:05:33,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#(= main_~i~0 0)} [64] L12-3-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:05:33,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:05:33,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:05:33,017 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:05:33,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:33,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458795839] [2022-04-27 21:05:33,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458795839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:33,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:33,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:05:33,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592816426] [2022-04-27 21:05:33,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:33,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 21:05:33,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:33,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:33,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:05:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:05:33,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:05:33,079 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:33,251 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-27 21:05:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:05:33,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 21:05:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 21:05:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 21:05:33,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-27 21:05:33,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:33,352 INFO L225 Difference]: With dead ends: 52 [2022-04-27 21:05:33,352 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 21:05:33,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:05:33,360 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:33,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 25 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:05:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 21:05:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2022-04-27 21:05:33,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:33,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,390 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,390 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:33,395 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-27 21:05:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-27 21:05:33,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:33,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:33,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:05:33,396 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:05:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:33,400 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-27 21:05:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-27 21:05:33,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:33,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:33,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:33,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-27 21:05:33,404 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-27 21:05:33,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:33,405 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-27 21:05:33,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 21:05:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:05:33,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:33,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:33,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:05:33,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:33,415 INFO L85 PathProgramCache]: Analyzing trace with hash 195845143, now seen corresponding path program 1 times [2022-04-27 21:05:33,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:33,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52922543] [2022-04-27 21:05:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:33,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:05:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:33,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {197#true} is VALID [2022-04-27 21:05:33,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 21:05:33,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197#true} {197#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 21:05:33,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:05:33,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {197#true} is VALID [2022-04-27 21:05:33,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 21:05:33,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 21:05:33,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {197#true} is VALID [2022-04-27 21:05:33,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {197#true} is VALID [2022-04-27 21:05:33,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#true} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {202#(= main_~j~0 0)} is VALID [2022-04-27 21:05:33,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(= main_~j~0 0)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 21:05:33,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {198#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {198#false} is VALID [2022-04-27 21:05:33,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#false} [64] L12-3-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 21:05:33,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 21:05:33,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {198#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 21:05:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:05:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:33,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52922543] [2022-04-27 21:05:33,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52922543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:33,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:33,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:05:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890891147] [2022-04-27 21:05:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:33,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:05:33,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:33,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,536 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:05:33,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:05:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:33,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:05:33,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:05:33,539 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:33,618 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 21:05:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:05:33,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:05:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 21:05:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 21:05:33,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-27 21:05:33,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:33,667 INFO L225 Difference]: With dead ends: 40 [2022-04-27 21:05:33,667 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 21:05:33,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:05:33,670 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:33,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 20 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:05:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 21:05:33,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2022-04-27 21:05:33,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:33,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,680 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,681 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:33,684 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-27 21:05:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-27 21:05:33,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:33,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:33,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-27 21:05:33,686 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-27 21:05:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:33,695 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-27 21:05:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-04-27 21:05:33,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:33,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:33,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:33,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 21:05:33,698 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-27 21:05:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:33,698 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 21:05:33,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:05:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:05:33,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:33,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:33,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:05:33,699 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1483649217, now seen corresponding path program 1 times [2022-04-27 21:05:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:33,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255037328] [2022-04-27 21:05:33,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:33,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:33,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:05:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:33,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {364#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {358#true} is VALID [2022-04-27 21:05:33,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {358#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {358#true} is VALID [2022-04-27 21:05:33,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {358#true} {358#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {358#true} is VALID [2022-04-27 21:05:33,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {358#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {364#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:05:33,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {358#true} is VALID [2022-04-27 21:05:33,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {358#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {358#true} is VALID [2022-04-27 21:05:33,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {358#true} {358#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {358#true} is VALID [2022-04-27 21:05:33,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {358#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {358#true} is VALID [2022-04-27 21:05:33,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {358#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {358#true} is VALID [2022-04-27 21:05:33,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {358#true} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {358#true} is VALID [2022-04-27 21:05:33,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {358#true} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {363#(= main_~k~0 0)} is VALID [2022-04-27 21:05:33,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#(= main_~k~0 0)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {359#false} is VALID [2022-04-27 21:05:33,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {359#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {359#false} is VALID [2022-04-27 21:05:33,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {359#false} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {359#false} is VALID [2022-04-27 21:05:33,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {359#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {359#false} is VALID [2022-04-27 21:05:33,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {359#false} [64] L12-3-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {359#false} is VALID [2022-04-27 21:05:33,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {359#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {359#false} is VALID [2022-04-27 21:05:33,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {359#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {359#false} is VALID [2022-04-27 21:05:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:05:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:33,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255037328] [2022-04-27 21:05:33,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255037328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:33,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:33,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:05:33,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422415432] [2022-04-27 21:05:33,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:33,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:05:33,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:33,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:33,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:05:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:33,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:05:33,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:05:33,808 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:33,876 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-27 21:05:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:05:33,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:05:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 21:05:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 21:05:33,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 21:05:33,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:33,932 INFO L225 Difference]: With dead ends: 31 [2022-04-27 21:05:33,933 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 21:05:33,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:05:33,935 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:33,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:05:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 21:05:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-27 21:05:33,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:33,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,944 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,944 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:33,945 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 21:05:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 21:05:33,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:33,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:33,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:05:33,946 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 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:05:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:33,947 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 21:05:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 21:05:33,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:33,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:33,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:33,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 21:05:33,949 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-27 21:05:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:33,949 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 21:05:33,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:33,949 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 21:05:33,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:05:33,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:33,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:33,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:05:33,952 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:33,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1830037535, now seen corresponding path program 1 times [2022-04-27 21:05:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:33,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119484884] [2022-04-27 21:05:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:05:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:34,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {496#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {489#true} is VALID [2022-04-27 21:05:34,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-27 21:05:34,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {489#true} {489#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-27 21:05:34,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {496#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:05:34,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {496#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {489#true} is VALID [2022-04-27 21:05:34,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-27 21:05:34,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-27 21:05:34,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {489#true} is VALID [2022-04-27 21:05:34,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {489#true} is VALID [2022-04-27 21:05:34,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#true} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {489#true} is VALID [2022-04-27 21:05:34,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {489#true} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {494#(= main_~k~0 0)} is VALID [2022-04-27 21:05:34,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {494#(= main_~k~0 0)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {494#(= main_~k~0 0)} is VALID [2022-04-27 21:05:34,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#(= main_~k~0 0)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {495#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} is VALID [2022-04-27 21:05:34,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {495#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {490#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {490#false} is VALID [2022-04-27 21:05:34,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#false} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {490#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {490#false} is VALID [2022-04-27 21:05:34,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} [64] L12-3-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {490#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:05:34,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:34,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119484884] [2022-04-27 21:05:34,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119484884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:05:34,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851891109] [2022-04-27 21:05:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:34,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:34,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:34,067 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:05:34,068 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:05:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:34,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 21:05:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:34,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:34,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-27 21:05:34,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {489#true} is VALID [2022-04-27 21:05:34,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-27 21:05:34,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-27 21:05:34,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {489#true} is VALID [2022-04-27 21:05:34,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {515#(= main_~i~0 0)} is VALID [2022-04-27 21:05:34,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {515#(= main_~i~0 0)} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {515#(= main_~i~0 0)} is VALID [2022-04-27 21:05:34,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {515#(= main_~i~0 0)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {515#(= main_~i~0 0)} is VALID [2022-04-27 21:05:34,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {515#(= main_~i~0 0)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {515#(= main_~i~0 0)} is VALID [2022-04-27 21:05:34,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {515#(= main_~i~0 0)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {515#(= main_~i~0 0)} is VALID [2022-04-27 21:05:34,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {515#(= main_~i~0 0)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {515#(= main_~i~0 0)} is VALID [2022-04-27 21:05:34,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#(= main_~i~0 0)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {515#(= main_~i~0 0)} is VALID [2022-04-27 21:05:34,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {515#(= main_~i~0 0)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {515#(= main_~i~0 0)} is VALID [2022-04-27 21:05:34,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {515#(= main_~i~0 0)} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {540#(= main_~i~0 1)} is VALID [2022-04-27 21:05:34,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {540#(= main_~i~0 1)} [64] L12-3-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {490#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:05:34,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:05:34,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {490#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#(< (mod main_~i~0 4294967296) 1048576)} [64] L12-3-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {490#false} is VALID [2022-04-27 21:05:34,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {556#(< (mod main_~i~0 4294967296) 1048576)} is VALID [2022-04-27 21:05:34,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-27 21:05:34,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-27 21:05:34,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-27 21:05:34,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-27 21:05:34,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-27 21:05:34,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-27 21:05:34,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-27 21:05:34,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {560#(< (mod (+ main_~i~0 1) 4294967296) 1048576)} is VALID [2022-04-27 21:05:34,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {489#true} is VALID [2022-04-27 21:05:34,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#true} {489#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-27 21:05:34,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-27 21:05:34,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {489#true} is VALID [2022-04-27 21:05:34,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#true} is VALID [2022-04-27 21:05:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:05:34,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851891109] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:05:34,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:05:34,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-27 21:05:34,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131709447] [2022-04-27 21:05:34,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:05:34,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:05:34,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:34,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 2 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:05:34,430 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:05:34,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 21:05:34,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:34,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 21:05:34,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:05:34,432 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 2 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:05:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:34,789 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2022-04-27 21:05:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 21:05:34,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:05:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 2 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:05:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2022-04-27 21:05:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 2 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:05:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2022-04-27 21:05:34,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 78 transitions. [2022-04-27 21:05:34,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:34,862 INFO L225 Difference]: With dead ends: 66 [2022-04-27 21:05:34,862 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 21:05:34,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-04-27 21:05:34,863 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 55 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:34,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 52 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:05:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 21:05:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-04-27 21:05:34,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:34,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 50 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:34,890 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 50 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:34,890 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 50 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:34,892 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 21:05:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 21:05:34,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:34,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:34,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-27 21:05:34,893 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-27 21:05:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:34,894 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-27 21:05:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-27 21:05:34,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:34,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:34,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:34,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-04-27 21:05:34,896 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 17 [2022-04-27 21:05:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:34,896 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-04-27 21:05:34,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 2 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:05:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-27 21:05:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 21:05:34,897 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:34,897 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:34,926 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:05:35,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:35,108 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:35,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:35,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1722712909, now seen corresponding path program 2 times [2022-04-27 21:05:35,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:35,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648355070] [2022-04-27 21:05:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:05:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:35,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {926#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {918#true} is VALID [2022-04-27 21:05:35,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {918#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#true} is VALID [2022-04-27 21:05:35,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {918#true} {918#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#true} is VALID [2022-04-27 21:05:35,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {918#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {926#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:05:35,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {926#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {918#true} is VALID [2022-04-27 21:05:35,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {918#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#true} is VALID [2022-04-27 21:05:35,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {918#true} {918#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#true} is VALID [2022-04-27 21:05:35,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {918#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {918#true} is VALID [2022-04-27 21:05:35,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {918#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {918#true} is VALID [2022-04-27 21:05:35,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {918#true} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {918#true} is VALID [2022-04-27 21:05:35,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {918#true} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {923#(= main_~k~0 0)} is VALID [2022-04-27 21:05:35,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {923#(= main_~k~0 0)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {923#(= main_~k~0 0)} is VALID [2022-04-27 21:05:35,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {923#(= main_~k~0 0)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {924#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-27 21:05:35,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {924#(and (<= 1 main_~k~0) (<= main_~k~0 1))} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {924#(and (<= 1 main_~k~0) (<= main_~k~0 1))} is VALID [2022-04-27 21:05:35,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {924#(and (<= 1 main_~k~0) (<= main_~k~0 1))} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {925#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 2))} is VALID [2022-04-27 21:05:35,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {925#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 2))} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {919#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {919#false} is VALID [2022-04-27 21:05:35,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {919#false} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {919#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {919#false} is VALID [2022-04-27 21:05:35,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {919#false} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {919#false} is VALID [2022-04-27 21:05:35,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {919#false} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {919#false} is VALID [2022-04-27 21:05:35,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#false} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {919#false} is VALID [2022-04-27 21:05:35,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {919#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {919#false} is VALID [2022-04-27 21:05:35,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {919#false} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {919#false} is VALID [2022-04-27 21:05:35,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {919#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {919#false} is VALID [2022-04-27 21:05:35,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {919#false} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {919#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {919#false} is VALID [2022-04-27 21:05:35,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {919#false} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {919#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {919#false} is VALID [2022-04-27 21:05:35,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {919#false} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {919#false} is VALID [2022-04-27 21:05:35,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {919#false} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {919#false} is VALID [2022-04-27 21:05:35,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {919#false} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {919#false} is VALID [2022-04-27 21:05:35,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {919#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {919#false} is VALID [2022-04-27 21:05:35,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {919#false} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {919#false} is VALID [2022-04-27 21:05:35,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {919#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {919#false} is VALID [2022-04-27 21:05:35,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {919#false} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {919#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {919#false} is VALID [2022-04-27 21:05:35,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {919#false} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {919#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {919#false} is VALID [2022-04-27 21:05:35,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {919#false} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {919#false} is VALID [2022-04-27 21:05:35,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {919#false} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {919#false} is VALID [2022-04-27 21:05:35,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {919#false} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {919#false} is VALID [2022-04-27 21:05:35,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {919#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {919#false} is VALID [2022-04-27 21:05:35,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {919#false} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {919#false} is VALID [2022-04-27 21:05:35,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {919#false} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {919#false} is VALID [2022-04-27 21:05:35,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {919#false} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {919#false} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {919#false} is VALID [2022-04-27 21:05:35,286 INFO L290 TraceCheckUtils]: 44: Hoare triple {919#false} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {919#false} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {919#false} is VALID [2022-04-27 21:05:35,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {919#false} [64] L12-3-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {919#false} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {919#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-27 21:05:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:35,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648355070] [2022-04-27 21:05:35,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648355070] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:05:35,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919403647] [2022-04-27 21:05:35,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:05:35,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:35,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:35,288 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:05:35,289 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:05:35,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 21:05:35,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:05:35,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 21:05:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:35,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:35,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {918#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#true} is VALID [2022-04-27 21:05:35,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {918#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_3| 1))) (and (= 0 |v_~#array~0.offset_1|) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= |v_~#array~0.base_1| 4) (= (store |v_#memory_int_3| |v_~#array~0.base_1| (store ((as const (Array Int Int)) 0) |v_~#array~0.offset_1| 1)) |v_#memory_int_1|) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 1048576 (select |v_#length_1| 4)) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= (select .cse0 0) 48) (= 2 (select |v_#length_1| 1)) (= (select |v_#valid_1| 4) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0))) InVars {#memory_int=|v_#memory_int_3|, #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|, ~#array~0.offset=|v_~#array~0.offset_1|, ~#array~0.base=|v_~#array~0.base_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#memory_int, #NULL.offset, ~#array~0.offset, ~#array~0.base, #NULL.base] {918#true} is VALID [2022-04-27 21:05:35,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {918#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#true} is VALID [2022-04-27 21:05:35,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {918#true} {918#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#true} is VALID [2022-04-27 21:05:35,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {918#true} [58] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {918#true} is VALID [2022-04-27 21:05:35,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {918#true} [61] mainENTRY-->L12-3: Formula: (and (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (= v_main_~i~0_1 0) (= v_main_~a~0_1 1) (= |v_main_#in~argc_1| v_main_~argc_1) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|)) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|} OutVars{main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~argc=v_main_~argc_1, main_~argv.base=v_main_~argv.base_1, main_~argv.offset=v_main_~argv.offset_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0, main_~argc, main_~argv.base, main_~argv.offset, main_~a~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {945#(= main_~a~0 1)} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#(= main_~a~0 1)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {945#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {945#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {945#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {945#(= main_~a~0 1)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {945#(= main_~a~0 1)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {945#(= main_~a~0 1)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {945#(= main_~a~0 1)} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {945#(= main_~a~0 1)} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {945#(= main_~a~0 1)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {945#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {945#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {945#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {945#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {945#(= main_~a~0 1)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {945#(= main_~a~0 1)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {945#(= main_~a~0 1)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {945#(= main_~a~0 1)} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {945#(= main_~a~0 1)} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {945#(= main_~a~0 1)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {945#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {945#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {945#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {945#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {945#(= main_~a~0 1)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {945#(= main_~a~0 1)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {945#(= main_~a~0 1)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {945#(= main_~a~0 1)} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {945#(= main_~a~0 1)} [65] L12-3-->L13-3: Formula: (and (= v_main_~j~0_4 0) (< (mod v_main_~i~0_6 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {945#(= main_~a~0 1)} [70] L13-3-->L14-3: Formula: (and (= v_main_~k~0_4 0) (< (mod v_main_~j~0_6 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {945#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {945#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {945#(= main_~a~0 1)} [77] L14-3-->L14-2: Formula: (let ((.cse2 (mod v_main_~k~0_6 4294967296))) (and (= (store |v_#memory_int_10| |v_~#array~0.base_5| (let ((.cse0 (select |v_#memory_int_10| |v_~#array~0.base_5|))) (store .cse0 (+ (mod v_main_~i~0_7 4294967296) |v_~#array~0.offset_5|) (let ((.cse1 (mod (+ (select .cse0 (+ .cse2 |v_~#array~0.offset_5|)) (select .cse0 (+ |v_~#array~0.offset_5| (mod v_main_~j~0_7 4294967296)))) 256))) (ite (<= .cse1 127) .cse1 (+ (- 256) .cse1)))))) |v_#memory_int_9|) (< .cse2 1048576))) InVars {main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_10|, main_~i~0=v_main_~i~0_7, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} OutVars{main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_7, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~i~0=v_main_~i~0_7, main_#t~mem8=|v_main_#t~mem8_1|, ~#array~0.offset=|v_~#array~0.offset_5|, ~#array~0.base=|v_~#array~0.base_5|} AuxVars[] AssignedVars[main_#t~mem7, #memory_int, main_#t~mem8] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {945#(= main_~a~0 1)} [79] L14-2-->L14-3: Formula: (= v_main_~k~0_1 (+ v_main_~k~0_2 1)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {945#(= main_~a~0 1)} [76] L14-3-->L13-2: Formula: (not (< (mod v_main_~k~0_5 4294967296) 1048576)) InVars {main_~k~0=v_main_~k~0_5} OutVars{main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {945#(= main_~a~0 1)} [78] L13-2-->L13-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {945#(= main_~a~0 1)} [69] L13-3-->L12-2: Formula: (not (< (mod v_main_~j~0_5 4294967296) 1048576)) InVars {main_~j~0=v_main_~j~0_5} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {945#(= main_~a~0 1)} [74] L12-2-->L12-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {945#(= main_~a~0 1)} [64] L12-3-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {945#(= main_~a~0 1)} is VALID [2022-04-27 21:05:35,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {945#(= main_~a~0 1)} [66] L12-4-->L18: Formula: (not (= (mod v_main_~a~0_2 4294967296) 1)) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {919#false} [71] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#false} is VALID [2022-04-27 21:05:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 21:05:35,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:05:35,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919403647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:35,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 21:05:35,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-04-27 21:05:35,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807611672] [2022-04-27 21:05:35,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:35,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 21:05:35,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:35,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:35,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:35,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:05:35,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:35,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:05:35,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:05:35,528 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:35,553 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-27 21:05:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:05:35,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 21:05:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-04-27 21:05:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-04-27 21:05:35,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2022-04-27 21:05:35,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:35,566 INFO L225 Difference]: With dead ends: 50 [2022-04-27 21:05:35,566 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:05:35,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:05:35,568 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:35,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:05:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:05:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:05:35,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:35,568 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:05:35,568 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:05:35,569 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:05:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:35,569 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:05:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:05:35,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:35,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:35,569 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:05:35,569 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:05:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:35,569 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:05:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:05:35,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:35,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:35,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:35,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:35,570 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:05:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:05:35,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-27 21:05:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:35,571 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:05:35,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:05:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:05:35,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:35,573 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:05:35,593 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:05:35,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:35,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:05:35,890 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:05:35,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:05:35,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:05:35,890 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:05:35,890 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:05:35,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:05:35,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:05:35,890 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 7 23) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-27 21:05:35,891 INFO L895 garLoopResultBuilder]: At program point L12-3(lines 12 15) the Hoare annotation is: (= main_~a~0 1) [2022-04-27 21:05:35,891 INFO L899 garLoopResultBuilder]: For program point L12-4(lines 8 23) no Hoare annotation was computed. [2022-04-27 21:05:35,891 INFO L895 garLoopResultBuilder]: At program point L13-3(lines 13 15) the Hoare annotation is: (and (= main_~a~0 1) (< (mod main_~i~0 4294967296) 1048576)) [2022-04-27 21:05:35,891 INFO L895 garLoopResultBuilder]: At program point L18(lines 8 23) the Hoare annotation is: false [2022-04-27 21:05:35,891 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 7 23) no Hoare annotation was computed. [2022-04-27 21:05:35,891 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2022-04-27 21:05:35,891 INFO L895 garLoopResultBuilder]: At program point L14-3(lines 14 15) the Hoare annotation is: (and (= main_~a~0 1) (< (mod main_~i~0 4294967296) 1048576)) [2022-04-27 21:05:35,892 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-04-27 21:05:35,892 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 7 23) no Hoare annotation was computed. [2022-04-27 21:05:35,892 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2022-04-27 21:05:35,892 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 14 15) no Hoare annotation was computed. [2022-04-27 21:05:35,894 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-27 21:05:35,896 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:05:35,901 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:05:35,901 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:05:35,901 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2022-04-27 21:05:35,901 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2022-04-27 21:05:35,902 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:05:35,902 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2022-04-27 21:05:35,902 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2022-04-27 21:05:35,902 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 21:05:35,902 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 21:05:35,903 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 21:05:35,903 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:05:35,903 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:05:35,903 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 21:05:35,903 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 21:05:35,903 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 21:05:35,903 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-27 21:05:35,903 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:05:35,903 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 21:05:35,903 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-27 21:05:35,904 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:05:35,904 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:05:35,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:05:35 BasicIcfg [2022-04-27 21:05:35,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:05:35,914 INFO L158 Benchmark]: Toolchain (without parser) took 3780.06ms. Allocated memory was 197.1MB in the beginning and 261.1MB in the end (delta: 64.0MB). Free memory was 143.7MB in the beginning and 207.3MB in the end (delta: -63.6MB). Peak memory consumption was 722.8kB. Max. memory is 8.0GB. [2022-04-27 21:05:35,914 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:05:35,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.88ms. Allocated memory is still 197.1MB. Free memory was 143.6MB in the beginning and 137.6MB in the end (delta: 5.9MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-27 21:05:35,915 INFO L158 Benchmark]: Boogie Preprocessor took 36.36ms. Allocated memory is still 197.1MB. Free memory was 137.6MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:05:35,915 INFO L158 Benchmark]: RCFGBuilder took 272.81ms. Allocated memory is still 197.1MB. Free memory was 136.0MB in the beginning and 124.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 21:05:35,915 INFO L158 Benchmark]: IcfgTransformer took 21.62ms. Allocated memory is still 197.1MB. Free memory was 124.0MB in the beginning and 122.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:05:35,915 INFO L158 Benchmark]: TraceAbstraction took 3233.08ms. Allocated memory was 197.1MB in the beginning and 261.1MB in the end (delta: 64.0MB). Free memory was 121.9MB in the beginning and 207.3MB in the end (delta: -85.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:05:35,917 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.09ms. Allocated memory is still 197.1MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.88ms. Allocated memory is still 197.1MB. Free memory was 143.6MB in the beginning and 137.6MB in the end (delta: 5.9MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.36ms. Allocated memory is still 197.1MB. Free memory was 137.6MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 272.81ms. Allocated memory is still 197.1MB. Free memory was 136.0MB in the beginning and 124.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 21.62ms. Allocated memory is still 197.1MB. Free memory was 124.0MB in the beginning and 122.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3233.08ms. Allocated memory was 197.1MB in the beginning and 261.1MB in the end (delta: 64.0MB). Free memory was 121.9MB in the beginning and 207.3MB in the end (delta: -85.4MB). There was no memory consumed. 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: 21]: 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 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 147 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 74 mSDtfsCounter, 147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 35, 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, 5 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 33 NumberOfFragments, 43 HoareAnnotationTreeSize, 8 FomulaSimplifications, 406 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 262 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 168 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 454 SizeOfPredicates, 2 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 293/300 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: 13]: Loop Invariant Derived loop invariant: a == 1 && i % 4294967296 < 1048576 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: a == 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: a == 1 && i % 4294967296 < 1048576 RESULT: Ultimate proved your program to be correct! [2022-04-27 21:05:35,938 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...