/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:21:10,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:21:10,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:21:10,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:21:10,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:21:10,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:21:10,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:21:10,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:21:10,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:21:10,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:21:10,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:21:10,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:21:10,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:21:10,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:21:10,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:21:10,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:21:10,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:21:10,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:21:10,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:21:10,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:21:10,921 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:21:10,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:21:10,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:21:10,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:21:10,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:21:10,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:21:10,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:21:10,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:21:10,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:21:10,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:21:10,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:21:10,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:21:10,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:21:10,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:21:10,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:21:10,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:21:10,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:21:10,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:21:10,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:21:10,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:21:10,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:21:10,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:21:10,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:21:10,953 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:21:10,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:21:10,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:21:10,954 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:21:10,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:21:10,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:21:10,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:21:10,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:21:10,955 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:21:10,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:21:10,956 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:21:10,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:21:10,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:21:10,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:21:10,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:21:10,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:21:10,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:21:10,957 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:21:10,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:21:10,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:21:10,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:21:10,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:21:10,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:21:10,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:21:10,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:21:10,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:21:10,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:21:10,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:21:10,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:21:10,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:21:10,960 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:21:10,960 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:21:10,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:21:10,960 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:21:11,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:21:11,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:21:11,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:21:11,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:21:11,211 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:21:11,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2022-04-27 10:21:11,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43282f391/9cd5d267f25b49509785f98c26a8ba7e/FLAG4ae36ff52 [2022-04-27 10:21:11,621 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:21:11,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2022-04-27 10:21:11,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43282f391/9cd5d267f25b49509785f98c26a8ba7e/FLAG4ae36ff52 [2022-04-27 10:21:11,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43282f391/9cd5d267f25b49509785f98c26a8ba7e [2022-04-27 10:21:11,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:21:11,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:21:11,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:21:11,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:21:11,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:21:11,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:21:11" (1/1) ... [2022-04-27 10:21:11,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19746a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11, skipping insertion in model container [2022-04-27 10:21:11,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:21:11" (1/1) ... [2022-04-27 10:21:11,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:21:11,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:21:11,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i[825,838] [2022-04-27 10:21:11,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:21:11,829 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:21:11,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i[825,838] [2022-04-27 10:21:11,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:21:11,852 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:21:11,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11 WrapperNode [2022-04-27 10:21:11,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:21:11,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:21:11,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:21:11,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:21:11,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11" (1/1) ... [2022-04-27 10:21:11,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11" (1/1) ... [2022-04-27 10:21:11,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11" (1/1) ... [2022-04-27 10:21:11,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11" (1/1) ... [2022-04-27 10:21:11,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11" (1/1) ... [2022-04-27 10:21:11,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11" (1/1) ... [2022-04-27 10:21:11,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11" (1/1) ... [2022-04-27 10:21:11,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:21:11,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:21:11,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:21:11,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:21:11,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11" (1/1) ... [2022-04-27 10:21:11,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:21:11,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:11,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:21:11,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:21:11,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:21:11,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:21:11,964 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:21:11,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:21:11,966 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2022-04-27 10:21:11,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:21:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:21:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:21:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:21:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:21:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:21:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:21:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:21:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2022-04-27 10:21:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:21:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:21:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:21:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:21:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:21:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:21:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:21:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:21:12,026 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:21:12,028 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:21:12,137 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:21:12,143 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:21:12,143 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:21:12,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:12 BoogieIcfgContainer [2022-04-27 10:21:12,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:21:12,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:21:12,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:21:12,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:21:12,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:21:11" (1/3) ... [2022-04-27 10:21:12,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8dc0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:21:12, skipping insertion in model container [2022-04-27 10:21:12,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:11" (2/3) ... [2022-04-27 10:21:12,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8dc0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:21:12, skipping insertion in model container [2022-04-27 10:21:12,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:12" (3/3) ... [2022-04-27 10:21:12,151 INFO L111 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc_loop.i [2022-04-27 10:21:12,180 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:21:12,181 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:21:12,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:21:12,237 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@441b7330, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d8220c9 [2022-04-27 10:21:12,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:21:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:21:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:21:12,250 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:12,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:12,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash 49640583, now seen corresponding path program 1 times [2022-04-27 10:21:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:12,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666179893] [2022-04-27 10:21:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:12,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {29#true} is VALID [2022-04-27 10:21:12,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 10:21:12,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #50#return; {29#true} is VALID [2022-04-27 10:21:12,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:12,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {29#true} is VALID [2022-04-27 10:21:12,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 10:21:12,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #50#return; {29#true} is VALID [2022-04-27 10:21:12,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret3 := main(); {29#true} is VALID [2022-04-27 10:21:12,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-27 10:21:12,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-27 10:21:12,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:12,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:12,630 INFO L272 TraceCheckUtils]: 9: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {37#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:21:12,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:21:12,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {30#false} is VALID [2022-04-27 10:21:12,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-27 10:21:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:21:12,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:12,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666179893] [2022-04-27 10:21:12,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666179893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:12,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:21:12,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:21:12,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443111957] [2022-04-27 10:21:12,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:12,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:21:12,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:12,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:12,660 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-27 10:21:12,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:21:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:12,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:21:12,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:21:12,688 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:13,205 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-27 10:21:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:21:13,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:21:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-27 10:21:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-27 10:21:13,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-27 10:21:13,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:13,312 INFO L225 Difference]: With dead ends: 55 [2022-04-27 10:21:13,312 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 10:21:13,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:21:13,320 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:13,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 57 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:21:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 10:21:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-27 10:21:13,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:13,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:13,356 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:13,357 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:13,361 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-27 10:21:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-27 10:21:13,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:13,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:13,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 10:21:13,363 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 10:21:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:13,367 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-27 10:21:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-27 10:21:13,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:13,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:13,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:13,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-27 10:21:13,380 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2022-04-27 10:21:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:13,381 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-27 10:21:13,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:21:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-27 10:21:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:21:13,382 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:13,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:13,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:21:13,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:13,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1781648093, now seen corresponding path program 1 times [2022-04-27 10:21:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:13,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085404696] [2022-04-27 10:21:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:13,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {210#true} is VALID [2022-04-27 10:21:13,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-27 10:21:13,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #50#return; {210#true} is VALID [2022-04-27 10:21:13,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-27 10:21:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:13,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-04-27 10:21:13,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-04-27 10:21:13,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-27 10:21:13,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:13,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {225#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:13,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {210#true} is VALID [2022-04-27 10:21:13,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-27 10:21:13,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #50#return; {210#true} is VALID [2022-04-27 10:21:13,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret3 := main(); {210#true} is VALID [2022-04-27 10:21:13,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-27 10:21:13,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-27 10:21:13,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:13,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:13,558 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {210#true} is VALID [2022-04-27 10:21:13,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-04-27 10:21:13,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-04-27 10:21:13,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-27 10:21:13,559 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:13,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:13,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:13,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:13,562 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:21:13,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:21:13,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {211#false} is VALID [2022-04-27 10:21:13,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-04-27 10:21:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:21:13,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:13,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085404696] [2022-04-27 10:21:13,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085404696] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:13,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868798022] [2022-04-27 10:21:13,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:13,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:13,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:13,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:13,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:21:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:13,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 10:21:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:13,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:14,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2022-04-27 10:21:14,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {210#true} is VALID [2022-04-27 10:21:14,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-27 10:21:14,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #50#return; {210#true} is VALID [2022-04-27 10:21:14,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret3 := main(); {210#true} is VALID [2022-04-27 10:21:14,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-27 10:21:14,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-27 10:21:14,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:14,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:14,069 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {210#true} is VALID [2022-04-27 10:21:14,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-04-27 10:21:14,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-04-27 10:21:14,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-27 10:21:14,072 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:14,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:14,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:14,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:14,074 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {280#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:21:14,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {280#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {284#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:21:14,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {211#false} is VALID [2022-04-27 10:21:14,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-04-27 10:21:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:21:14,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:14,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-04-27 10:21:14,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {211#false} is VALID [2022-04-27 10:21:14,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {280#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {284#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:21:14,498 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {280#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:21:14,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:14,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:14,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:14,500 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:14,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-27 10:21:14,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2022-04-27 10:21:14,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2022-04-27 10:21:14,501 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {210#true} is VALID [2022-04-27 10:21:14,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:14,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:14,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-27 10:21:14,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-27 10:21:14,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret3 := main(); {210#true} is VALID [2022-04-27 10:21:14,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #50#return; {210#true} is VALID [2022-04-27 10:21:14,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2022-04-27 10:21:14,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {210#true} is VALID [2022-04-27 10:21:14,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2022-04-27 10:21:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:21:14,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868798022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:21:14,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:21:14,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-27 10:21:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543441507] [2022-04-27 10:21:14,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:21:14,513 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 10:21:14,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:14,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:21:14,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:14,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 10:21:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:14,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 10:21:14,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:21:14,541 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:21:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:14,960 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-27 10:21:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:21:14,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 10:21:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:21:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-27 10:21:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:21:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-27 10:21:14,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-27 10:21:15,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:15,017 INFO L225 Difference]: With dead ends: 36 [2022-04-27 10:21:15,017 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 10:21:15,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:21:15,018 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:15,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 40 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:21:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 10:21:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-27 10:21:15,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:15,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:21:15,042 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:21:15,043 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:21:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:15,049 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-27 10:21:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 10:21:15,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:15,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:15,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 10:21:15,051 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 10:21:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:15,057 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-27 10:21:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 10:21:15,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:15,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:15,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:15,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:21:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-27 10:21:15,059 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2022-04-27 10:21:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:15,059 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-27 10:21:15,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:21:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-27 10:21:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:21:15,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:15,060 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:15,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:15,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:15,285 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:15,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1581946061, now seen corresponding path program 2 times [2022-04-27 10:21:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:15,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397051723] [2022-04-27 10:21:15,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:15,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {532#true} is VALID [2022-04-27 10:21:15,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:15,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {532#true} {532#true} #50#return; {532#true} is VALID [2022-04-27 10:21:15,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-27 10:21:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:15,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-27 10:21:15,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-27 10:21:15,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:15,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 10:21:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:15,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-27 10:21:15,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-27 10:21:15,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:15,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} call ULTIMATE.init(); {551#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:15,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {532#true} is VALID [2022-04-27 10:21:15,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:15,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} #50#return; {532#true} is VALID [2022-04-27 10:21:15,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} call #t~ret3 := main(); {532#true} is VALID [2022-04-27 10:21:15,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {537#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {537#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {538#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,461 INFO L272 TraceCheckUtils]: 9: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {532#true} is VALID [2022-04-27 10:21:15,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-27 10:21:15,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-27 10:21:15,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:15,462 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {532#true} {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,464 INFO L272 TraceCheckUtils]: 17: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {532#true} is VALID [2022-04-27 10:21:15,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-27 10:21:15,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-27 10:21:15,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:15,466 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {532#true} {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-27 10:21:15,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,469 INFO L272 TraceCheckUtils]: 25: Hoare triple {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {549#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:21:15,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {549#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {550#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:21:15,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {550#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {533#false} is VALID [2022-04-27 10:21:15,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {533#false} assume !false; {533#false} is VALID [2022-04-27 10:21:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:21:15,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:15,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397051723] [2022-04-27 10:21:15,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397051723] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:15,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258251759] [2022-04-27 10:21:15,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:21:15,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:15,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:15,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:15,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:21:15,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 10:21:15,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:21:15,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 10:21:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:15,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:15,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} call ULTIMATE.init(); {532#true} is VALID [2022-04-27 10:21:15,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {532#true} is VALID [2022-04-27 10:21:15,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:15,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} #50#return; {532#true} is VALID [2022-04-27 10:21:15,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} call #t~ret3 := main(); {532#true} is VALID [2022-04-27 10:21:15,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {570#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2022-04-27 10:21:15,831 INFO L272 TraceCheckUtils]: 6: Hoare triple {570#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {574#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {574#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,832 INFO L272 TraceCheckUtils]: 9: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {532#true} is VALID [2022-04-27 10:21:15,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-27 10:21:15,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-27 10:21:15,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:15,833 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {532#true} {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #46#return; {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,835 INFO L272 TraceCheckUtils]: 17: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {532#true} is VALID [2022-04-27 10:21:15,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-27 10:21:15,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-27 10:21:15,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:15,843 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {532#true} {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #46#return; {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:15,846 INFO L272 TraceCheckUtils]: 25: Hoare triple {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {633#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:21:15,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {633#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {637#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:21:15,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {637#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {533#false} is VALID [2022-04-27 10:21:15,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {533#false} assume !false; {533#false} is VALID [2022-04-27 10:21:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:21:15,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:16,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {533#false} assume !false; {533#false} is VALID [2022-04-27 10:21:16,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {637#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {533#false} is VALID [2022-04-27 10:21:16,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {633#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {637#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:21:16,218 INFO L272 TraceCheckUtils]: 25: Hoare triple {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {633#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:21:16,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,221 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {532#true} {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #46#return; {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:16,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-27 10:21:16,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-27 10:21:16,222 INFO L272 TraceCheckUtils]: 17: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {532#true} is VALID [2022-04-27 10:21:16,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,224 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {532#true} {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #46#return; {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:16,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#true} assume !(0 == ~cond); {532#true} is VALID [2022-04-27 10:21:16,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {532#true} ~cond := #in~cond; {532#true} is VALID [2022-04-27 10:21:16,225 INFO L272 TraceCheckUtils]: 9: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {532#true} is VALID [2022-04-27 10:21:16,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {574#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,228 INFO L272 TraceCheckUtils]: 6: Hoare triple {570#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {574#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-27 10:21:16,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {570#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2022-04-27 10:21:16,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} call #t~ret3 := main(); {532#true} is VALID [2022-04-27 10:21:16,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} #50#return; {532#true} is VALID [2022-04-27 10:21:16,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} assume true; {532#true} is VALID [2022-04-27 10:21:16,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {532#true} is VALID [2022-04-27 10:21:16,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} call ULTIMATE.init(); {532#true} is VALID [2022-04-27 10:21:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 10:21:16,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258251759] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:21:16,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:21:16,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-04-27 10:21:16,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847711675] [2022-04-27 10:21:16,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:21:16,231 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-27 10:21:16,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:16,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:16,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:16,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:21:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:16,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:21:16,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:21:16,267 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:16,635 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-27 10:21:16,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:21:16,636 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-27 10:21:16,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2022-04-27 10:21:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2022-04-27 10:21:16,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 18 transitions. [2022-04-27 10:21:16,657 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-27 10:21:16,658 INFO L225 Difference]: With dead ends: 32 [2022-04-27 10:21:16,658 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:21:16,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:21:16,659 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:16,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 59 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:21:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:21:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:21:16,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:16,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:21:16,661 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:21:16,661 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:21:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:16,661 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:21:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:21:16,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:16,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:16,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:21:16,661 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:21:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:16,662 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:21:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:21:16,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:16,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:16,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:16,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:21:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:21:16,662 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-27 10:21:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:16,662 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:21:16,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:21:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:21:16,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:16,665 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:21:16,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:16,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 10:21:16,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:21:17,030 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:21:17,030 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:21:17,030 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:21:17,030 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= ~tmp~0.base |glob2_#in~pathlim.base|)) (not (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))) [2022-04-27 10:21:17,030 INFO L902 garLoopResultBuilder]: At program point glob2ENTRY(lines 25 36) the Hoare annotation is: true [2022-04-27 10:21:17,031 INFO L899 garLoopResultBuilder]: For program point L31-1(line 31) no Hoare annotation was computed. [2022-04-27 10:21:17,031 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 33) no Hoare annotation was computed. [2022-04-27 10:21:17,031 INFO L895 garLoopResultBuilder]: At program point L29-3(lines 29 33) the Hoare annotation is: (or (and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= ~tmp~0.base |glob2_#in~pathlim.base|)) (not (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))) [2022-04-27 10:21:17,031 INFO L899 garLoopResultBuilder]: For program point L29-4(lines 29 33) no Hoare annotation was computed. [2022-04-27 10:21:17,031 INFO L899 garLoopResultBuilder]: For program point glob2EXIT(lines 25 36) no Hoare annotation was computed. [2022-04-27 10:21:17,031 INFO L899 garLoopResultBuilder]: For program point glob2FINAL(lines 25 36) no Hoare annotation was computed. [2022-04-27 10:21:17,031 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base)) [2022-04-27 10:21:17,031 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 38 49) the Hoare annotation is: (and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base)) [2022-04-27 10:21:17,031 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2022-04-27 10:21:17,031 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 38 49) no Hoare annotation was computed. [2022-04-27 10:21:17,032 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 38 49) no Hoare annotation was computed. [2022-04-27 10:21:17,032 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:21:17,032 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:21:17,032 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:21:17,032 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:21:17,032 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:21:17,032 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:21:17,032 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:21:17,032 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 10:21:17,032 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 10:21:17,032 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-27 10:21:17,032 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-04-27 10:21:17,033 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-04-27 10:21:17,033 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 10:21:17,035 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-27 10:21:17,037 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:21:17,040 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:21:17,040 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:21:17,040 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:21:17,042 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:21:17,042 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:21:17,042 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:21:17,042 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-27 10:21:17,042 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-27 10:21:17,044 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:21:17,044 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 10:21:17,044 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:21:17,044 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:21:17,044 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:21:17,044 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-27 10:21:17,044 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-27 10:21:17,044 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: glob2FINAL has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: glob2EXIT has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-27 10:21:17,045 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:21:17,045 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:21:17,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:21:17 BoogieIcfgContainer [2022-04-27 10:21:17,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:21:17,053 INFO L158 Benchmark]: Toolchain (without parser) took 5415.70ms. Allocated memory was 174.1MB in the beginning and 216.0MB in the end (delta: 41.9MB). Free memory was 126.0MB in the beginning and 110.4MB in the end (delta: 15.6MB). Peak memory consumption was 57.9MB. Max. memory is 8.0GB. [2022-04-27 10:21:17,054 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 142.6MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:21:17,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.43ms. Allocated memory is still 174.1MB. Free memory was 125.8MB in the beginning and 151.7MB in the end (delta: -25.9MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-27 10:21:17,054 INFO L158 Benchmark]: Boogie Preprocessor took 32.50ms. Allocated memory is still 174.1MB. Free memory was 151.7MB in the beginning and 149.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:21:17,055 INFO L158 Benchmark]: RCFGBuilder took 257.73ms. Allocated memory is still 174.1MB. Free memory was 149.6MB in the beginning and 138.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 10:21:17,055 INFO L158 Benchmark]: TraceAbstraction took 4906.78ms. Allocated memory was 174.1MB in the beginning and 216.0MB in the end (delta: 41.9MB). Free memory was 137.6MB in the beginning and 110.4MB in the end (delta: 27.2MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. [2022-04-27 10:21:17,056 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.30ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 142.6MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.43ms. Allocated memory is still 174.1MB. Free memory was 125.8MB in the beginning and 151.7MB in the end (delta: -25.9MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.50ms. Allocated memory is still 174.1MB. Free memory was 151.7MB in the beginning and 149.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 257.73ms. Allocated memory is still 174.1MB. Free memory was 149.6MB in the beginning and 138.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4906.78ms. Allocated memory was 174.1MB in the beginning and 216.0MB in the end (delta: 41.9MB). Free memory was 137.6MB in the beginning and 110.4MB in the end (delta: 27.2MB). Peak memory consumption was 69.9MB. 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: 16]: 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 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 36 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12 PreInvPairs, 17 NumberOfFragments, 100 HoareAnnotationTreeSize, 12 FomulaSimplifications, 7 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 146 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 113 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 654 SizeOfPredicates, 16 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 48/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((pathlim == tmp && pathlim <= tmp) && tmp == p) || !(tmp == pathbuf)) || !(tmp == pathlim)) || !(pathbuf + 4 <= tmp)) || !(pathlim <= tmp) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:21:17,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...