/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:32:31,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:32:31,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:32:31,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:32:31,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:32:31,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:32:31,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:32:31,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:32:31,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:32:31,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:32:31,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:32:31,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:32:31,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:32:31,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:32:31,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:32:31,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:32:31,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:32:31,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:32:31,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:32:31,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:32:31,336 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:32:31,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:32:31,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:32:31,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:32:31,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:32:31,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:32:31,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:32:31,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:32:31,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:32:31,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:32:31,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:32:31,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:32:31,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:32:31,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:32:31,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:32:31,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:32:31,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:32:31,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:32:31,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:32:31,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:32:31,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:32:31,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:32:31,358 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:32:31,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:32:31,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:32:31,384 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:32:31,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:32:31,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:32:31,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:32:31,386 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:32:31,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:32:31,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:32:31,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:32:31,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:32:31,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:32:31,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:32:31,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:32:31,387 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:32:31,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:32:31,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:32:31,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:32:31,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:32:31,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:32:31,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:32:31,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:32:31,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:32:31,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:32:31,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:32:31,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:32:31,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:32:31,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:32:31,390 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:32:31,390 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:32:31,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:32:31,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:32:31,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:32:31,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:32:31,663 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:32:31,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2022-04-15 00:32:31,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57b9c128/56ad4fc253a44aad975bbab390823c5c/FLAGc4ce05606 [2022-04-15 00:32:32,108 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:32:32,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2022-04-15 00:32:32,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57b9c128/56ad4fc253a44aad975bbab390823c5c/FLAGc4ce05606 [2022-04-15 00:32:32,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57b9c128/56ad4fc253a44aad975bbab390823c5c [2022-04-15 00:32:32,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:32:32,127 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:32:32,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:32:32,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:32:32,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:32:32,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6869a85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32, skipping insertion in model container [2022-04-15 00:32:32,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:32:32,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:32:32,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i[893,906] [2022-04-15 00:32:32,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:32:32,373 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:32:32,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i[893,906] [2022-04-15 00:32:32,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:32:32,411 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:32:32,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32 WrapperNode [2022-04-15 00:32:32,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:32:32,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:32:32,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:32:32,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:32:32,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:32:32,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:32:32,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:32:32,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:32:32,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:32:32,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:32,488 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:32:32,515 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:32:32,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:32:32,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:32:32,531 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:32:32,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:32:32,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:32:32,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:32:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:32:32,532 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:32:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:32:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:32:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:32:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:32:32,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:32:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:32:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:32:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:32:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:32:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:32:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:32:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:32:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:32:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:32:32,596 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:32:32,598 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:32:32,772 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:32:32,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:32:32,778 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:32:32,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:32 BoogieIcfgContainer [2022-04-15 00:32:32,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:32:32,781 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:32:32,781 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:32:32,796 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:32:32,799 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:32" (1/1) ... [2022-04-15 00:32:32,801 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:32:32,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:32:32 BasicIcfg [2022-04-15 00:32:32,836 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:32:32,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:32:32,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:32:32,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:32:32,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:32" (1/4) ... [2022-04-15 00:32:32,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61737451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:32, skipping insertion in model container [2022-04-15 00:32:32,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:32" (2/4) ... [2022-04-15 00:32:32,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61737451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:32, skipping insertion in model container [2022-04-15 00:32:32,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:32" (3/4) ... [2022-04-15 00:32:32,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61737451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:32:32, skipping insertion in model container [2022-04-15 00:32:32,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:32:32" (4/4) ... [2022-04-15 00:32:32,843 INFO L111 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.iqvasr [2022-04-15 00:32:32,847 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:32:32,847 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:32:32,899 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:32:32,906 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:32:32,907 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:32:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:32:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 00:32:32,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:32,929 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:32,929 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:32,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash -665154378, now seen corresponding path program 1 times [2022-04-15 00:32:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:32,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479160785] [2022-04-15 00:32:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:33,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:33,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {26#true} is VALID [2022-04-15 00:32:33,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:32:33,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:32:33,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:33,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {26#true} is VALID [2022-04-15 00:32:33,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:32:33,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:32:33,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:32:33,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [68] mainENTRY-->L33: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet1_2| v_main_~MAXPATHLEN~0_5)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~bound_off~0=v_main_~bound_off~0_2, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_4, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_2, main_~glob2_p_off~0=v_main_~glob2_p_off~0_7, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_5, main_~pathbuf_off~0=v_main_~pathbuf_off~0_2} AuxVars[] AssignedVars[main_~bound_off~0, main_#t~nondet1, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~MAXPATHLEN~0, main_~pathbuf_off~0] {26#true} is VALID [2022-04-15 00:32:33,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [70] L33-->L33-1: Formula: (and (< v_main_~MAXPATHLEN~0_2 2147483647) (< 0 v_main_~MAXPATHLEN~0_2)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} OutVars{main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-15 00:32:33,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} [72] L33-1-->L38-2: Formula: (and (= v_main_~pathbuf_off~0_1 0) (= v_main_~bound_off~0_1 (+ v_main_~pathbuf_off~0_1 v_main_~MAXPATHLEN~0_4)) (= v_main_~glob2_p_off~0_4 v_main_~glob2_pathbuf_off~0_1) (= v_main_~glob2_pathlim_off~0_1 v_main_~bound_off~0_1) (= v_main_~pathbuf_off~0_1 v_main_~glob2_pathbuf_off~0_1)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} OutVars{main_~bound_off~0=v_main_~bound_off~0_1, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_1, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_1, main_~glob2_p_off~0=v_main_~glob2_p_off~0_4, main_~pathbuf_off~0=v_main_~pathbuf_off~0_1, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} AuxVars[] AssignedVars[main_~bound_off~0, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~pathbuf_off~0] {31#(<= 0 main_~glob2_p_off~0)} is VALID [2022-04-15 00:32:33,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(<= 0 main_~glob2_p_off~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {31#(<= 0 main_~glob2_p_off~0)} is VALID [2022-04-15 00:32:33,200 INFO L272 TraceCheckUtils]: 9: Hoare triple {31#(<= 0 main_~glob2_p_off~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:33,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:33,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-15 00:32:33,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-15 00:32:33,204 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:32:33,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:33,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479160785] [2022-04-15 00:32:33,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479160785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:33,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:33,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:33,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267823800] [2022-04-15 00:32:33,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:33,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:32:33,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:33,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:33,240 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:32:33,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:33,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:33,270 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:33,599 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-15 00:32:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:33,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:32:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 00:32:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-15 00:32:33,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-15 00:32:33,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:33,680 INFO L225 Difference]: With dead ends: 45 [2022-04-15 00:32:33,680 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 00:32:33,682 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:32:33,685 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:33,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:32:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 00:32:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 00:32:33,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:33,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:33,721 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:33,722 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:33,726 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 00:32:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 00:32:33,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:33,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:33,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-15 00:32:33,727 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-15 00:32:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:33,729 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 00:32:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 00:32:33,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:33,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:33,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:33,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:32:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 00:32:33,735 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2022-04-15 00:32:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:33,736 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 00:32:33,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:32:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 00:32:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 00:32:33,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:33,737 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:33,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:32:33,737 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:33,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1437979323, now seen corresponding path program 1 times [2022-04-15 00:32:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:33,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914463947] [2022-04-15 00:32:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:33,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:33,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {181#true} is VALID [2022-04-15 00:32:33,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:32:33,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:32:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 00:32:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:33,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {181#true} is VALID [2022-04-15 00:32:33,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} [83] L18-->L18-2: Formula: (not (= 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[] {181#true} is VALID [2022-04-15 00:32:33,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:32:33,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:33,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:33,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {181#true} is VALID [2022-04-15 00:32:33,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:32:33,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:32:33,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:32:33,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} [68] mainENTRY-->L33: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet1_2| v_main_~MAXPATHLEN~0_5)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~bound_off~0=v_main_~bound_off~0_2, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_4, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_2, main_~glob2_p_off~0=v_main_~glob2_p_off~0_7, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_5, main_~pathbuf_off~0=v_main_~pathbuf_off~0_2} AuxVars[] AssignedVars[main_~bound_off~0, main_#t~nondet1, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~MAXPATHLEN~0, main_~pathbuf_off~0] {181#true} is VALID [2022-04-15 00:32:33,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#true} [70] L33-->L33-1: Formula: (and (< v_main_~MAXPATHLEN~0_2 2147483647) (< 0 v_main_~MAXPATHLEN~0_2)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} OutVars{main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} AuxVars[] AssignedVars[] {186#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:33,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#(<= 1 main_~MAXPATHLEN~0)} [72] L33-1-->L38-2: Formula: (and (= v_main_~pathbuf_off~0_1 0) (= v_main_~bound_off~0_1 (+ v_main_~pathbuf_off~0_1 v_main_~MAXPATHLEN~0_4)) (= v_main_~glob2_p_off~0_4 v_main_~glob2_pathbuf_off~0_1) (= v_main_~glob2_pathlim_off~0_1 v_main_~bound_off~0_1) (= v_main_~pathbuf_off~0_1 v_main_~glob2_pathbuf_off~0_1)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} OutVars{main_~bound_off~0=v_main_~bound_off~0_1, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_1, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_1, main_~glob2_p_off~0=v_main_~glob2_p_off~0_4, main_~pathbuf_off~0=v_main_~pathbuf_off~0_1, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} AuxVars[] AssignedVars[main_~bound_off~0, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~pathbuf_off~0] {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:33,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:33,904 INFO L272 TraceCheckUtils]: 9: Hoare triple {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {181#true} is VALID [2022-04-15 00:32:33,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {181#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {181#true} is VALID [2022-04-15 00:32:33,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {181#true} [83] L18-->L18-2: Formula: (not (= 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[] {181#true} is VALID [2022-04-15 00:32:33,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:32:33,905 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {181#true} {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:33,906 INFO L272 TraceCheckUtils]: 14: Hoare triple {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {192#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:33,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {192#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {193#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:33,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-15 00:32:33,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {182#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-15 00:32:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:33,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914463947] [2022-04-15 00:32:33,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914463947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:33,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:33,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:32:33,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919641999] [2022-04-15 00:32:33,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:33,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 00:32:33,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:33,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:32:33,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:33,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:32:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:33,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:32:33,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:32:33,926 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:32:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:34,210 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 00:32:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:32:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 00:32:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:32:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-15 00:32:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:32:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-15 00:32:34,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-15 00:32:34,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:34,267 INFO L225 Difference]: With dead ends: 32 [2022-04-15 00:32:34,267 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 00:32:34,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:32:34,273 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:34,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 37 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:32:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 00:32:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-15 00:32:34,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:34,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 00:32:34,301 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 00:32:34,301 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 00:32:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:34,305 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 00:32:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 00:32:34,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:34,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:34,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-15 00:32:34,308 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-15 00:32:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:34,315 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 00:32:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 00:32:34,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:34,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:34,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:34,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 00:32:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-15 00:32:34,324 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 18 [2022-04-15 00:32:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:34,324 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-15 00:32:34,324 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:32:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 00:32:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 00:32:34,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:34,325 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:34,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:32:34,325 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1407888200, now seen corresponding path program 1 times [2022-04-15 00:32:34,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:34,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896463169] [2022-04-15 00:32:34,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:34,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:34,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {354#true} is VALID [2022-04-15 00:32:34,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {354#true} {354#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 00:32:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:34,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:34,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:34,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-15 00:32:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:34,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:34,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:34,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 00:32:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:34,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:34,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:34,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {354#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:34,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {354#true} is VALID [2022-04-15 00:32:34,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {354#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {354#true} [68] mainENTRY-->L33: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet1_2| v_main_~MAXPATHLEN~0_5)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~bound_off~0=v_main_~bound_off~0_2, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_4, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_2, main_~glob2_p_off~0=v_main_~glob2_p_off~0_7, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_5, main_~pathbuf_off~0=v_main_~pathbuf_off~0_2} AuxVars[] AssignedVars[main_~bound_off~0, main_#t~nondet1, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~MAXPATHLEN~0, main_~pathbuf_off~0] {354#true} is VALID [2022-04-15 00:32:34,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#true} [70] L33-->L33-1: Formula: (and (< v_main_~MAXPATHLEN~0_2 2147483647) (< 0 v_main_~MAXPATHLEN~0_2)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} OutVars{main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} AuxVars[] AssignedVars[] {359#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(<= 1 main_~MAXPATHLEN~0)} [72] L33-1-->L38-2: Formula: (and (= v_main_~pathbuf_off~0_1 0) (= v_main_~bound_off~0_1 (+ v_main_~pathbuf_off~0_1 v_main_~MAXPATHLEN~0_4)) (= v_main_~glob2_p_off~0_4 v_main_~glob2_pathbuf_off~0_1) (= v_main_~glob2_pathlim_off~0_1 v_main_~bound_off~0_1) (= v_main_~pathbuf_off~0_1 v_main_~glob2_pathbuf_off~0_1)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} OutVars{main_~bound_off~0=v_main_~bound_off~0_1, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_1, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_1, main_~glob2_p_off~0=v_main_~glob2_p_off~0_4, main_~pathbuf_off~0=v_main_~pathbuf_off~0_1, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} AuxVars[] AssignedVars[main_~bound_off~0, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~pathbuf_off~0] {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,435 INFO L272 TraceCheckUtils]: 9: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {354#true} is VALID [2022-04-15 00:32:34,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:34,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:34,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,436 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,437 INFO L272 TraceCheckUtils]: 14: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {354#true} is VALID [2022-04-15 00:32:34,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:34,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:34,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,438 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [81] L42-->L38-2: Formula: (= v_main_~glob2_p_off~0_2 (+ v_main_~glob2_p_off~0_3 1)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2, main_~glob2_p_off~0] {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,440 INFO L272 TraceCheckUtils]: 21: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {354#true} is VALID [2022-04-15 00:32:34,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:34,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:34,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,441 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {354#true} {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,442 INFO L272 TraceCheckUtils]: 26: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {374#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:34,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {374#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {375#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:34,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {375#(not (= __VERIFIER_assert_~cond 0))} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {355#false} is VALID [2022-04-15 00:32:34,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {355#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#false} is VALID [2022-04-15 00:32:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 00:32:34,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:34,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896463169] [2022-04-15 00:32:34,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896463169] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:32:34,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115316819] [2022-04-15 00:32:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:34,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:34,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:34,446 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:32:34,454 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:32:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:34,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 00:32:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:34,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:32:34,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {354#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {354#true} is VALID [2022-04-15 00:32:34,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {354#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {354#true} [68] mainENTRY-->L33: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet1_2| v_main_~MAXPATHLEN~0_5)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~bound_off~0=v_main_~bound_off~0_2, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_4, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_2, main_~glob2_p_off~0=v_main_~glob2_p_off~0_7, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_5, main_~pathbuf_off~0=v_main_~pathbuf_off~0_2} AuxVars[] AssignedVars[main_~bound_off~0, main_#t~nondet1, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~MAXPATHLEN~0, main_~pathbuf_off~0] {354#true} is VALID [2022-04-15 00:32:34,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#true} [70] L33-->L33-1: Formula: (and (< v_main_~MAXPATHLEN~0_2 2147483647) (< 0 v_main_~MAXPATHLEN~0_2)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} OutVars{main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} AuxVars[] AssignedVars[] {359#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:34,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(<= 1 main_~MAXPATHLEN~0)} [72] L33-1-->L38-2: Formula: (and (= v_main_~pathbuf_off~0_1 0) (= v_main_~bound_off~0_1 (+ v_main_~pathbuf_off~0_1 v_main_~MAXPATHLEN~0_4)) (= v_main_~glob2_p_off~0_4 v_main_~glob2_pathbuf_off~0_1) (= v_main_~glob2_pathlim_off~0_1 v_main_~bound_off~0_1) (= v_main_~pathbuf_off~0_1 v_main_~glob2_pathbuf_off~0_1)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} OutVars{main_~bound_off~0=v_main_~bound_off~0_1, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_1, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_1, main_~glob2_p_off~0=v_main_~glob2_p_off~0_4, main_~pathbuf_off~0=v_main_~pathbuf_off~0_1, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} AuxVars[] AssignedVars[main_~bound_off~0, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~pathbuf_off~0] {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-15 00:32:34,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-15 00:32:34,941 INFO L272 TraceCheckUtils]: 9: Hoare triple {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {354#true} is VALID [2022-04-15 00:32:34,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:34,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:34,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,945 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {354#true} {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-15 00:32:34,945 INFO L272 TraceCheckUtils]: 14: Hoare triple {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {354#true} is VALID [2022-04-15 00:32:34,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:34,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:34,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,948 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {354#true} {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-15 00:32:34,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} [81] L42-->L38-2: Formula: (= v_main_~glob2_p_off~0_2 (+ v_main_~glob2_p_off~0_3 1)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2, main_~glob2_p_off~0] {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-15 00:32:34,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-15 00:32:34,950 INFO L272 TraceCheckUtils]: 21: Hoare triple {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {354#true} is VALID [2022-04-15 00:32:34,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:34,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:34,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:34,951 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {354#true} {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-15 00:32:34,952 INFO L272 TraceCheckUtils]: 26: Hoare triple {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {460#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:32:34,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {460#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {464#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:32:34,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {464#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {355#false} is VALID [2022-04-15 00:32:34,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {355#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#false} is VALID [2022-04-15 00:32:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 00:32:34,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:32:35,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {355#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#false} is VALID [2022-04-15 00:32:35,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {464#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {355#false} is VALID [2022-04-15 00:32:35,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {460#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {464#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:32:35,176 INFO L272 TraceCheckUtils]: 26: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {460#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:32:35,177 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {354#true} {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:35,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:35,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:35,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:35,178 INFO L272 TraceCheckUtils]: 21: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {354#true} is VALID [2022-04-15 00:32:35,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:35,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [81] L42-->L38-2: Formula: (= v_main_~glob2_p_off~0_2 (+ v_main_~glob2_p_off~0_3 1)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2, main_~glob2_p_off~0] {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:35,180 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:35,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:35,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:35,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:35,181 INFO L272 TraceCheckUtils]: 14: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {354#true} is VALID [2022-04-15 00:32:35,182 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:35,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {354#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:35,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#true} [83] L18-->L18-2: Formula: (not (= 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[] {354#true} is VALID [2022-04-15 00:32:35,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {354#true} is VALID [2022-04-15 00:32:35,183 INFO L272 TraceCheckUtils]: 9: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {354#true} is VALID [2022-04-15 00:32:35,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:35,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(<= 1 main_~MAXPATHLEN~0)} [72] L33-1-->L38-2: Formula: (and (= v_main_~pathbuf_off~0_1 0) (= v_main_~bound_off~0_1 (+ v_main_~pathbuf_off~0_1 v_main_~MAXPATHLEN~0_4)) (= v_main_~glob2_p_off~0_4 v_main_~glob2_pathbuf_off~0_1) (= v_main_~glob2_pathlim_off~0_1 v_main_~bound_off~0_1) (= v_main_~pathbuf_off~0_1 v_main_~glob2_pathbuf_off~0_1)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} OutVars{main_~bound_off~0=v_main_~bound_off~0_1, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_1, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_1, main_~glob2_p_off~0=v_main_~glob2_p_off~0_4, main_~pathbuf_off~0=v_main_~pathbuf_off~0_1, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} AuxVars[] AssignedVars[main_~bound_off~0, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~pathbuf_off~0] {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:35,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#true} [70] L33-->L33-1: Formula: (and (< v_main_~MAXPATHLEN~0_2 2147483647) (< 0 v_main_~MAXPATHLEN~0_2)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} OutVars{main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} AuxVars[] AssignedVars[] {359#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:35,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {354#true} [68] mainENTRY-->L33: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet1_2| v_main_~MAXPATHLEN~0_5)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~bound_off~0=v_main_~bound_off~0_2, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_4, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_2, main_~glob2_p_off~0=v_main_~glob2_p_off~0_7, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_5, main_~pathbuf_off~0=v_main_~pathbuf_off~0_2} AuxVars[] AssignedVars[main_~bound_off~0, main_#t~nondet1, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~MAXPATHLEN~0, main_~pathbuf_off~0] {354#true} is VALID [2022-04-15 00:32:35,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {354#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:35,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:35,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:35,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {354#true} is VALID [2022-04-15 00:32:35,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {354#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {354#true} is VALID [2022-04-15 00:32:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 00:32:35,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115316819] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:32:35,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:32:35,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-15 00:32:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428690701] [2022-04-15 00:32:35,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:32:35,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 30 [2022-04-15 00:32:35,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:35,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 00:32:35,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:35,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 00:32:35,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:35,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 00:32:35,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:32:35,221 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 00:32:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:35,669 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-15 00:32:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:32:35,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 30 [2022-04-15 00:32:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 00:32:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-15 00:32:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 00:32:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-15 00:32:35,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-15 00:32:35,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:35,717 INFO L225 Difference]: With dead ends: 40 [2022-04-15 00:32:35,717 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 00:32:35,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-04-15 00:32:35,719 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:35,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 47 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:32:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 00:32:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 00:32:35,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:35,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 00:32:35,776 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 00:32:35,776 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 00:32:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:35,779 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 00:32:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 00:32:35,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:35,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:35,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-15 00:32:35,780 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-15 00:32:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:35,782 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 00:32:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 00:32:35,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:35,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:35,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:35,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 00:32:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-15 00:32:35,785 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2022-04-15 00:32:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:35,786 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-15 00:32:35,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 00:32:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 00:32:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 00:32:35,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:35,787 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:35,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 00:32:35,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:35,989 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:35,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash -699974453, now seen corresponding path program 2 times [2022-04-15 00:32:35,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:35,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125409633] [2022-04-15 00:32:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:36,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:36,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {760#true} is VALID [2022-04-15 00:32:36,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {760#true} {760#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 00:32:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:36,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-15 00:32:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:36,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 00:32:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:36,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 00:32:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:36,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 00:32:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:36,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:36,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {760#true} is VALID [2022-04-15 00:32:36,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} [68] mainENTRY-->L33: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet1_2| v_main_~MAXPATHLEN~0_5)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~bound_off~0=v_main_~bound_off~0_2, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_4, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_2, main_~glob2_p_off~0=v_main_~glob2_p_off~0_7, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_5, main_~pathbuf_off~0=v_main_~pathbuf_off~0_2} AuxVars[] AssignedVars[main_~bound_off~0, main_#t~nondet1, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~MAXPATHLEN~0, main_~pathbuf_off~0] {760#true} is VALID [2022-04-15 00:32:36,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {760#true} [70] L33-->L33-1: Formula: (and (< v_main_~MAXPATHLEN~0_2 2147483647) (< 0 v_main_~MAXPATHLEN~0_2)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} OutVars{main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#true} [72] L33-1-->L38-2: Formula: (and (= v_main_~pathbuf_off~0_1 0) (= v_main_~bound_off~0_1 (+ v_main_~pathbuf_off~0_1 v_main_~MAXPATHLEN~0_4)) (= v_main_~glob2_p_off~0_4 v_main_~glob2_pathbuf_off~0_1) (= v_main_~glob2_pathlim_off~0_1 v_main_~bound_off~0_1) (= v_main_~pathbuf_off~0_1 v_main_~glob2_pathbuf_off~0_1)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} OutVars{main_~bound_off~0=v_main_~bound_off~0_1, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_1, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_1, main_~glob2_p_off~0=v_main_~glob2_p_off~0_4, main_~pathbuf_off~0=v_main_~pathbuf_off~0_1, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} AuxVars[] AssignedVars[main_~bound_off~0, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~pathbuf_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,190 INFO L272 TraceCheckUtils]: 9: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {760#true} is VALID [2022-04-15 00:32:36,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,191 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,191 INFO L272 TraceCheckUtils]: 14: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {760#true} is VALID [2022-04-15 00:32:36,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,192 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [81] L42-->L38-2: Formula: (= v_main_~glob2_p_off~0_2 (+ v_main_~glob2_p_off~0_3 1)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,193 INFO L272 TraceCheckUtils]: 21: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {760#true} is VALID [2022-04-15 00:32:36,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,194 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,194 INFO L272 TraceCheckUtils]: 26: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {760#true} is VALID [2022-04-15 00:32:36,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,195 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [81] L42-->L38-2: Formula: (= v_main_~glob2_p_off~0_2 (+ v_main_~glob2_p_off~0_3 1)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,196 INFO L272 TraceCheckUtils]: 33: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {760#true} is VALID [2022-04-15 00:32:36,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,197 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {760#true} {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,198 INFO L272 TraceCheckUtils]: 38: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:36,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {787#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {788#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:36,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {788#(not (= __VERIFIER_assert_~cond 0))} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {761#false} is VALID [2022-04-15 00:32:36,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {761#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {761#false} is VALID [2022-04-15 00:32:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-15 00:32:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:36,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125409633] [2022-04-15 00:32:36,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125409633] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:32:36,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775432385] [2022-04-15 00:32:36,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:32:36,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:32:36,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:36,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:32:36,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 00:32:36,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:32:36,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:32:36,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 00:32:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:36,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:32:36,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {760#true} is VALID [2022-04-15 00:32:36,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} [68] mainENTRY-->L33: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet1_2| v_main_~MAXPATHLEN~0_5)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~bound_off~0=v_main_~bound_off~0_2, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_4, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_2, main_~glob2_p_off~0=v_main_~glob2_p_off~0_7, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_5, main_~pathbuf_off~0=v_main_~pathbuf_off~0_2} AuxVars[] AssignedVars[main_~bound_off~0, main_#t~nondet1, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~MAXPATHLEN~0, main_~pathbuf_off~0] {760#true} is VALID [2022-04-15 00:32:36,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {760#true} [70] L33-->L33-1: Formula: (and (< v_main_~MAXPATHLEN~0_2 2147483647) (< 0 v_main_~MAXPATHLEN~0_2)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} OutVars{main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#true} [72] L33-1-->L38-2: Formula: (and (= v_main_~pathbuf_off~0_1 0) (= v_main_~bound_off~0_1 (+ v_main_~pathbuf_off~0_1 v_main_~MAXPATHLEN~0_4)) (= v_main_~glob2_p_off~0_4 v_main_~glob2_pathbuf_off~0_1) (= v_main_~glob2_pathlim_off~0_1 v_main_~bound_off~0_1) (= v_main_~pathbuf_off~0_1 v_main_~glob2_pathbuf_off~0_1)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} OutVars{main_~bound_off~0=v_main_~bound_off~0_1, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_1, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_1, main_~glob2_p_off~0=v_main_~glob2_p_off~0_4, main_~pathbuf_off~0=v_main_~pathbuf_off~0_1, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} AuxVars[] AssignedVars[main_~bound_off~0, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~pathbuf_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,465 INFO L272 TraceCheckUtils]: 9: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {760#true} is VALID [2022-04-15 00:32:36,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,472 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,472 INFO L272 TraceCheckUtils]: 14: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {760#true} is VALID [2022-04-15 00:32:36,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,475 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [81] L42-->L38-2: Formula: (= v_main_~glob2_p_off~0_2 (+ v_main_~glob2_p_off~0_3 1)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,476 INFO L272 TraceCheckUtils]: 21: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {760#true} is VALID [2022-04-15 00:32:36,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,477 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,478 INFO L272 TraceCheckUtils]: 26: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {760#true} is VALID [2022-04-15 00:32:36,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,479 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [81] L42-->L38-2: Formula: (= v_main_~glob2_p_off~0_2 (+ v_main_~glob2_p_off~0_3 1)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,486 INFO L272 TraceCheckUtils]: 33: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {760#true} is VALID [2022-04-15 00:32:36,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,492 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {760#true} {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,493 INFO L272 TraceCheckUtils]: 38: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {907#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:32:36,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {907#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {911#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:32:36,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {911#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {761#false} is VALID [2022-04-15 00:32:36,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {761#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {761#false} is VALID [2022-04-15 00:32:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-15 00:32:36,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:32:36,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {761#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {761#false} is VALID [2022-04-15 00:32:36,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {911#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {761#false} is VALID [2022-04-15 00:32:36,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {907#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {911#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:32:36,739 INFO L272 TraceCheckUtils]: 38: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {907#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:32:36,740 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {760#true} {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,740 INFO L272 TraceCheckUtils]: 33: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {760#true} is VALID [2022-04-15 00:32:36,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [81] L42-->L38-2: Formula: (= v_main_~glob2_p_off~0_2 (+ v_main_~glob2_p_off~0_3 1)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,742 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,742 INFO L272 TraceCheckUtils]: 26: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {760#true} is VALID [2022-04-15 00:32:36,743 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,744 INFO L272 TraceCheckUtils]: 21: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {760#true} is VALID [2022-04-15 00:32:36,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [81] L42-->L38-2: Formula: (= v_main_~glob2_p_off~0_2 (+ v_main_~glob2_p_off~0_3 1)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_2, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_#t~post2, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,745 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [90] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,746 INFO L272 TraceCheckUtils]: 14: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [79] L41-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< v_main_~glob2_p_off~0_10 (+ v_main_~MAXPATHLEN~0_8 1)) 1 0)) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_10, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0, main_~MAXPATHLEN~0] {760#true} is VALID [2022-04-15 00:32:36,746 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [89] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#true} [83] L18-->L18-2: Formula: (not (= 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[] {760#true} is VALID [2022-04-15 00:32:36,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {760#true} is VALID [2022-04-15 00:32:36,747 INFO L272 TraceCheckUtils]: 9: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [78] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~glob2_p_off~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~glob2_p_off~0] {760#true} is VALID [2022-04-15 00:32:36,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [76] L38-2-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} OutVars{main_~glob2_p_off~0=v_main_~glob2_p_off~0_6, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3} AuxVars[] AssignedVars[] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#true} [72] L33-1-->L38-2: Formula: (and (= v_main_~pathbuf_off~0_1 0) (= v_main_~bound_off~0_1 (+ v_main_~pathbuf_off~0_1 v_main_~MAXPATHLEN~0_4)) (= v_main_~glob2_p_off~0_4 v_main_~glob2_pathbuf_off~0_1) (= v_main_~glob2_pathlim_off~0_1 v_main_~bound_off~0_1) (= v_main_~pathbuf_off~0_1 v_main_~glob2_pathbuf_off~0_1)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} OutVars{main_~bound_off~0=v_main_~bound_off~0_1, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_1, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_1, main_~glob2_p_off~0=v_main_~glob2_p_off~0_4, main_~pathbuf_off~0=v_main_~pathbuf_off~0_1, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_4} AuxVars[] AssignedVars[main_~bound_off~0, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~pathbuf_off~0] {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-15 00:32:36,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {760#true} [70] L33-->L33-1: Formula: (and (< v_main_~MAXPATHLEN~0_2 2147483647) (< 0 v_main_~MAXPATHLEN~0_2)) InVars {main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} OutVars{main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_2} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} [68] mainENTRY-->L33: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= |v_main_#t~nondet1_2| v_main_~MAXPATHLEN~0_5)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~bound_off~0=v_main_~bound_off~0_2, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_4, main_~glob2_pathbuf_off~0=v_main_~glob2_pathbuf_off~0_2, main_~glob2_p_off~0=v_main_~glob2_p_off~0_7, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_5, main_~pathbuf_off~0=v_main_~pathbuf_off~0_2} AuxVars[] AssignedVars[main_~bound_off~0, main_#t~nondet1, main_~glob2_pathlim_off~0, main_~glob2_pathbuf_off~0, main_~glob2_p_off~0, main_~MAXPATHLEN~0, main_~pathbuf_off~0] {760#true} is VALID [2022-04-15 00:32:36,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {760#true} is VALID [2022-04-15 00:32:36,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-15 00:32:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-15 00:32:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775432385] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:32:36,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:32:36,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 00:32:36,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898231325] [2022-04-15 00:32:36,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:32:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2022-04-15 00:32:36,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:36,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 00:32:36,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:36,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 00:32:36,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 00:32:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:32:36,779 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 00:32:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:36,992 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 00:32:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:32:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2022-04-15 00:32:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 00:32:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 00:32:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 00:32:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 00:32:36,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 00:32:37,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:37,017 INFO L225 Difference]: With dead ends: 37 [2022-04-15 00:32:37,017 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:32:37,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:32:37,018 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:37,019 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 36 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:32:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:32:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:32:37,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:37,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:32:37,020 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:32:37,020 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:32:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:37,020 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:32:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:32:37,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:37,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:37,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:32:37,021 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:32:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:37,021 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:32:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:32:37,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:37,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:37,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:37,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:32:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:32:37,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-04-15 00:32:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:37,022 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:32:37,022 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 00:32:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:32:37,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:37,025 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:32:37,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 00:32:37,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 00:32:37,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:32:37,331 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:32:37,331 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:32:37,331 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:32:37,331 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:32:37,331 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:32:37,331 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:32:37,331 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:32:37,332 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 45) the Hoare annotation is: true [2022-04-15 00:32:37,332 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-15 00:32:37,332 INFO L882 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-04-15 00:32:37,332 INFO L885 garLoopResultBuilder]: At program point L44(lines 25 45) the Hoare annotation is: true [2022-04-15 00:32:37,332 INFO L878 garLoopResultBuilder]: At program point L38-2(lines 38 43) the Hoare annotation is: (and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2022-04-15 00:32:37,332 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 45) no Hoare annotation was computed. [2022-04-15 00:32:37,332 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2022-04-15 00:32:37,332 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 45) no Hoare annotation was computed. [2022-04-15 00:32:37,332 INFO L878 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2022-04-15 00:32:37,333 INFO L882 garLoopResultBuilder]: For program point L42(lines 38 43) no Hoare annotation was computed. [2022-04-15 00:32:37,333 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 00:32:37,333 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-15 00:32:37,333 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-15 00:32:37,333 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:32:37,333 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-15 00:32:37,333 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:32:37,336 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 00:32:37,337 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-15 00:32:37,341 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:32:37,342 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:32:37,342 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:32:37,342 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-15 00:32:37,343 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:32:37,343 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:37,343 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:37,343 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:32:37,343 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-15 00:32:37,343 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:32:37,344 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:32:37,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:32:37 BasicIcfg [2022-04-15 00:32:37,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:32:37,354 INFO L158 Benchmark]: Toolchain (without parser) took 5226.14ms. Allocated memory was 180.4MB in the beginning and 245.4MB in the end (delta: 65.0MB). Free memory was 120.2MB in the beginning and 118.4MB in the end (delta: 1.8MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. [2022-04-15 00:32:37,354 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:32:37,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.92ms. Allocated memory was 180.4MB in the beginning and 245.4MB in the end (delta: 65.0MB). Free memory was 120.0MB in the beginning and 215.7MB in the end (delta: -95.7MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-04-15 00:32:37,354 INFO L158 Benchmark]: Boogie Preprocessor took 41.93ms. Allocated memory is still 245.4MB. Free memory was 215.7MB in the beginning and 214.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:32:37,355 INFO L158 Benchmark]: RCFGBuilder took 323.07ms. Allocated memory is still 245.4MB. Free memory was 214.1MB in the beginning and 202.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 00:32:37,355 INFO L158 Benchmark]: IcfgTransformer took 55.29ms. Allocated memory is still 245.4MB. Free memory was 202.1MB in the beginning and 200.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:32:37,355 INFO L158 Benchmark]: TraceAbstraction took 4515.09ms. Allocated memory is still 245.4MB. Free memory was 200.0MB in the beginning and 118.4MB in the end (delta: 81.6MB). Peak memory consumption was 82.1MB. Max. memory is 8.0GB. [2022-04-15 00:32:37,357 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.12ms. Allocated memory is still 180.4MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.92ms. Allocated memory was 180.4MB in the beginning and 245.4MB in the end (delta: 65.0MB). Free memory was 120.0MB in the beginning and 215.7MB in the end (delta: -95.7MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.93ms. Allocated memory is still 245.4MB. Free memory was 215.7MB in the beginning and 214.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 323.07ms. Allocated memory is still 245.4MB. Free memory was 214.1MB in the beginning and 202.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 55.29ms. Allocated memory is still 245.4MB. Free memory was 202.1MB in the beginning and 200.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4515.09ms. Allocated memory is still 245.4MB. Free memory was 200.0MB in the beginning and 118.4MB in the end (delta: 81.6MB). Peak memory consumption was 82.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 65 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 163 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=3, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 16 PreInvPairs, 27 NumberOfFragments, 48 HoareAnnotationTreeSize, 16 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 102 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 479 SizeOfPredicates, 9 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 224/245 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (1 <= MAXPATHLEN && glob2_pathlim_off <= MAXPATHLEN) && 0 <= glob2_p_off - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 00:32:37,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...