/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:59:35,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:59:35,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:59:35,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:59:35,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:59:35,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:59:35,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:59:35,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:59:35,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:59:35,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:59:35,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:59:35,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:59:35,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:59:35,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:59:35,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:59:35,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:59:35,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:59:35,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:59:35,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:59:35,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:59:35,718 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:59:35,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:59:35,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:59:35,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:59:35,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:59:35,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:59:35,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:59:35,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:59:35,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:59:35,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:59:35,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:59:35,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:59:35,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:59:35,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:59:35,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:59:35,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:59:35,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:59:35,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:59:35,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:59:35,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:59:35,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:59:35,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:59:35,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:59:35,743 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:59:35,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:59:35,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:59:35,744 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:59:35,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:59:35,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:59:35,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:59:35,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:59:35,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:59:35,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:59:35,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:59:35,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:59:35,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:59:35,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:59:35,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:59:35,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:59:35,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:59:35,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:59:35,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:59:35,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:59:35,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:59:35,747 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:59:35,747 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 16:59:35,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:59:35,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:59:35,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:59:35,948 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:59:35,948 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:59:35,949 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-07 16:59:35,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a3f602b/f05eaa9238894b969f91fd9df74e33fa/FLAG9d0bb8e39 [2022-04-07 16:59:36,358 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:59:36,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2022-04-07 16:59:36,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a3f602b/f05eaa9238894b969f91fd9df74e33fa/FLAG9d0bb8e39 [2022-04-07 16:59:36,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a3f602b/f05eaa9238894b969f91fd9df74e33fa [2022-04-07 16:59:36,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:59:36,374 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:59:36,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:59:36,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:59:36,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:59:36,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aafc9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36, skipping insertion in model container [2022-04-07 16:59:36,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:59:36,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:59:36,507 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-07 16:59:36,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:59:36,543 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:59:36,551 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-07 16:59:36,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:59:36,565 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:59:36,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36 WrapperNode [2022-04-07 16:59:36,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:59:36,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:59:36,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:59:36,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:59:36,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:59:36,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:59:36,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:59:36,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:59:36,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:59:36,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:59:36,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 16:59:36,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 16:59:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:59:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:59:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:59:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 16:59:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:59:36,658 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:59:36,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:59:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:59:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:59:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:59:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:59:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:59:36,709 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:59:36,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:59:36,835 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:59:36,840 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:59:36,840 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:59:36,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:59:36 BoogieIcfgContainer [2022-04-07 16:59:36,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:59:36,842 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:59:36,842 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:59:36,843 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:59:36,845 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:59:36" (1/1) ... [2022-04-07 16:59:36,860 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:59:36,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:59:36 BasicIcfg [2022-04-07 16:59:36,888 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:59:36,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:59:36,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:59:36,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:59:36,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:59:36" (1/4) ... [2022-04-07 16:59:36,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e97d3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:59:36, skipping insertion in model container [2022-04-07 16:59:36,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:59:36" (2/4) ... [2022-04-07 16:59:36,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e97d3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:59:36, skipping insertion in model container [2022-04-07 16:59:36,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:59:36" (3/4) ... [2022-04-07 16:59:36,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e97d3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:59:36, skipping insertion in model container [2022-04-07 16:59:36,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:59:36" (4/4) ... [2022-04-07 16:59:36,897 INFO L111 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.iJordan [2022-04-07 16:59:36,900 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:59:36,900 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:59:36,929 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:59:36,940 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 16:59:36,940 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:59:36,954 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-07 16:59:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 16:59:36,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:59:36,959 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:59:36,959 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:59:36,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:59:36,963 INFO L85 PathProgramCache]: Analyzing trace with hash -665154378, now seen corresponding path program 1 times [2022-04-07 16:59:36,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:59:36,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593028765] [2022-04-07 16:59:36,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:59:36,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:59:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:59:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:37,219 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-07 16:59:37,220 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-07 16:59:37,220 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-07 16:59:37,222 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-07 16:59:37,222 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-07 16:59:37,222 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-07 16:59:37,222 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-07 16:59:37,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 16:59:37,223 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-07 16:59:37,223 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-07 16:59:37,224 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-07 16:59:37,224 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-07 16:59:37,226 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-07 16:59:37,227 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-07 16:59:37,228 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-07 16:59:37,228 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-07 16:59:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:59:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:59:37,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593028765] [2022-04-07 16:59:37,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593028765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:59:37,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:59:37,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 16:59:37,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13450921] [2022-04-07 16:59:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:59:37,234 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-07 16:59:37,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:59:37,239 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-07 16:59:37,253 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-07 16:59:37,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 16:59:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:59:37,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 16:59:37,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:59:37,269 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-07 16:59:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:37,543 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-07 16:59:37,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 16:59:37,544 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-07 16:59:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:59:37,545 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-07 16:59:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-07 16:59:37,550 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-07 16:59:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-07 16:59:37,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-07 16:59:37,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:59:37,588 INFO L225 Difference]: With dead ends: 30 [2022-04-07 16:59:37,588 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 16:59:37,589 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-07 16:59:37,591 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-07 16:59:37,592 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-07 16:59:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 16:59:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-07 16:59:37,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:59:37,609 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-07 16:59:37,609 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-07 16:59:37,610 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-07 16:59:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:37,611 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-07 16:59:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-07 16:59:37,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:59:37,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:59:37,612 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-07 16:59:37,612 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-07 16:59:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:37,614 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-07 16:59:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-07 16:59:37,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:59:37,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:59:37,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:59:37,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:59:37,615 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-07 16:59:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-07 16:59:37,616 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2022-04-07 16:59:37,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:59:37,616 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-07 16:59:37,617 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-07 16:59:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-07 16:59:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 16:59:37,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:59:37,617 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:59:37,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:59:37,618 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:59:37,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:59:37,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1437979323, now seen corresponding path program 1 times [2022-04-07 16:59:37,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:59:37,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946328408] [2022-04-07 16:59:37,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:59:37,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:59:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:37,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:59:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:37,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#(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] {141#true} is VALID [2022-04-07 16:59:37,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#true} is VALID [2022-04-07 16:59:37,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#true} is VALID [2022-04-07 16:59:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-07 16:59:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:37,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#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] {141#true} is VALID [2022-04-07 16:59:37,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#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[] {141#true} is VALID [2022-04-07 16:59:37,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#true} is VALID [2022-04-07 16:59:37,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {147#(<= (+ 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] {147#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:37,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:59:37,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#(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] {141#true} is VALID [2022-04-07 16:59:37,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#true} is VALID [2022-04-07 16:59:37,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#true} is VALID [2022-04-07 16:59:37,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#true} is VALID [2022-04-07 16:59:37,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#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] {141#true} is VALID [2022-04-07 16:59:37,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#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[] {146#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:37,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#(<= 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] {147#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:37,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {147#(<= (+ 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[] {147#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:37,717 INFO L272 TraceCheckUtils]: 9: Hoare triple {147#(<= (+ 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] {141#true} is VALID [2022-04-07 16:59:37,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#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] {141#true} is VALID [2022-04-07 16:59:37,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#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[] {141#true} is VALID [2022-04-07 16:59:37,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {141#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#true} is VALID [2022-04-07 16:59:37,718 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {141#true} {147#(<= (+ 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] {147#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:37,719 INFO L272 TraceCheckUtils]: 14: Hoare triple {147#(<= (+ 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] {152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:59:37,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {152#(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] {153#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:59:37,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {153#(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[] {142#false} is VALID [2022-04-07 16:59:37,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {142#false} is VALID [2022-04-07 16:59:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:59:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:59:37,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946328408] [2022-04-07 16:59:37,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946328408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:59:37,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:59:37,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 16:59:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595524572] [2022-04-07 16:59:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:59:37,722 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-07 16:59:37,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:59:37,723 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-07 16:59:37,738 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-07 16:59:37,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 16:59:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:59:37,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 16:59:37,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 16:59:37,739 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-07 16:59:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:37,925 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-07 16:59:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 16:59:37,926 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-07 16:59:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:59:37,926 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-07 16:59:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-04-07 16:59:37,928 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-07 16:59:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-04-07 16:59:37,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2022-04-07 16:59:37,953 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-07 16:59:37,955 INFO L225 Difference]: With dead ends: 30 [2022-04-07 16:59:37,956 INFO L226 Difference]: Without dead ends: 30 [2022-04-07 16:59:37,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-07 16:59:37,961 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-07 16:59:37,961 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-07 16:59:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-07 16:59:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-07 16:59:37,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:59:37,968 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-07 16:59:37,968 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-07 16:59:37,969 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-07 16:59:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:37,974 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-07 16:59:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-07 16:59:37,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:59:37,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:59:37,977 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-07 16:59:37,978 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-07 16:59:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:37,981 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-07 16:59:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-07 16:59:37,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:59:37,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:59:37,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:59:37,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:59:37,982 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-07 16:59:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-07 16:59:37,986 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 18 [2022-04-07 16:59:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:59:37,987 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-07 16:59:37,988 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-07 16:59:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-07 16:59:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 16:59:37,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:59:37,989 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-07 16:59:37,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:59:37,989 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:59:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:59:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1407888200, now seen corresponding path program 1 times [2022-04-07 16:59:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:59:37,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265315677] [2022-04-07 16:59:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:59:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:59:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:38,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:59:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:38,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {308#(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] {286#true} is VALID [2022-04-07 16:59:38,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {286#true} {286#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-07 16:59:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:38,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {292#(<= (+ 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] {292#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-07 16:59:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:38,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {292#(<= (+ 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] {292#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-07 16:59:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:38,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {301#(<= 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] {301#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:59:38,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#(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] {286#true} is VALID [2022-04-07 16:59:38,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {286#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {286#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {286#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[] {291#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(<= 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] {292#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#(<= (+ 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[] {292#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,135 INFO L272 TraceCheckUtils]: 9: Hoare triple {292#(<= (+ 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] {286#true} is VALID [2022-04-07 16:59:38,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,136 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {286#true} {292#(<= (+ 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] {292#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,136 INFO L272 TraceCheckUtils]: 14: Hoare triple {292#(<= (+ 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] {286#true} is VALID [2022-04-07 16:59:38,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,140 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {286#true} {292#(<= (+ 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] {292#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {292#(<= (+ 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] {301#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {301#(<= 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[] {301#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,141 INFO L272 TraceCheckUtils]: 21: Hoare triple {301#(<= 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] {286#true} is VALID [2022-04-07 16:59:38,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,143 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {286#true} {301#(<= 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] {301#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,143 INFO L272 TraceCheckUtils]: 26: Hoare triple {301#(<= 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] {306#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:59:38,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {306#(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] {307#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:59:38,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {307#(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[] {287#false} is VALID [2022-04-07 16:59:38,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {287#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#false} is VALID [2022-04-07 16:59:38,145 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-07 16:59:38,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:59:38,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265315677] [2022-04-07 16:59:38,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265315677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:59:38,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219534058] [2022-04-07 16:59:38,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:59:38,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:59:38,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:59:38,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:59:38,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 16:59:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:38,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 16:59:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:38,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:59:38,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {286#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {286#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {286#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[] {291#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(<= 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] {333#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-07 16:59:38,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(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[] {333#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-07 16:59:38,611 INFO L272 TraceCheckUtils]: 9: Hoare triple {333#(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] {286#true} is VALID [2022-04-07 16:59:38,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,614 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {286#true} {333#(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] {333#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-07 16:59:38,614 INFO L272 TraceCheckUtils]: 14: Hoare triple {333#(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] {286#true} is VALID [2022-04-07 16:59:38,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,618 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {286#true} {333#(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] {333#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-07 16:59:38,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {333#(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] {370#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-07 16:59:38,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#(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[] {370#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-07 16:59:38,619 INFO L272 TraceCheckUtils]: 21: Hoare triple {370#(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] {286#true} is VALID [2022-04-07 16:59:38,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,621 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {286#true} {370#(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] {370#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-07 16:59:38,621 INFO L272 TraceCheckUtils]: 26: Hoare triple {370#(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] {392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:59:38,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {392#(<= 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] {396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:59:38,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {396#(<= 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[] {287#false} is VALID [2022-04-07 16:59:38,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {287#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#false} is VALID [2022-04-07 16:59:38,624 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-07 16:59:38,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:59:38,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {287#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#false} is VALID [2022-04-07 16:59:38,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {396#(<= 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[] {287#false} is VALID [2022-04-07 16:59:38,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {392#(<= 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] {396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:59:38,801 INFO L272 TraceCheckUtils]: 26: Hoare triple {301#(<= 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] {392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:59:38,809 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {286#true} {301#(<= 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] {301#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,810 INFO L272 TraceCheckUtils]: 21: Hoare triple {301#(<= 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] {286#true} is VALID [2022-04-07 16:59:38,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {301#(<= 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[] {301#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {292#(<= (+ 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] {301#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,811 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {286#true} {292#(<= (+ 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] {292#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,812 INFO L272 TraceCheckUtils]: 14: Hoare triple {292#(<= (+ 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] {286#true} is VALID [2022-04-07 16:59:38,812 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {286#true} {292#(<= (+ 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] {292#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {286#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {286#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[] {286#true} is VALID [2022-04-07 16:59:38,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,813 INFO L272 TraceCheckUtils]: 9: Hoare triple {292#(<= (+ 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] {286#true} is VALID [2022-04-07 16:59:38,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#(<= (+ 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[] {292#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(<= 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] {292#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {286#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[] {291#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:38,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {286#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {286#true} {286#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#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] {286#true} is VALID [2022-04-07 16:59:38,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#true} is VALID [2022-04-07 16:59:38,815 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-07 16:59:38,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219534058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:59:38,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:59:38,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-07 16:59:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871869968] [2022-04-07 16:59:38,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:59:38,819 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-07 16:59:38,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:59:38,820 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-07 16:59:38,847 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-07 16:59:38,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 16:59:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:59:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 16:59:38,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-07 16:59:38,852 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-07 16:59:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:39,209 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-07 16:59:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 16:59:39,210 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-07 16:59:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:59:39,210 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-07 16:59:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-07 16:59:39,212 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-07 16:59:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-07 16:59:39,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-07 16:59:39,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:59:39,239 INFO L225 Difference]: With dead ends: 38 [2022-04-07 16:59:39,239 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 16:59:39,239 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-07 16:59:39,240 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 16:59:39,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 57 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 16:59:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 16:59:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-07 16:59:39,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:59:39,243 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-07 16:59:39,243 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-07 16:59:39,243 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-07 16:59:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:39,245 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-07 16:59:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-07 16:59:39,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:59:39,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:59:39,246 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-07 16:59:39,246 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-07 16:59:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:39,247 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-07 16:59:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-07 16:59:39,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:59:39,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:59:39,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:59:39,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:59:39,248 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-07 16:59:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-07 16:59:39,249 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2022-04-07 16:59:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:59:39,249 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-07 16:59:39,250 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-07 16:59:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-07 16:59:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 16:59:39,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:59:39,251 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-07 16:59:39,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 16:59:39,467 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-07 16:59:39,468 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:59:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:59:39,468 INFO L85 PathProgramCache]: Analyzing trace with hash -699974453, now seen corresponding path program 2 times [2022-04-07 16:59:39,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:59:39,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292040986] [2022-04-07 16:59:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:59:39,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:59:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:59:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:39,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#(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] {656#true} is VALID [2022-04-07 16:59:39,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {656#true} {656#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-07 16:59:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:39,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-07 16:59:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:39,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-07 16:59:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:39,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-07 16:59:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:39,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-07 16:59:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:39,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {678#(<= 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] {678#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {656#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:59:39,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#(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] {656#true} is VALID [2022-04-07 16:59:39,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {656#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {661#(<= 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[] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,601 INFO L272 TraceCheckUtils]: 9: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:39,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,602 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,602 INFO L272 TraceCheckUtils]: 14: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:39,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,602 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {661#(<= 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[] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,603 INFO L272 TraceCheckUtils]: 21: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:39,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,604 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,604 INFO L272 TraceCheckUtils]: 26: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:39,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,605 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {661#(<= 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[] {678#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,605 INFO L272 TraceCheckUtils]: 33: Hoare triple {678#(<= 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] {656#true} is VALID [2022-04-07 16:59:39,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,609 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {656#true} {678#(<= 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] {678#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,610 INFO L272 TraceCheckUtils]: 38: Hoare triple {678#(<= 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] {683#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:59:39,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {683#(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] {684#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:59:39,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {684#(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[] {657#false} is VALID [2022-04-07 16:59:39,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {657#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-07 16:59:39,611 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-07 16:59:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:59:39,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292040986] [2022-04-07 16:59:39,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292040986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:59:39,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787368310] [2022-04-07 16:59:39,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 16:59:39,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:59:39,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:59:39,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:59:39,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 16:59:39,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 16:59:39,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:59:39,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 16:59:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:59:39,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:59:39,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {656#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {656#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {661#(<= 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[] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,868 INFO L272 TraceCheckUtils]: 9: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:39,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,869 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,869 INFO L272 TraceCheckUtils]: 14: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:39,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,870 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {661#(<= 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[] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,871 INFO L272 TraceCheckUtils]: 21: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:39,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,872 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,872 INFO L272 TraceCheckUtils]: 26: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:39,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,872 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {661#(<= 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[] {678#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,877 INFO L272 TraceCheckUtils]: 33: Hoare triple {678#(<= 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] {656#true} is VALID [2022-04-07 16:59:39,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:39,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:39,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:39,879 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {656#true} {678#(<= 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] {678#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:39,880 INFO L272 TraceCheckUtils]: 38: Hoare triple {678#(<= 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] {803#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:59:39,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {803#(<= 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] {807#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:59:39,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {807#(<= 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[] {657#false} is VALID [2022-04-07 16:59:39,880 INFO L290 TraceCheckUtils]: 41: Hoare triple {657#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-07 16:59:39,881 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-07 16:59:39,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:59:40,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {657#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {657#false} is VALID [2022-04-07 16:59:40,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {807#(<= 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[] {657#false} is VALID [2022-04-07 16:59:40,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {803#(<= 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] {807#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:59:40,080 INFO L272 TraceCheckUtils]: 38: Hoare triple {678#(<= 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] {803#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:59:40,080 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {656#true} {678#(<= 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] {678#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:40,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:40,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:40,081 INFO L272 TraceCheckUtils]: 33: Hoare triple {678#(<= 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] {656#true} is VALID [2022-04-07 16:59:40,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {661#(<= 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[] {678#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,082 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:40,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:40,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:40,083 INFO L272 TraceCheckUtils]: 26: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:40,085 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:40,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:40,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:40,085 INFO L272 TraceCheckUtils]: 21: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:40,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {661#(<= 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[] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,086 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:40,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:40,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:40,087 INFO L272 TraceCheckUtils]: 14: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:40,087 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {656#true} {661#(<= 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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#true} [86] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:40,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:40,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:40,087 INFO L272 TraceCheckUtils]: 9: Hoare triple {661#(<= 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] {656#true} is VALID [2022-04-07 16:59:40,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {661#(<= 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[] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#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] {661#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-07 16:59:40,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#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[] {656#true} is VALID [2022-04-07 16:59:40,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:40,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {656#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:40,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {656#true} {656#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:40,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {656#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:40,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#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] {656#true} is VALID [2022-04-07 16:59:40,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {656#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {656#true} is VALID [2022-04-07 16:59:40,090 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-07 16:59:40,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787368310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:59:40,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:59:40,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-07 16:59:40,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061844486] [2022-04-07 16:59:40,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:59:40,091 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-07 16:59:40,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:59:40,092 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-07 16:59:40,110 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-07 16:59:40,110 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 16:59:40,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:59:40,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 16:59:40,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-07 16:59:40,111 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-07 16:59:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:40,262 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-07 16:59:40,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 16:59:40,263 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-07 16:59:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:59:40,263 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-07 16:59:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-07 16:59:40,264 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-07 16:59:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-07 16:59:40,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2022-04-07 16:59:40,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:59:40,283 INFO L225 Difference]: With dead ends: 35 [2022-04-07 16:59:40,283 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 16:59:40,283 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-07 16:59:40,284 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 16:59:40,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 41 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 16:59:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 16:59:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 16:59:40,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:59:40,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:59:40,285 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:59:40,285 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:59:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:40,285 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 16:59:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:59:40,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:59:40,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:59:40,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 16:59:40,285 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 16:59:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:59:40,285 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 16:59:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:59:40,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:59:40,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:59:40,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:59:40,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:59:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:59:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 16:59:40,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-04-07 16:59:40,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:59:40,286 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 16:59:40,286 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-07 16:59:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:59:40,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:59:40,288 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 16:59:40,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 16:59:40,498 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-07 16:59:40,501 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-07 16:59:40,502 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 16:59:40,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:59:40 BasicIcfg [2022-04-07 16:59:40,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 16:59:40,504 INFO L158 Benchmark]: Toolchain (without parser) took 4129.48ms. Allocated memory was 176.2MB in the beginning and 223.3MB in the end (delta: 47.2MB). Free memory was 118.7MB in the beginning and 135.2MB in the end (delta: -16.6MB). Peak memory consumption was 30.2MB. Max. memory is 8.0GB. [2022-04-07 16:59:40,504 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 16:59:40,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.00ms. Allocated memory was 176.2MB in the beginning and 223.3MB in the end (delta: 47.2MB). Free memory was 118.4MB in the beginning and 195.1MB in the end (delta: -76.7MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-07 16:59:40,505 INFO L158 Benchmark]: Boogie Preprocessor took 33.55ms. Allocated memory is still 223.3MB. Free memory was 195.1MB in the beginning and 193.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 16:59:40,505 INFO L158 Benchmark]: RCFGBuilder took 241.33ms. Allocated memory is still 223.3MB. Free memory was 193.6MB in the beginning and 181.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 16:59:40,505 INFO L158 Benchmark]: IcfgTransformer took 46.08ms. Allocated memory is still 223.3MB. Free memory was 181.5MB in the beginning and 179.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 16:59:40,505 INFO L158 Benchmark]: TraceAbstraction took 3614.28ms. Allocated memory is still 223.3MB. Free memory was 179.4MB in the beginning and 135.2MB in the end (delta: 44.2MB). Peak memory consumption was 44.8MB. Max. memory is 8.0GB. [2022-04-07 16:59:40,506 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.00ms. Allocated memory was 176.2MB in the beginning and 223.3MB in the end (delta: 47.2MB). Free memory was 118.4MB in the beginning and 195.1MB in the end (delta: -76.7MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.55ms. Allocated memory is still 223.3MB. Free memory was 195.1MB in the beginning and 193.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 241.33ms. Allocated memory is still 223.3MB. Free memory was 193.6MB in the beginning and 181.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 46.08ms. Allocated memory is still 223.3MB. Free memory was 181.5MB in the beginning and 179.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3614.28ms. Allocated memory is still 223.3MB. Free memory was 179.4MB in the beginning and 135.2MB in the end (delta: 44.2MB). Peak memory consumption was 44.8MB. 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: 3.6s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 337 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 65 mSDtfsCounter, 337 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.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s 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 RESULT: Ultimate proved your program to be correct! [2022-04-07 16:59:40,531 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...