/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/loop-invgen/NetBSD_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:09:00,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:09:00,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:09:00,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:09:00,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:09:00,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:09:00,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:09:00,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:09:00,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:09:00,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:09:00,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:09:00,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:09:00,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:09:00,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:09:00,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:09:00,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:09:00,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:09:00,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:09:00,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:09:00,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:09:00,208 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:09:00,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:09:00,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:09:00,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:09:00,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:09:00,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:09:00,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:09:00,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:09:00,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:09:00,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:09:00,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:09:00,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:09:00,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:09:00,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:09:00,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:09:00,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:09:00,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:09:00,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:09:00,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:09:00,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:09:00,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:09:00,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:09:00,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:09:00,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:09:00,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:09:00,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:09:00,245 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:09:00,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:09:00,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:09:00,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:09:00,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:09:00,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:09:00,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:09:00,247 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:09:00,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:09:00,247 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:09:00,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:09:00,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:09:00,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:09:00,248 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:09:00,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:09:00,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:09:00,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:09:00,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:09:00,248 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:09:00,248 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:09:00,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:09:00,249 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:09:00,249 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-28 03:09:00,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:09:00,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:09:00,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:09:00,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:09:00,480 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:09:00,481 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-28 03:09:00,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d72312ae/41c6fdd0581845119a34dca1a6ba03ab/FLAG191c7f2d3 [2022-04-28 03:09:00,854 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:09:00,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2022-04-28 03:09:00,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d72312ae/41c6fdd0581845119a34dca1a6ba03ab/FLAG191c7f2d3 [2022-04-28 03:09:01,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d72312ae/41c6fdd0581845119a34dca1a6ba03ab [2022-04-28 03:09:01,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:09:01,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:09:01,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:09:01,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:09:01,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:09:01,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:09:01" (1/1) ... [2022-04-28 03:09:01,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f026e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01, skipping insertion in model container [2022-04-28 03:09:01,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:09:01" (1/1) ... [2022-04-28 03:09:01,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:09:01,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:09:01,459 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-28 03:09:01,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:09:01,478 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:09:01,498 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-28 03:09:01,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:09:01,514 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:09:01,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01 WrapperNode [2022-04-28 03:09:01,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:09:01,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:09:01,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:09:01,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:09:01,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01" (1/1) ... [2022-04-28 03:09:01,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01" (1/1) ... [2022-04-28 03:09:01,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01" (1/1) ... [2022-04-28 03:09:01,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01" (1/1) ... [2022-04-28 03:09:01,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01" (1/1) ... [2022-04-28 03:09:01,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01" (1/1) ... [2022-04-28 03:09:01,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01" (1/1) ... [2022-04-28 03:09:01,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:09:01,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:09:01,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:09:01,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:09:01,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01" (1/1) ... [2022-04-28 03:09:01,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:09:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:01,580 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-28 03:09:01,587 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-28 03:09:01,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:09:01,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:09:01,607 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:09:01,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:09:01,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:09:01,607 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:09:01,607 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:09:01,607 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:09:01,607 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:09:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:09:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:09:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:09:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:09:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:09:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:09:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:09:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:09:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:09:01,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:09:01,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:09:01,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:09:01,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:09:01,671 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:09:01,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:09:01,796 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:09:01,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:09:01,803 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:09:01,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:09:01 BoogieIcfgContainer [2022-04-28 03:09:01,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:09:01,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:09:01,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:09:01,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:09:01,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:09:01" (1/3) ... [2022-04-28 03:09:01,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e974bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:09:01, skipping insertion in model container [2022-04-28 03:09:01,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:01" (2/3) ... [2022-04-28 03:09:01,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e974bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:09:01, skipping insertion in model container [2022-04-28 03:09:01,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:09:01" (3/3) ... [2022-04-28 03:09:01,811 INFO L111 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.i [2022-04-28 03:09:01,824 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:09:01,824 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:09:01,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:09:01,868 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6646b486, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2693730a [2022-04-28 03:09:01,868 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:09:01,876 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-28 03:09:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:09:01,890 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:01,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:01,891 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash -390730657, now seen corresponding path program 1 times [2022-04-28 03:09:01,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:01,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193968399] [2022-04-28 03:09:01,931 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:01,931 INFO L85 PathProgramCache]: Analyzing trace with hash -390730657, now seen corresponding path program 2 times [2022-04-28 03:09:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:01,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058051546] [2022-04-28 03:09:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:02,239 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-28 03:09:02,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 03:09:02,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-28 03:09:02,241 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-28 03:09:02,242 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-28 03:09:02,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 03:09:02,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-28 03:09:02,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret3 := main(); {26#true} is VALID [2022-04-28 03:09:02,243 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-28 03:09:02,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {26#true} is VALID [2022-04-28 03:09:02,245 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-28 03:09:02,245 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-28 03:09:02,247 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-28 03:09:02,249 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-28 03:09:02,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27#false} is VALID [2022-04-28 03:09:02,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 03:09:02,252 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-28 03:09:02,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:02,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058051546] [2022-04-28 03:09:02,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058051546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:02,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:02,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:02,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193968399] [2022-04-28 03:09:02,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193968399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:02,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:02,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:02,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752745471] [2022-04-28 03:09:02,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:02,262 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-28 03:09:02,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:02,271 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-28 03:09:02,301 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-28 03:09:02,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:02,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:02,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:02,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:02,323 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-28 03:09:02,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:02,666 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-28 03:09:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:02,667 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-28 03:09:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:02,669 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-28 03:09:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-28 03:09:02,686 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-28 03:09:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-28 03:09:02,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-28 03:09:02,748 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-28 03:09:02,755 INFO L225 Difference]: With dead ends: 45 [2022-04-28 03:09:02,755 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 03:09:02,758 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-28 03:09:02,761 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-28 03:09:02,762 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-28 03:09:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 03:09:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 03:09:02,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:02,801 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-28 03:09:02,801 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-28 03:09:02,802 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-28 03:09:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:02,812 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:09:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:09:02,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:02,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:02,813 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-28 03:09:02,814 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-28 03:09:02,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:02,816 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:09:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:09:02,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:02,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:02,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:02,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:02,819 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-28 03:09:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 03:09:02,825 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2022-04-28 03:09:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:02,829 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 03:09:02,836 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-28 03:09:02,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 03:09:02,859 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-28 03:09:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:09:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:09:02,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:02,861 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:02,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:09:02,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:02,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1367367025, now seen corresponding path program 1 times [2022-04-28 03:09:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:02,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [110936239] [2022-04-28 03:09:02,871 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1367367025, now seen corresponding path program 2 times [2022-04-28 03:09:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:02,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86856688] [2022-04-28 03:09:02,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:02,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:02,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(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); {223#true} is VALID [2022-04-28 03:09:02,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-28 03:09:02,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {223#true} {223#true} #61#return; {223#true} is VALID [2022-04-28 03:09:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 03:09:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:02,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {223#true} ~cond := #in~cond; {223#true} is VALID [2022-04-28 03:09:02,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} assume !(0 == ~cond); {223#true} is VALID [2022-04-28 03:09:02,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-28 03:09:02,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 03:09:02,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {223#true} call ULTIMATE.init(); {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:02,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(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); {223#true} is VALID [2022-04-28 03:09:02,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-28 03:09:02,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {223#true} #61#return; {223#true} is VALID [2022-04-28 03:09:02,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} call #t~ret3 := main(); {223#true} is VALID [2022-04-28 03:09:02,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {223#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; {223#true} is VALID [2022-04-28 03:09:02,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {228#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-28 03:09:02,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {228#(<= 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; {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 03:09:02,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 03:09:02,978 INFO L272 TraceCheckUtils]: 9: Hoare triple {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {223#true} is VALID [2022-04-28 03:09:02,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {223#true} ~cond := #in~cond; {223#true} is VALID [2022-04-28 03:09:02,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#true} assume !(0 == ~cond); {223#true} is VALID [2022-04-28 03:09:02,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-28 03:09:02,980 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {223#true} {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 03:09:02,981 INFO L272 TraceCheckUtils]: 14: Hoare triple {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:09:02,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {234#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {235#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:09:02,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {224#false} is VALID [2022-04-28 03:09:02,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {224#false} assume !false; {224#false} is VALID [2022-04-28 03:09:02,982 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-28 03:09:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:02,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86856688] [2022-04-28 03:09:02,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86856688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:02,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:02,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:02,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:02,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [110936239] [2022-04-28 03:09:02,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [110936239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:02,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:02,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:02,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638784100] [2022-04-28 03:09:02,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:02,986 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-28 03:09:02,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:02,986 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-28 03:09:03,002 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-28 03:09:03,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:09:03,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:09:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:03,004 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-28 03:09:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:03,292 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 03:09:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:09:03,293 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-28 03:09:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:03,294 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-28 03:09:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 03:09:03,302 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-28 03:09:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 03:09:03,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-28 03:09:03,355 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-28 03:09:03,356 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:09:03,357 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:09:03,357 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-28 03:09:03,358 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-28 03:09:03,359 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-28 03:09:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:09:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 03:09:03,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:03,387 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-28 03:09:03,387 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-28 03:09:03,388 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-28 03:09:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:03,391 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 03:09:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 03:09:03,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:03,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:03,392 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-28 03:09:03,392 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-28 03:09:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:03,396 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 03:09:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 03:09:03,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:03,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:03,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:03,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:03,398 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-28 03:09:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-28 03:09:03,408 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 18 [2022-04-28 03:09:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:03,409 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-28 03:09:03,409 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-28 03:09:03,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-28 03:09:03,461 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-28 03:09:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 03:09:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:09:03,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:03,462 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-28 03:09:03,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:09:03,462 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:03,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1382920975, now seen corresponding path program 1 times [2022-04-28 03:09:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:03,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1742848887] [2022-04-28 03:09:07,907 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:09:08,182 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:09:08,185 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:09:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash -777149182, now seen corresponding path program 1 times [2022-04-28 03:09:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:08,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917242722] [2022-04-28 03:09:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:08,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:08,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#(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); {431#true} is VALID [2022-04-28 03:09:08,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 03:09:08,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {431#true} {431#true} #61#return; {431#true} is VALID [2022-04-28 03:09:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-28 03:09:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:08,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 03:09:08,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 03:09:08,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 03:09:08,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {431#true} {437#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {437#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 03:09:08,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {431#true} call ULTIMATE.init(); {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:08,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#(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); {431#true} is VALID [2022-04-28 03:09:08,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 03:09:08,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {431#true} {431#true} #61#return; {431#true} is VALID [2022-04-28 03:09:08,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {431#true} call #t~ret3 := main(); {431#true} is VALID [2022-04-28 03:09:08,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {431#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; {431#true} is VALID [2022-04-28 03:09:08,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {431#true} is VALID [2022-04-28 03:09:08,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {431#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; {436#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 03:09:08,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [65] L38-2-->L41_primed: Formula: (let ((.cse1 (= v_main_~glob2_p_off~0_16 v_main_~glob2_p_off~0_15)) (.cse2 (= |v_main_#t~post2_4| |v_main_#t~post2_3|)) (.cse0 (<= 0 v_main_~glob2_p_off~0_16))) (or (and (or (not .cse0) (not (< v_main_~glob2_p_off~0_16 (+ v_main_~MAXPATHLEN~0_11 1))) (not (<= v_main_~glob2_p_off~0_16 v_main_~glob2_pathlim_off~0_5))) .cse1 .cse2) (and (= v_main_~glob2_pathlim_off~0_5 v_main_~glob2_pathlim_off~0_5) .cse1 (= v_main_~MAXPATHLEN~0_11 v_main_~MAXPATHLEN~0_11) .cse2) (and (< v_main_~glob2_p_off~0_16 v_main_~glob2_p_off~0_15) (< v_main_~glob2_p_off~0_15 (+ 2 v_main_~MAXPATHLEN~0_11)) .cse0 (<= v_main_~glob2_p_off~0_15 (+ v_main_~glob2_pathlim_off~0_5 1))))) InVars {main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_5, main_#t~post2=|v_main_#t~post2_4|, main_~glob2_p_off~0=v_main_~glob2_p_off~0_16, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_11} OutVars{main_#t~post2=|v_main_#t~post2_3|, main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_5, main_~glob2_p_off~0=v_main_~glob2_p_off~0_15, main_~MAXPATHLEN~0=v_main_~MAXPATHLEN~0_11} AuxVars[] AssignedVars[main_#t~post2, main_~glob2_p_off~0] {436#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 03:09:08,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} [64] L41_primed-->L41: Formula: (<= v_main_~glob2_p_off~0_6 v_main_~glob2_pathlim_off~0_3) InVars {main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3, main_~glob2_p_off~0=v_main_~glob2_p_off~0_6} OutVars{main_~glob2_pathlim_off~0=v_main_~glob2_pathlim_off~0_3, main_~glob2_p_off~0=v_main_~glob2_p_off~0_6} AuxVars[] AssignedVars[] {437#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 03:09:08,315 INFO L272 TraceCheckUtils]: 10: Hoare triple {437#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {431#true} is VALID [2022-04-28 03:09:08,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 03:09:08,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 03:09:08,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 03:09:08,316 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {431#true} {437#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {437#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 03:09:08,317 INFO L272 TraceCheckUtils]: 15: Hoare triple {437#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {442#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:09:08,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {442#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {443#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:09:08,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {443#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {432#false} is VALID [2022-04-28 03:09:08,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {432#false} assume !false; {432#false} is VALID [2022-04-28 03:09:08,319 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-28 03:09:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:08,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917242722] [2022-04-28 03:09:08,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917242722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:08,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:08,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:08,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:08,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1742848887] [2022-04-28 03:09:08,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1742848887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:08,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:08,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:09:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070853074] [2022-04-28 03:09:08,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:08,697 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2022-04-28 03:09:08,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:08,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:09:08,717 WARN L143 InductivityCheck]: Transition 445#(and (<= main_~glob2_p_off~0 main_~glob2_pathlim_off~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)) ( _ , call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); , 447#(and (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (exists ((v_main_~glob2_p_off~0_21 Int)) (and (<= v_main_~glob2_p_off~0_21 main_~glob2_pathlim_off~0) (or (and (<= 0 v_main_~glob2_p_off~0_21) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= 0 v_main_~glob2_p_off~0_21)) (= |__VERIFIER_assert_#in~cond| 0)))))) ) not inductive [2022-04-28 03:09:08,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:09:08,718 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 03:09:08,725 INFO L158 Benchmark]: Toolchain (without parser) took 7427.16ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 128.8MB in the beginning and 77.2MB in the end (delta: 51.6MB). Peak memory consumption was 87.5MB. Max. memory is 8.0GB. [2022-04-28 03:09:08,726 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory was 145.0MB in the beginning and 144.9MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:09:08,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.24ms. Allocated memory is still 178.3MB. Free memory was 128.6MB in the beginning and 153.5MB in the end (delta: -24.8MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-28 03:09:08,731 INFO L158 Benchmark]: Boogie Preprocessor took 26.05ms. Allocated memory is still 178.3MB. Free memory was 153.5MB in the beginning and 152.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 03:09:08,734 INFO L158 Benchmark]: RCFGBuilder took 262.36ms. Allocated memory is still 178.3MB. Free memory was 152.0MB in the beginning and 140.9MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:09:08,734 INFO L158 Benchmark]: TraceAbstraction took 6918.17ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 140.2MB in the beginning and 77.2MB in the end (delta: 63.0MB). Peak memory consumption was 99.7MB. Max. memory is 8.0GB. [2022-04-28 03:09:08,736 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory was 145.0MB in the beginning and 144.9MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.24ms. Allocated memory is still 178.3MB. Free memory was 128.6MB in the beginning and 153.5MB in the end (delta: -24.8MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.05ms. Allocated memory is still 178.3MB. Free memory was 153.5MB in the beginning and 152.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 262.36ms. Allocated memory is still 178.3MB. Free memory was 152.0MB in the beginning and 140.9MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6918.17ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 140.2MB in the beginning and 77.2MB in the end (delta: 63.0MB). Peak memory consumption was 99.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 03:09:08,774 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...