/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/verisec_NetBSD-libc_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:07:31,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:07:31,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:07:32,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:07:32,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:07:32,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:07:32,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:07:32,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:07:32,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:07:32,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:07:32,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:07:32,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:07:32,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:07:32,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:07:32,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:07:32,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:07:32,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:07:32,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:07:32,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:07:32,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:07:32,037 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:07:32,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:07:32,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:07:32,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:07:32,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:07:32,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:07:32,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:07:32,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:07:32,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:07:32,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:07:32,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:07:32,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:07:32,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:07:32,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:07:32,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:07:32,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:07:32,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:07:32,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:07:32,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:07:32,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:07:32,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:07:32,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:07:32,052 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:07:32,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:07:32,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:07:32,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:07:32,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:07:32,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:07:32,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:07:32,074 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:07:32,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:07:32,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:07:32,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:07:32,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:07:32,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:07:32,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:07:32,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:07:32,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:07:32,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:07:32,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:07:32,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:07:32,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:07:32,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:07:32,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:07:32,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:07:32,076 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:07:32,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:07:32,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:07:32,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:07:32,076 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:07:32,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:07:32,077 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:07:32,077 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 00:07:32,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:07:32,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:07:32,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:07:32,280 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:07:32,280 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:07:32,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i [2022-04-15 00:07:32,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b6e943dd/12e22057532444d2bd73c11ce947a762/FLAGcf2b091e9 [2022-04-15 00:07:32,607 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:07:32,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i [2022-04-15 00:07:32,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b6e943dd/12e22057532444d2bd73c11ce947a762/FLAGcf2b091e9 [2022-04-15 00:07:33,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b6e943dd/12e22057532444d2bd73c11ce947a762 [2022-04-15 00:07:33,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:07:33,048 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:07:33,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:07:33,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:07:33,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:07:33,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c5df62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33, skipping insertion in model container [2022-04-15 00:07:33,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:07:33,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:07:33,208 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/verisec_NetBSD-libc_loop.i[825,838] [2022-04-15 00:07:33,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:07:33,222 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:07:33,229 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/verisec_NetBSD-libc_loop.i[825,838] [2022-04-15 00:07:33,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:07:33,247 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:07:33,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33 WrapperNode [2022-04-15 00:07:33,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:07:33,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:07:33,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:07:33,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:07:33,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:07:33,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:07:33,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:07:33,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:07:33,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:07:33,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:07:33,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 00:07:33,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 00:07:33,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:07:33,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:07:33,340 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:07:33,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:07:33,340 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2022-04-15 00:07:33,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:07:33,341 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:07:33,342 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:07:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:07:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:07:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:07:33,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:07:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:07:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2022-04-15 00:07:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:07:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:07:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 00:07:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:07:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:07:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:07:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:07:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:07:33,393 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:07:33,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:07:33,485 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:07:33,489 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:07:33,490 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:07:33,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:07:33 BoogieIcfgContainer [2022-04-15 00:07:33,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:07:33,491 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:07:33,491 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:07:33,492 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:07:33,494 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:07:33" (1/1) ... [2022-04-15 00:07:33,495 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:07:33,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:07:33 BasicIcfg [2022-04-15 00:07:33,510 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:07:33,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:07:33,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:07:33,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:07:33,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:07:33" (1/4) ... [2022-04-15 00:07:33,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1554aad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:07:33, skipping insertion in model container [2022-04-15 00:07:33,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:33" (2/4) ... [2022-04-15 00:07:33,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1554aad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:07:33, skipping insertion in model container [2022-04-15 00:07:33,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:07:33" (3/4) ... [2022-04-15 00:07:33,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1554aad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:07:33, skipping insertion in model container [2022-04-15 00:07:33,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:07:33" (4/4) ... [2022-04-15 00:07:33,514 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc_loop.iqvasr [2022-04-15 00:07:33,517 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:07:33,517 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:07:33,542 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:07:33,546 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:07:33,547 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:07:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:07:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 00:07:33,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:33,561 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:07:33,561 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:33,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:33,564 INFO L85 PathProgramCache]: Analyzing trace with hash 612194795, now seen corresponding path program 1 times [2022-04-15 00:07:33,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:33,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110183207] [2022-04-15 00:07:33,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:33,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:07:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:33,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {29#true} is VALID [2022-04-15 00:07:33,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:07:33,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:07:33,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:07:33,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {29#true} is VALID [2022-04-15 00:07:33,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:07:33,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:07:33,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:07:33,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [57] mainENTRY-->L46: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= v_main_~bound~0.offset_1 (+ |v_main_~#pathbuf~0.offset_1| 28)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= (+ |v_main_~#pathbuf~0.offset_1| 4) v_~tmp~0.offset_2)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-15 00:07:33,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 00:07:33,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:33,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:33,885 INFO L272 TraceCheckUtils]: 9: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {37#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:07:33,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(not (= |__VERIFIER_assert_#in~cond| 0))} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {38#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:07:33,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(not (= __VERIFIER_assert_~cond 0))} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 00:07:33,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 00:07:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:33,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:07:33,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110183207] [2022-04-15 00:07:33,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110183207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:07:33,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:07:33,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 00:07:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729197226] [2022-04-15 00:07:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:07:33,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:07:33,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:07:33,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:33,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:33,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 00:07:33,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:07:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 00:07:33,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:07:33,923 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:34,313 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-15 00:07:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:07:34,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:07:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:07:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 00:07:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 00:07:34,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-15 00:07:34,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:34,385 INFO L225 Difference]: With dead ends: 55 [2022-04-15 00:07:34,385 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 00:07:34,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:07:34,389 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:07:34,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 57 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:07:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 00:07:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-15 00:07:34,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:07:34,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:34,415 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:34,416 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:34,418 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 00:07:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 00:07:34,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:34,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:34,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 00:07:34,419 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 00:07:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:34,421 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 00:07:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 00:07:34,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:34,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:34,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:07:34,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:07:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 00:07:34,424 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2022-04-15 00:07:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:07:34,424 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 00:07:34,425 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 00:07:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 00:07:34,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:34,426 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:07:34,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:07:34,426 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1895818048, now seen corresponding path program 1 times [2022-04-15 00:07:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:34,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748417337] [2022-04-15 00:07:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:34,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:07:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:34,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {210#true} is VALID [2022-04-15 00:07:34,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 00:07:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:34,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#true} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {210#true} is VALID [2022-04-15 00:07:34,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:34,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:07:34,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {210#true} is VALID [2022-04-15 00:07:34,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} [57] mainENTRY-->L46: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= v_main_~bound~0.offset_1 (+ |v_main_~#pathbuf~0.offset_1| 28)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= (+ |v_main_~#pathbuf~0.offset_1| 4) v_~tmp~0.offset_2)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-15 00:07:34,545 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 00:07:34,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:34,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:34,546 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {210#true} is VALID [2022-04-15 00:07:34,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {210#true} is VALID [2022-04-15 00:07:34,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,547 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:34,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:34,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:34,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:34,550 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:07:34,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:07:34,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {211#false} is VALID [2022-04-15 00:07:34,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#false} is VALID [2022-04-15 00:07:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:07:34,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748417337] [2022-04-15 00:07:34,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748417337] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:07:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745638200] [2022-04-15 00:07:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:34,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:07:34,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:07:34,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:07:34,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 00:07:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:34,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 00:07:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:34,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:07:34,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {210#true} is VALID [2022-04-15 00:07:34,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} [57] mainENTRY-->L46: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= v_main_~bound~0.offset_1 (+ |v_main_~#pathbuf~0.offset_1| 28)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= (+ |v_main_~#pathbuf~0.offset_1| 4) v_~tmp~0.offset_2)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-15 00:07:34,864 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 00:07:34,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:34,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:34,865 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {210#true} is VALID [2022-04-15 00:07:34,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {210#true} is VALID [2022-04-15 00:07:34,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:34,866 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:34,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:34,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:34,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:34,869 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {280#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:07:34,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {280#(<= 1 |__VERIFIER_assert_#in~cond|)} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {284#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:07:34,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {211#false} is VALID [2022-04-15 00:07:34,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#false} is VALID [2022-04-15 00:07:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:34,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:07:35,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#false} is VALID [2022-04-15 00:07:35,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {211#false} is VALID [2022-04-15 00:07:35,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {280#(<= 1 |__VERIFIER_assert_#in~cond|)} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {284#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:07:35,184 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {280#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:07:35,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:35,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:35,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:35,186 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:35,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:35,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:35,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {210#true} is VALID [2022-04-15 00:07:35,187 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {210#true} is VALID [2022-04-15 00:07:35,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:35,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:35,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 00:07:35,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} [57] mainENTRY-->L46: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= v_main_~bound~0.offset_1 (+ |v_main_~#pathbuf~0.offset_1| 28)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= (+ |v_main_~#pathbuf~0.offset_1| 4) v_~tmp~0.offset_2)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-15 00:07:35,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:35,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:35,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:35,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {210#true} is VALID [2022-04-15 00:07:35,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:35,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745638200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:07:35,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:07:35,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-15 00:07:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712321179] [2022-04-15 00:07:35,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:07:35,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 00:07:35,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:07:35,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:07:35,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:35,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 00:07:35,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:07:35,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 00:07:35,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-15 00:07:35,210 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:07:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:35,543 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 00:07:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 00:07:35,543 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 00:07:35,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:07:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:07:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-15 00:07:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:07:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-15 00:07:35,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-15 00:07:35,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:35,577 INFO L225 Difference]: With dead ends: 36 [2022-04-15 00:07:35,577 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 00:07:35,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-04-15 00:07:35,579 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:07:35,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 40 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:07:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 00:07:35,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 00:07:35,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:07:35,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:07:35,590 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:07:35,590 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:07:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:35,592 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 00:07:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 00:07:35,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:35,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:35,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 00:07:35,593 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 00:07:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:35,594 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 00:07:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 00:07:35,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:35,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:35,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:07:35,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:07:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:07:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 00:07:35,597 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2022-04-15 00:07:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:07:35,597 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 00:07:35,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:07:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 00:07:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 00:07:35,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:35,598 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:07:35,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:07:35,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:07:35,815 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:35,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1869530475, now seen corresponding path program 2 times [2022-04-15 00:07:35,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:35,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762403370] [2022-04-15 00:07:35,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:35,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:07:35,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 00:07:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:07:35,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 00:07:35,929 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 00:07:35,930 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:07:35,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:07:35,936 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-15 00:07:35,938 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:07:35,958 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: glob2ENTRY has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 00:07:35,959 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: glob2FINAL has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: glob2EXIT has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:07:35,960 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:07:35,960 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:07:35,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:07:35 BasicIcfg [2022-04-15 00:07:35,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:07:35,961 INFO L158 Benchmark]: Toolchain (without parser) took 2913.50ms. Allocated memory was 225.4MB in the beginning and 280.0MB in the end (delta: 54.5MB). Free memory was 172.9MB in the beginning and 103.3MB in the end (delta: 69.7MB). Peak memory consumption was 123.9MB. Max. memory is 8.0GB. [2022-04-15 00:07:35,962 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 225.4MB. Free memory was 189.0MB in the beginning and 188.8MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:07:35,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.09ms. Allocated memory is still 225.4MB. Free memory was 172.7MB in the beginning and 200.8MB in the end (delta: -28.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:07:35,962 INFO L158 Benchmark]: Boogie Preprocessor took 32.52ms. Allocated memory is still 225.4MB. Free memory was 200.8MB in the beginning and 199.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:07:35,962 INFO L158 Benchmark]: RCFGBuilder took 206.31ms. Allocated memory is still 225.4MB. Free memory was 199.1MB in the beginning and 187.8MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:07:35,963 INFO L158 Benchmark]: IcfgTransformer took 18.26ms. Allocated memory is still 225.4MB. Free memory was 187.8MB in the beginning and 186.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:07:35,963 INFO L158 Benchmark]: TraceAbstraction took 2450.07ms. Allocated memory was 225.4MB in the beginning and 280.0MB in the end (delta: 54.5MB). Free memory was 185.7MB in the beginning and 103.3MB in the end (delta: 82.5MB). Peak memory consumption was 136.7MB. Max. memory is 8.0GB. [2022-04-15 00:07:35,964 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 225.4MB. Free memory was 189.0MB in the beginning and 188.8MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.09ms. Allocated memory is still 225.4MB. Free memory was 172.7MB in the beginning and 200.8MB in the end (delta: -28.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.52ms. Allocated memory is still 225.4MB. Free memory was 200.8MB in the beginning and 199.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 206.31ms. Allocated memory is still 225.4MB. Free memory was 199.1MB in the beginning and 187.8MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 18.26ms. Allocated memory is still 225.4MB. Free memory was 187.8MB in the beginning and 186.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2450.07ms. Allocated memory was 225.4MB in the beginning and 280.0MB in the end (delta: 54.5MB). Free memory was 185.7MB in the beginning and 103.3MB in the end (delta: 82.5MB). Peak memory consumption was 136.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] Char *tmp; VAL [\old(tmp)=50, \old(tmp)=52, tmp={0:0}] [L40] Char pathbuf[1 +1]; [L42] Char *bound = pathbuf + sizeof(pathbuf) - 1; [L44] tmp = pathbuf + sizeof(pathbuf)/sizeof(*pathbuf) - 1 VAL [\old(tmp)=0, \old(tmp)=0, bound={3:28}, pathbuf={3:0}, tmp={3:4}] [L46] CALL glob2 (pathbuf, bound) VAL [\old(tmp)=0, \old(tmp)=0, pathbuf={3:0}, pathlim={3:28}, tmp={3:4}] [L27] Char *p; [L29] p = pathbuf VAL [\old(tmp)=0, \old(tmp)=0, p={3:0}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L29] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={3:0}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L31] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={3:4}] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={3:4}] [L31] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={3:0}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L32] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={3:0}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L29] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={3:4}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L29] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={3:4}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L31] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={3:4}] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={3:4}] [L31] RET __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={3:4}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L32] *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={3:4}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L29] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={3:8}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L29] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={3:8}, pathbuf={3:0}, pathbuf={3:0}, pathlim={3:28}, pathlim={3:28}, tmp={3:4}] [L31] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, tmp={3:4}] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={3:4}] [L16] reach_error() VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={3:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 27 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 328 SizeOfPredicates, 6 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-15 00:07:36,006 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...