/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/loop-invgen/NetBSD_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:44:40,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:44:40,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:44:40,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:44:40,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:44:40,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:44:40,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:44:40,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:44:40,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:44:40,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:44:40,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:44:40,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:44:40,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:44:40,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:44:40,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:44:40,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:44:40,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:44:40,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:44:40,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:44:40,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:44:40,293 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:44:40,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:44:40,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:44:40,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:44:40,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:44:40,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:44:40,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:44:40,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:44:40,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:44:40,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:44:40,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:44:40,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:44:40,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:44:40,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:44:40,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:44:40,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:44:40,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:44:40,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:44:40,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:44:40,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:44:40,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:44:40,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:44:40,316 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:44:40,346 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:44:40,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:44:40,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:44:40,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:44:40,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:44:40,348 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:44:40,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:44:40,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:44:40,348 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:44:40,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:44:40,349 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:44:40,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:44:40,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:44:40,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:44:40,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:44:40,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:44:40,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:44:40,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:44:40,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:44:40,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:44:40,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:44:40,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:44:40,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:44:40,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:44:40,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:44:40,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:44:40,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:44:40,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:44:40,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:44:40,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:44:40,353 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:44:40,354 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:44:40,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:44:40,354 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:44:40,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:44:40,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:44:40,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:44:40,562 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:44:40,562 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:44:40,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2022-04-27 10:44:40,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21318dc3e/7be4eb26b7d24a0697aa7bda5233c74b/FLAGe3f5f252b [2022-04-27 10:44:40,979 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:44:40,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2022-04-27 10:44:40,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21318dc3e/7be4eb26b7d24a0697aa7bda5233c74b/FLAGe3f5f252b [2022-04-27 10:44:41,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21318dc3e/7be4eb26b7d24a0697aa7bda5233c74b [2022-04-27 10:44:41,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:44:41,410 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:44:41,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:44:41,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:44:41,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:44:41,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:44:41" (1/1) ... [2022-04-27 10:44:41,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8ccaf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41, skipping insertion in model container [2022-04-27 10:44:41,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:44:41" (1/1) ... [2022-04-27 10:44:41,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:44:41,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:44:41,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i[893,906] [2022-04-27 10:44:41,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:44:41,598 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:44:41,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i[893,906] [2022-04-27 10:44:41,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:44:41,622 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:44:41,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41 WrapperNode [2022-04-27 10:44:41,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:44:41,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:44:41,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:44:41,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:44:41,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41" (1/1) ... [2022-04-27 10:44:41,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41" (1/1) ... [2022-04-27 10:44:41,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41" (1/1) ... [2022-04-27 10:44:41,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41" (1/1) ... [2022-04-27 10:44:41,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41" (1/1) ... [2022-04-27 10:44:41,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41" (1/1) ... [2022-04-27 10:44:41,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41" (1/1) ... [2022-04-27 10:44:41,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:44:41,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:44:41,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:44:41,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:44:41,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41" (1/1) ... [2022-04-27 10:44:41,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:44:41,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:41,683 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:44:41,684 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:44:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:44:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:44:41,716 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:44:41,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:44:41,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:44:41,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:44:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:44:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:44:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:44:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:44:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:44:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:44:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:44:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:44:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:44:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:44:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:44:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:44:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:44:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:44:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:44:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:44:41,769 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:44:41,770 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:44:41,955 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:44:41,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:44:41,961 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:44:41,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:44:41 BoogieIcfgContainer [2022-04-27 10:44:41,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:44:41,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:44:41,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:44:41,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:44:41,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:44:41" (1/3) ... [2022-04-27 10:44:41,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b2aa2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:44:41, skipping insertion in model container [2022-04-27 10:44:41,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:41" (2/3) ... [2022-04-27 10:44:41,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b2aa2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:44:41, skipping insertion in model container [2022-04-27 10:44:41,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:44:41" (3/3) ... [2022-04-27 10:44:41,989 INFO L111 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.i [2022-04-27 10:44:42,001 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:44:42,002 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:44:42,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:44:42,072 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@a50116, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25099bac [2022-04-27 10:44:42,073 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:44:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:44:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:44:42,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:42,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:42,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -390730657, now seen corresponding path program 1 times [2022-04-27 10:44:42,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:42,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506910570] [2022-04-27 10:44:42,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:42,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:42,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |#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(9, 2); {26#true} is VALID [2022-04-27 10:44:42,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 10:44:42,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-27 10:44:42,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:42,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |#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(9, 2); {26#true} is VALID [2022-04-27 10:44:42,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 10:44:42,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-27 10:44:42,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret3 := main(); {26#true} is VALID [2022-04-27 10:44:42,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {26#true} is VALID [2022-04-27 10:44:42,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {26#true} is VALID [2022-04-27 10:44:42,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {31#(<= 0 main_~glob2_p_off~0)} is VALID [2022-04-27 10:44:42,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(<= 0 main_~glob2_p_off~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {31#(<= 0 main_~glob2_p_off~0)} is VALID [2022-04-27 10:44:42,374 INFO L272 TraceCheckUtils]: 9: Hoare triple {31#(<= 0 main_~glob2_p_off~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:44:42,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:44:42,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27#false} is VALID [2022-04-27 10:44:42,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 10:44:42,379 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:44:42,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:42,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506910570] [2022-04-27 10:44:42,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506910570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:42,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:42,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:44:42,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287685715] [2022-04-27 10:44:42,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:42,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:44:42,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:42,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:44:42,409 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:44:42,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:44:42,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:42,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:44:42,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:44:42,437 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:44:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:42,783 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-27 10:44:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:44:42,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:44:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:44:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-27 10:44:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:44:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-27 10:44:42,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-27 10:44:42,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:42,869 INFO L225 Difference]: With dead ends: 45 [2022-04-27 10:44:42,870 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:44:42,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:44:42,874 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:42,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:44:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:44:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 10:44:42,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:42,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:42,909 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:42,910 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:42,912 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:44:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:44:42,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:42,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:42,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-27 10:44:42,914 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-27 10:44:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:42,916 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:44:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:44:42,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:42,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:42,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:42,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:44:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-27 10:44:42,920 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2022-04-27 10:44:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:42,920 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-27 10:44:42,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:44:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:44:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:44:42,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:42,921 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:42,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:44:42,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:42,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1367367025, now seen corresponding path program 1 times [2022-04-27 10:44:42,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:42,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575377025] [2022-04-27 10:44:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:43,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#(and (= |#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(9, 2); {181#true} is VALID [2022-04-27 10:44:43,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} assume true; {181#true} is VALID [2022-04-27 10:44:43,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} #61#return; {181#true} is VALID [2022-04-27 10:44:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-27 10:44:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:43,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#true} ~cond := #in~cond; {181#true} is VALID [2022-04-27 10:44:43,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} assume !(0 == ~cond); {181#true} is VALID [2022-04-27 10:44:43,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} assume true; {181#true} is VALID [2022-04-27 10:44:43,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:43,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#(and (= |#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(9, 2); {181#true} is VALID [2022-04-27 10:44:43,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} assume true; {181#true} is VALID [2022-04-27 10:44:43,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} #61#return; {181#true} is VALID [2022-04-27 10:44:43,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} call #t~ret3 := main(); {181#true} is VALID [2022-04-27 10:44:43,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {181#true} is VALID [2022-04-27 10:44:43,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {186#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,026 INFO L272 TraceCheckUtils]: 9: Hoare triple {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {181#true} is VALID [2022-04-27 10:44:43,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {181#true} ~cond := #in~cond; {181#true} is VALID [2022-04-27 10:44:43,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {181#true} assume !(0 == ~cond); {181#true} is VALID [2022-04-27 10:44:43,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#true} assume true; {181#true} is VALID [2022-04-27 10:44:43,028 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {181#true} {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,028 INFO L272 TraceCheckUtils]: 14: Hoare triple {187#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {192#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:44:43,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {192#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {193#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:44:43,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {182#false} is VALID [2022-04-27 10:44:43,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-04-27 10:44:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:44:43,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:43,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575377025] [2022-04-27 10:44:43,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575377025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:43,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:43,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:44:43,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288983802] [2022-04-27 10:44:43,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:43,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 10:44:43,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:43,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:44:43,060 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:44:43,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:44:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:43,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:44:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:44:43,062 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:44:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:43,368 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-27 10:44:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:44:43,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 10:44:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:44:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-27 10:44:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:44:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-27 10:44:43,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-27 10:44:43,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:43,413 INFO L225 Difference]: With dead ends: 32 [2022-04-27 10:44:43,413 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 10:44:43,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:44:43,414 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:43,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 37 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:44:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 10:44:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-27 10:44:43,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:43,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:44:43,430 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:44:43,430 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:44:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:43,433 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-27 10:44:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-27 10:44:43,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:43,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:43,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 10:44:43,434 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 10:44:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:43,437 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-27 10:44:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-27 10:44:43,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:43,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:43,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:43,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:44:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-27 10:44:43,440 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 18 [2022-04-27 10:44:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:43,440 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-27 10:44:43,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:44:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-27 10:44:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 10:44:43,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:43,441 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:43,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:44:43,442 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1382920975, now seen corresponding path program 1 times [2022-04-27 10:44:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:43,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288812725] [2022-04-27 10:44:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:43,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:43,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {376#(and (= |#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(9, 2); {354#true} is VALID [2022-04-27 10:44:43,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:43,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {354#true} {354#true} #61#return; {354#true} is VALID [2022-04-27 10:44:43,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-27 10:44:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:43,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:43,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:43,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:43,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 10:44:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:43,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:43,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:43,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:43,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #59#return; {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 10:44:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:43,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:43,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:43,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:43,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {354#true} call ULTIMATE.init(); {376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:43,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#(and (= |#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(9, 2); {354#true} is VALID [2022-04-27 10:44:43,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:43,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} #61#return; {354#true} is VALID [2022-04-27 10:44:43,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {354#true} call #t~ret3 := main(); {354#true} is VALID [2022-04-27 10:44:43,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {354#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {354#true} is VALID [2022-04-27 10:44:43,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {359#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,594 INFO L272 TraceCheckUtils]: 9: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {354#true} is VALID [2022-04-27 10:44:43,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:43,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:43,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:43,595 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,595 INFO L272 TraceCheckUtils]: 14: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {354#true} is VALID [2022-04-27 10:44:43,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:43,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:43,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:43,596 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #59#return; {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,597 INFO L272 TraceCheckUtils]: 21: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {354#true} is VALID [2022-04-27 10:44:43,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:43,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:43,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:43,598 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {354#true} {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:43,599 INFO L272 TraceCheckUtils]: 26: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {374#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:44:43,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {374#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {375#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:44:43,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {375#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {355#false} is VALID [2022-04-27 10:44:43,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {355#false} assume !false; {355#false} is VALID [2022-04-27 10:44:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:44:43,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:43,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288812725] [2022-04-27 10:44:43,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288812725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:44:43,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077637242] [2022-04-27 10:44:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:43,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:43,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:43,603 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:44:43,606 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:44:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:43,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:44:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:43,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:44:44,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {354#true} call ULTIMATE.init(); {354#true} is VALID [2022-04-27 10:44:44,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#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(9, 2); {354#true} is VALID [2022-04-27 10:44:44,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:44,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} #61#return; {354#true} is VALID [2022-04-27 10:44:44,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {354#true} call #t~ret3 := main(); {354#true} is VALID [2022-04-27 10:44:44,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {354#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {354#true} is VALID [2022-04-27 10:44:44,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {359#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:44,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-27 10:44:44,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-27 10:44:44,084 INFO L272 TraceCheckUtils]: 9: Hoare triple {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {354#true} is VALID [2022-04-27 10:44:44,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:44,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:44,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:44,085 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {354#true} {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #57#return; {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-27 10:44:44,086 INFO L272 TraceCheckUtils]: 14: Hoare triple {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {354#true} is VALID [2022-04-27 10:44:44,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:44,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:44,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:44,087 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {354#true} {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #59#return; {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-27 10:44:44,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {401#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-27 10:44:44,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-27 10:44:44,088 INFO L272 TraceCheckUtils]: 21: Hoare triple {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {354#true} is VALID [2022-04-27 10:44:44,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:44,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:44,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:44,089 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {354#true} {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} #57#return; {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-27 10:44:44,090 INFO L272 TraceCheckUtils]: 26: Hoare triple {438#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {460#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:44:44,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {460#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {464#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:44:44,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {464#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {355#false} is VALID [2022-04-27 10:44:44,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {355#false} assume !false; {355#false} is VALID [2022-04-27 10:44:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:44:44,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:44:44,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {355#false} assume !false; {355#false} is VALID [2022-04-27 10:44:44,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {464#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {355#false} is VALID [2022-04-27 10:44:44,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {460#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {464#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:44:44,296 INFO L272 TraceCheckUtils]: 26: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {460#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:44:44,303 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {354#true} {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:44,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:44,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:44,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:44,304 INFO L272 TraceCheckUtils]: 21: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {354#true} is VALID [2022-04-27 10:44:44,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:44,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {369#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:44,306 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #59#return; {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:44,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:44,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:44,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:44,306 INFO L272 TraceCheckUtils]: 14: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {354#true} is VALID [2022-04-27 10:44:44,307 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {354#true} {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:44,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:44,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#true} assume !(0 == ~cond); {354#true} is VALID [2022-04-27 10:44:44,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#true} ~cond := #in~cond; {354#true} is VALID [2022-04-27 10:44:44,307 INFO L272 TraceCheckUtils]: 9: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {354#true} is VALID [2022-04-27 10:44:44,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:44,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {360#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:44,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {359#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:44,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {354#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {354#true} is VALID [2022-04-27 10:44:44,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {354#true} call #t~ret3 := main(); {354#true} is VALID [2022-04-27 10:44:44,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} #61#return; {354#true} is VALID [2022-04-27 10:44:44,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2022-04-27 10:44:44,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#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(9, 2); {354#true} is VALID [2022-04-27 10:44:44,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {354#true} call ULTIMATE.init(); {354#true} is VALID [2022-04-27 10:44:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:44:44,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077637242] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:44:44,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:44:44,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 10:44:44,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342727172] [2022-04-27 10:44:44,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:44:44,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 30 [2022-04-27 10:44:44,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:44,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 10:44:44,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:44,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:44:44,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:44,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:44:44,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:44:44,350 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 10:44:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:44,746 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-27 10:44:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:44:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 30 [2022-04-27 10:44:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 10:44:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-27 10:44:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 10:44:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-27 10:44:44,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-27 10:44:44,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:44,795 INFO L225 Difference]: With dead ends: 40 [2022-04-27 10:44:44,796 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 10:44:44,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:44:44,797 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:44,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 47 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:44:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 10:44:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-27 10:44:44,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:44,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:44:44,836 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:44:44,836 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:44:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:44,838 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-27 10:44:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-27 10:44:44,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:44,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:44,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-27 10:44:44,839 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-27 10:44:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:44,841 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-27 10:44:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-27 10:44:44,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:44,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:44,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:44,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 10:44:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-27 10:44:44,844 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2022-04-27 10:44:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:44,844 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-27 10:44:44,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 10:44:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 10:44:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 10:44:44,845 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:44,845 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:44,886 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:44:45,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:45,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:44:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -213449841, now seen corresponding path program 2 times [2022-04-27 10:44:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:45,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520360605] [2022-04-27 10:44:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:45,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:45,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(and (= |#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(9, 2); {760#true} is VALID [2022-04-27 10:44:45,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {760#true} {760#true} #61#return; {760#true} is VALID [2022-04-27 10:44:45,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-27 10:44:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:45,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 10:44:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:45,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 10:44:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:45,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 10:44:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:45,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 10:44:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:45,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:44:45,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#(and (= |#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(9, 2); {760#true} is VALID [2022-04-27 10:44:45,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #61#return; {760#true} is VALID [2022-04-27 10:44:45,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret3 := main(); {760#true} is VALID [2022-04-27 10:44:45,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {760#true} is VALID [2022-04-27 10:44:45,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {760#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {760#true} is VALID [2022-04-27 10:44:45,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,194 INFO L272 TraceCheckUtils]: 9: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,195 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,195 INFO L272 TraceCheckUtils]: 14: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,196 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,197 INFO L272 TraceCheckUtils]: 21: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,198 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,198 INFO L272 TraceCheckUtils]: 26: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,199 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,200 INFO L272 TraceCheckUtils]: 33: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,201 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {760#true} {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,202 INFO L272 TraceCheckUtils]: 38: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:44:45,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {787#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {788#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:44:45,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {788#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {761#false} is VALID [2022-04-27 10:44:45,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-04-27 10:44:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-27 10:44:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:45,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520360605] [2022-04-27 10:44:45,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520360605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:44:45,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066468405] [2022-04-27 10:44:45,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:44:45,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:44:45,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:45,205 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:44:45,211 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:44:45,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:44:45,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:44:45,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:44:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:45,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:44:45,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2022-04-27 10:44:45,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#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(9, 2); {760#true} is VALID [2022-04-27 10:44:45,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #61#return; {760#true} is VALID [2022-04-27 10:44:45,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret3 := main(); {760#true} is VALID [2022-04-27 10:44:45,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {760#true} is VALID [2022-04-27 10:44:45,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {760#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {760#true} is VALID [2022-04-27 10:44:45,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,526 INFO L272 TraceCheckUtils]: 9: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,527 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,527 INFO L272 TraceCheckUtils]: 14: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,530 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,530 INFO L272 TraceCheckUtils]: 21: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,531 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,532 INFO L272 TraceCheckUtils]: 26: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,532 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,533 INFO L272 TraceCheckUtils]: 33: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,545 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {760#true} {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,548 INFO L272 TraceCheckUtils]: 38: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {907#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:44:45,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {907#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {911#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:44:45,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {911#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {761#false} is VALID [2022-04-27 10:44:45,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-04-27 10:44:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-27 10:44:45,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:44:45,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-04-27 10:44:45,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {911#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {761#false} is VALID [2022-04-27 10:44:45,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {907#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {911#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:44:45,765 INFO L272 TraceCheckUtils]: 38: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {907#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:44:45,766 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {760#true} {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,766 INFO L272 TraceCheckUtils]: 33: Hoare triple {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {782#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,767 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,768 INFO L272 TraceCheckUtils]: 26: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,768 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,769 INFO L272 TraceCheckUtils]: 21: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,770 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,770 INFO L272 TraceCheckUtils]: 14: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,770 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {760#true} {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-27 10:44:45,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-27 10:44:45,771 INFO L272 TraceCheckUtils]: 9: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {760#true} is VALID [2022-04-27 10:44:45,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {765#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-27 10:44:45,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {760#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {760#true} is VALID [2022-04-27 10:44:45,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {760#true} is VALID [2022-04-27 10:44:45,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret3 := main(); {760#true} is VALID [2022-04-27 10:44:45,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #61#return; {760#true} is VALID [2022-04-27 10:44:45,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-27 10:44:45,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#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(9, 2); {760#true} is VALID [2022-04-27 10:44:45,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2022-04-27 10:44:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-27 10:44:45,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066468405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:44:45,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:44:45,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-27 10:44:45,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392021331] [2022-04-27 10:44:45,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:44:45,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2022-04-27 10:44:45,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:45,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:44:45,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:45,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 10:44:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 10:44:45,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:44:45,797 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:44:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:45,981 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 10:44:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:44:45,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2022-04-27 10:44:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:44:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-27 10:44:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:44:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-27 10:44:45,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-27 10:44:46,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:44:46,008 INFO L225 Difference]: With dead ends: 37 [2022-04-27 10:44:46,008 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:44:46,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:44:46,010 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:46,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 36 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:44:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:44:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:44:46,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:46,011 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:44:46,011 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:44:46,011 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:44:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:46,011 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:44:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:44:46,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:46,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:46,011 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:44:46,012 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:44:46,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:46,012 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:44:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:44:46,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:46,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:46,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:46,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:46,012 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:44:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:44:46,012 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-04-27 10:44:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:46,012 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:44:46,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 10:44:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:44:46,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:46,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:44:46,040 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:44:46,231 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,SelfDestructingSolverStorable3 [2022-04-27 10:44:46,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:44:46,328 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:44:46,328 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:44:46,328 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:44:46,328 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-27 10:44:46,328 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:44:46,328 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:44:46,328 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-27 10:44:46,329 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-27 10:44:46,329 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-04-27 10:44:46,329 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 45) the Hoare annotation is: true [2022-04-27 10:44:46,329 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 45) no Hoare annotation was computed. [2022-04-27 10:44:46,329 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 45) no Hoare annotation was computed. [2022-04-27 10:44:46,329 INFO L902 garLoopResultBuilder]: At program point L44(lines 25 45) the Hoare annotation is: true [2022-04-27 10:44:46,329 INFO L899 garLoopResultBuilder]: For program point L42(lines 38 43) no Hoare annotation was computed. [2022-04-27 10:44:46,329 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2022-04-27 10:44:46,329 INFO L895 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2022-04-27 10:44:46,329 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 43) the Hoare annotation is: (and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2022-04-27 10:44:46,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:44:46,330 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:44:46,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:44:46,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:44:46,330 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:44:46,330 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:44:46,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:44:46,330 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:44:46,330 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 10:44:46,330 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 10:44:46,330 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 10:44:46,330 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 10:44:46,331 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 10:44:46,333 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 10:44:46,335 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:44:46,337 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:44:46,337 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:44:46,337 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:44:46,339 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:44:46,339 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:44:46,339 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 10:44:46,340 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:44:46,342 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:44:46,342 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:44:46,342 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:44:46,343 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:44:46,343 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 10:44:46,343 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 10:44:46,343 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:44:46,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:44:46 BoogieIcfgContainer [2022-04-27 10:44:46,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:44:46,353 INFO L158 Benchmark]: Toolchain (without parser) took 4940.11ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 131.3MB in the beginning and 150.6MB in the end (delta: -19.3MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. [2022-04-27 10:44:46,353 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 187.7MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:44:46,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.60ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 131.1MB in the beginning and 227.2MB in the end (delta: -96.2MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-27 10:44:46,354 INFO L158 Benchmark]: Boogie Preprocessor took 24.19ms. Allocated memory is still 256.9MB. Free memory was 227.2MB in the beginning and 225.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:44:46,354 INFO L158 Benchmark]: RCFGBuilder took 313.64ms. Allocated memory is still 256.9MB. Free memory was 225.7MB in the beginning and 214.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 10:44:46,354 INFO L158 Benchmark]: TraceAbstraction took 4386.25ms. Allocated memory is still 256.9MB. Free memory was 213.6MB in the beginning and 150.6MB in the end (delta: 63.0MB). Peak memory consumption was 64.1MB. Max. memory is 8.0GB. [2022-04-27 10:44:46,355 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.37ms. Allocated memory is still 187.7MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.60ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 131.1MB in the beginning and 227.2MB in the end (delta: -96.2MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.19ms. Allocated memory is still 256.9MB. Free memory was 227.2MB in the beginning and 225.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.64ms. Allocated memory is still 256.9MB. Free memory was 225.7MB in the beginning and 214.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4386.25ms. Allocated memory is still 256.9MB. Free memory was 213.6MB in the beginning and 150.6MB in the end (delta: 63.0MB). Peak memory consumption was 64.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 65 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 163 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=3, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 16 PreInvPairs, 27 NumberOfFragments, 48 HoareAnnotationTreeSize, 16 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 102 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 479 SizeOfPredicates, 9 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 224/245 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (1 <= MAXPATHLEN && glob2_pathlim_off <= MAXPATHLEN) && 0 <= glob2_p_off - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:44:46,388 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...