/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:44:52,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:44:52,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:44:52,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:44:52,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:44:52,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:44:52,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:44:52,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:44:52,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:44:52,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:44:52,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:44:52,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:44:52,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:44:52,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:44:52,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:44:52,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:44:52,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:44:52,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:44:52,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:44:52,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:44:52,496 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:44:52,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:44:52,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:44:52,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:44:52,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:44:52,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:44:52,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:44:52,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:44:52,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:44:52,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:44:52,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:44:52,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:44:52,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:44:52,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:44:52,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:44:52,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:44:52,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:44:52,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:44:52,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:44:52,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:44:52,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:44:52,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:44:52,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:44:52,521 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:44:52,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:44:52,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:44:52,523 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:44:52,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:44:52,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:44:52,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:44:52,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:44:52,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:44:52,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:44:52,524 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:44:52,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:44:52,524 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:44:52,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:44:52,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:44:52,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:44:52,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:44:52,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:44:52,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:44:52,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:44:52,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:44:52,525 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:44:52,525 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:44:52,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:44:52,525 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:44:52,526 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:44:52,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:44:52,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:44:52,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:44:52,719 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:44:52,725 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:44:52,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i [2022-04-15 05:44:52,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff07aeeef/e3739af24e0342bc80fd88f43ddc1847/FLAGdfb0f5994 [2022-04-15 05:44:53,143 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:44:53,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i [2022-04-15 05:44:53,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff07aeeef/e3739af24e0342bc80fd88f43ddc1847/FLAGdfb0f5994 [2022-04-15 05:44:53,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff07aeeef/e3739af24e0342bc80fd88f43ddc1847 [2022-04-15 05:44:53,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:44:53,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:44:53,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:44:53,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:44:53,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:44:53,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:44:53" (1/1) ... [2022-04-15 05:44:53,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5144b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53, skipping insertion in model container [2022-04-15 05:44:53,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:44:53" (1/1) ... [2022-04-15 05:44:53,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:44:53,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:44:53,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i[825,838] [2022-04-15 05:44:53,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:44:53,773 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:44:53,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_NetBSD-libc_loop.i[825,838] [2022-04-15 05:44:53,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:44:53,792 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:44:53,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53 WrapperNode [2022-04-15 05:44:53,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:44:53,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:44:53,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:44:53,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:44:53,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53" (1/1) ... [2022-04-15 05:44:53,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53" (1/1) ... [2022-04-15 05:44:53,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53" (1/1) ... [2022-04-15 05:44:53,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53" (1/1) ... [2022-04-15 05:44:53,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53" (1/1) ... [2022-04-15 05:44:53,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53" (1/1) ... [2022-04-15 05:44:53,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53" (1/1) ... [2022-04-15 05:44:53,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:44:53,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:44:53,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:44:53,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:44:53,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53" (1/1) ... [2022-04-15 05:44:53,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:44:53,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:44:53,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:44:53,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:44:53,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:44:53,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:44:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:44:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:44:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2022-04-15 05:44:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:44:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:44:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:44:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:44:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:44:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:44:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:44:53,918 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:44:53,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:44:54,017 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:44:54,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:44:54,022 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:44:54,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:44:54 BoogieIcfgContainer [2022-04-15 05:44:54,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:44:54,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:44:54,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:44:54,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:44:54,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:44:53" (1/3) ... [2022-04-15 05:44:54,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1e22d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:44:54, skipping insertion in model container [2022-04-15 05:44:54,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:53" (2/3) ... [2022-04-15 05:44:54,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1e22d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:44:54, skipping insertion in model container [2022-04-15 05:44:54,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:44:54" (3/3) ... [2022-04-15 05:44:54,028 INFO L111 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc_loop.i [2022-04-15 05:44:54,031 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:44:54,031 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:44:54,104 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:44:54,108 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:44:54,108 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:44:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 05:44:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 05:44:54,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:44:54,134 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:44:54,134 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:44:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:44:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash 49640583, now seen corresponding path program 1 times [2022-04-15 05:44:54,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:54,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797793540] [2022-04-15 05:44:54,157 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:44:54,157 INFO L85 PathProgramCache]: Analyzing trace with hash 49640583, now seen corresponding path program 2 times [2022-04-15 05:44:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:44:54,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706786636] [2022-04-15 05:44:54,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:44:54,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:44:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:44:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:54,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {29#true} is VALID [2022-04-15 05:44:54,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 05:44:54,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #50#return; {29#true} is VALID [2022-04-15 05:44:54,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:44:54,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {29#true} is VALID [2022-04-15 05:44:54,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 05:44:54,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #50#return; {29#true} is VALID [2022-04-15 05:44:54,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret3 := main(); {29#true} is VALID [2022-04-15 05:44:54,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-15 05:44:54,506 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 05:44:54,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 05:44:54,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 05:44:54,509 INFO L272 TraceCheckUtils]: 9: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {37#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:44:54,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:44:54,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {30#false} is VALID [2022-04-15 05:44:54,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 05:44:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:44:54,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:44:54,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706786636] [2022-04-15 05:44:54,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706786636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:54,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:54,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:44:54,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:44:54,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797793540] [2022-04-15 05:44:54,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797793540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:54,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:54,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:44:54,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703683488] [2022-04-15 05:44:54,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:44:54,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 05:44:54,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:44:54,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:44:54,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:54,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:44:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:54,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:44:54,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:44:54,553 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:44:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:54,977 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-15 05:44:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:44:54,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 05:44:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:44:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:44:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 05:44:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:44:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 05:44:54,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-15 05:44:55,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:55,058 INFO L225 Difference]: With dead ends: 55 [2022-04-15 05:44:55,058 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 05:44:55,060 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:44:55,064 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:44:55,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 57 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:44:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 05:44:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-15 05:44:55,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:44:55,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:55,105 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:55,106 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:55,119 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 05:44:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 05:44:55,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:55,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:55,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 05:44:55,120 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 05:44:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:55,121 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 05:44:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 05:44:55,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:55,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:55,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:44:55,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:44:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 05:44:55,124 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2022-04-15 05:44:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:44:55,124 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 05:44:55,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:44:55,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 05:44:55,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 05:44:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:44:55,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:44:55,148 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:44:55,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:44:55,149 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:44:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:44:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1781648093, now seen corresponding path program 1 times [2022-04-15 05:44:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:55,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1203248677] [2022-04-15 05:44:55,309 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:44:55,309 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:44:55,309 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:44:55,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1781648093, now seen corresponding path program 2 times [2022-04-15 05:44:55,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:44:55,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390799833] [2022-04-15 05:44:55,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:44:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:44:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:55,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:44:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:55,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-15 05:44:55,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 05:44:55,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-15 05:44:55,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 05:44:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:55,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-15 05:44:55,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-15 05:44:55,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 05:44:55,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 05:44:55,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {277#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:44:55,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-15 05:44:55,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 05:44:55,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-15 05:44:55,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2022-04-15 05:44:55,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {267#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {267#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {268#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 05:44:55,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 05:44:55,471 INFO L272 TraceCheckUtils]: 9: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {262#true} is VALID [2022-04-15 05:44:55,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-15 05:44:55,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-15 05:44:55,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 05:44:55,472 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {262#true} {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 05:44:55,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 05:44:55,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,474 INFO L272 TraceCheckUtils]: 17: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {275#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:44:55,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {276#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:44:55,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {276#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-15 05:44:55,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-15 05:44:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:44:55,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:44:55,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390799833] [2022-04-15 05:44:55,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390799833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:44:55,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458929013] [2022-04-15 05:44:55,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:44:55,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:44:55,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:44:55,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:44:55,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:44:55,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:44:55,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:44:55,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 05:44:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:55,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:44:55,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2022-04-15 05:44:55,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-15 05:44:55,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 05:44:55,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-15 05:44:55,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2022-04-15 05:44:55,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {296#(and (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2022-04-15 05:44:55,818 INFO L272 TraceCheckUtils]: 6: Hoare triple {296#(and (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,819 INFO L272 TraceCheckUtils]: 9: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {262#true} is VALID [2022-04-15 05:44:55,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-15 05:44:55,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-15 05:44:55,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 05:44:55,821 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {262#true} {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} #46#return; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {329#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {329#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 05:44:55,823 INFO L272 TraceCheckUtils]: 17: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {336#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:44:55,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {336#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {340#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:44:55,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {340#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {263#false} is VALID [2022-04-15 05:44:55,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-15 05:44:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:44:55,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:44:56,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-15 05:44:56,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {340#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {263#false} is VALID [2022-04-15 05:44:56,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {336#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {340#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:44:56,123 INFO L272 TraceCheckUtils]: 17: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {336#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:44:56,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {329#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 05:44:56,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {329#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 05:44:56,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} is VALID [2022-04-15 05:44:56,125 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {262#true} {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} #46#return; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} is VALID [2022-04-15 05:44:56,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 05:44:56,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-15 05:44:56,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-15 05:44:56,126 INFO L272 TraceCheckUtils]: 9: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {262#true} is VALID [2022-04-15 05:44:56,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} is VALID [2022-04-15 05:44:56,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset))} is VALID [2022-04-15 05:44:56,127 INFO L272 TraceCheckUtils]: 6: Hoare triple {296#(and (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 05:44:56,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 32 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {296#(and (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2022-04-15 05:44:56,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2022-04-15 05:44:56,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-15 05:44:56,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 05:44:56,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-15 05:44:56,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2022-04-15 05:44:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:44:56,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458929013] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:44:56,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:44:56,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-04-15 05:44:56,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:44:56,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1203248677] [2022-04-15 05:44:56,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1203248677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:56,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:56,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:44:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893612792] [2022-04-15 05:44:56,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:44:56,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 05:44:56,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:44:56,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:56,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:56,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:44:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:56,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:44:56,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-04-15 05:44:56,152 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:56,446 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 05:44:56,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:44:56,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 05:44:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:44:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-15 05:44:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-15 05:44:56,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-15 05:44:56,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:56,479 INFO L225 Difference]: With dead ends: 36 [2022-04-15 05:44:56,479 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 05:44:56,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:44:56,480 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:44:56,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:44:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 05:44:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 05:44:56,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:44:56,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 05:44:56,495 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 05:44:56,495 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 05:44:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:56,497 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 05:44:56,497 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 05:44:56,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:56,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:56,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 05:44:56,498 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 05:44:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:56,499 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 05:44:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 05:44:56,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:56,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:56,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:44:56,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:44:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 05:44:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 05:44:56,501 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2022-04-15 05:44:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:44:56,501 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 05:44:56,501 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:56,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-15 05:44:56,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 05:44:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:44:56,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:44:56,533 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:44:56,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 05:44:56,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:44:56,747 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:44:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:44:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1581946061, now seen corresponding path program 3 times [2022-04-15 05:44:56,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:56,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1962451034] [2022-04-15 05:44:56,796 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:44:56,796 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:44:56,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:44:56,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1581946061, now seen corresponding path program 4 times [2022-04-15 05:44:56,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:44:56,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114098243] [2022-04-15 05:44:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:44:56,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:44:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:44:56,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:44:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:44:56,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:44:56,842 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 05:44:56,842 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 05:44:56,844 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:44:56,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:44:56,847 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-15 05:44:56,849 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: glob2ENTRY has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 05:44:56,856 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: glob2FINAL has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: glob2EXIT has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-15 05:44:56,857 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 05:44:56,857 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 05:44:56,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:44:56 BoogieIcfgContainer [2022-04-15 05:44:56,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:44:56,859 INFO L158 Benchmark]: Toolchain (without parser) took 3256.33ms. Allocated memory is still 178.3MB. Free memory was 127.2MB in the beginning and 68.7MB in the end (delta: 58.5MB). Peak memory consumption was 59.6MB. Max. memory is 8.0GB. [2022-04-15 05:44:56,859 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory was 144.1MB in the beginning and 144.0MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:44:56,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.83ms. Allocated memory is still 178.3MB. Free memory was 127.0MB in the beginning and 154.6MB in the end (delta: -27.7MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-15 05:44:56,860 INFO L158 Benchmark]: Boogie Preprocessor took 19.76ms. Allocated memory is still 178.3MB. Free memory was 154.6MB in the beginning and 152.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:44:56,860 INFO L158 Benchmark]: RCFGBuilder took 209.41ms. Allocated memory is still 178.3MB. Free memory was 152.8MB in the beginning and 141.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 05:44:56,860 INFO L158 Benchmark]: TraceAbstraction took 2834.01ms. Allocated memory is still 178.3MB. Free memory was 141.3MB in the beginning and 68.7MB in the end (delta: 72.6MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. [2022-04-15 05:44:56,861 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.11ms. Allocated memory is still 178.3MB. Free memory was 144.1MB in the beginning and 144.0MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.83ms. Allocated memory is still 178.3MB. Free memory was 127.0MB in the beginning and 154.6MB in the end (delta: -27.7MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.76ms. Allocated memory is still 178.3MB. Free memory was 154.6MB in the beginning and 152.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 209.41ms. Allocated memory is still 178.3MB. Free memory was 152.8MB in the beginning and 141.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2834.01ms. Allocated memory is still 178.3MB. Free memory was 141.3MB in the beginning and 68.7MB in the end (delta: 72.6MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] Char *tmp; [L40] Char pathbuf[1 +1]; [L42] Char *bound = pathbuf + sizeof(pathbuf) - 1; [L44] tmp = pathbuf + sizeof(pathbuf)/sizeof(*pathbuf) - 1 [L46] CALL glob2 (pathbuf, bound) [L27] Char *p; [L29] p = pathbuf [L29] COND TRUE p <= pathlim [L31] CALL __VERIFIER_assert(p<=tmp) [L15] COND FALSE !(!(cond)) [L31] RET __VERIFIER_assert(p<=tmp) [L32] *p = 1 [L29] p++ [L29] COND TRUE p <= pathlim [L31] CALL __VERIFIER_assert(p<=tmp) [L15] COND FALSE !(!(cond)) [L31] RET __VERIFIER_assert(p<=tmp) [L32] *p = 1 [L29] p++ [L29] COND TRUE p <= pathlim [L31] CALL __VERIFIER_assert(p<=tmp) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 187 IncrementalHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 27 mSDtfsCounter, 187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-15 05:44:56,897 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...