./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.c_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ef1fc44e9d13d6b9af376534301f020e362ffbe9feb46f88fe421121f63fd75 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:43:24,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:43:24,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:43:24,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:43:24,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:43:24,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:43:24,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:43:24,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:43:24,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:43:24,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:43:24,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:43:24,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:43:24,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:43:24,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:43:24,638 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:43:24,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:43:24,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:43:24,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:43:24,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:43:24,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:43:24,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:43:24,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:43:24,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:43:24,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:43:24,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:43:24,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:43:24,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:43:24,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:43:24,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:43:24,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:43:24,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:43:24,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:43:24,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:43:24,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:43:24,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:43:24,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:43:24,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:43:24,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:43:24,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:43:24,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:43:24,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:43:24,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:43:24,649 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ef1fc44e9d13d6b9af376534301f020e362ffbe9feb46f88fe421121f63fd75 [2024-10-14 01:43:24,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:43:24,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:43:24,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:43:24,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:43:24,933 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:43:24,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.c_1.i [2024-10-14 01:43:26,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:43:26,592 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:43:26,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.c_1.i [2024-10-14 01:43:26,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c6a98bb0/d11ab5b112434a4ca10461600d587d6a/FLAGf7d82a59c [2024-10-14 01:43:26,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c6a98bb0/d11ab5b112434a4ca10461600d587d6a [2024-10-14 01:43:26,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:43:26,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:43:26,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:43:26,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:43:26,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:43:26,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:43:26" (1/1) ... [2024-10-14 01:43:26,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38986037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:26, skipping insertion in model container [2024-10-14 01:43:26,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:43:26" (1/1) ... [2024-10-14 01:43:26,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:43:27,115 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.c_1.i[303,316] [2024-10-14 01:43:27,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:43:27,154 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:43:27,176 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.c_1.i[303,316] [2024-10-14 01:43:27,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:43:27,204 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:43:27,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27 WrapperNode [2024-10-14 01:43:27,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:43:27,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:43:27,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:43:27,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:43:27,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,257 INFO L138 Inliner]: procedures = 24, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-10-14 01:43:27,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:43:27,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:43:27,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:43:27,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:43:27,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,284 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-10-14 01:43:27,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:43:27,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:43:27,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:43:27,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:43:27,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (1/1) ... [2024-10-14 01:43:27,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:43:27,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:43:27,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 01:43:27,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 01:43:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:43:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:43:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:43:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-14 01:43:27,391 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-14 01:43:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:43:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:43:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:43:27,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:43:27,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:43:27,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:43:27,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:43:27,394 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-14 01:43:27,394 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-14 01:43:27,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:43:27,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:43:27,510 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:43:27,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:43:27,743 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-14 01:43:27,743 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:43:27,805 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:43:27,806 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 01:43:27,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:27 BoogieIcfgContainer [2024-10-14 01:43:27,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:43:27,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:43:27,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:43:27,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:43:27,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:43:26" (1/3) ... [2024-10-14 01:43:27,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23eacd9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:43:27, skipping insertion in model container [2024-10-14 01:43:27,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:43:27" (2/3) ... [2024-10-14 01:43:27,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23eacd9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:43:27, skipping insertion in model container [2024-10-14 01:43:27,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:27" (3/3) ... [2024-10-14 01:43:27,815 INFO L112 eAbstractionObserver]: Analyzing ICFG rule57_ebda_blast.c_1.i [2024-10-14 01:43:27,837 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:43:27,837 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:43:27,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:43:27,919 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@228ad93f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:43:27,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:43:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 01:43:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 01:43:27,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:27,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:27,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:27,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash 256811059, now seen corresponding path program 1 times [2024-10-14 01:43:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:27,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587750530] [2024-10-14 01:43:27,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:28,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:43:28,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587750530] [2024-10-14 01:43:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587750530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:43:28,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:43:28,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 01:43:28,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371887560] [2024-10-14 01:43:28,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:43:28,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 01:43:28,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:28,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 01:43:28,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:43:28,375 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:43:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:28,492 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2024-10-14 01:43:28,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:43:28,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-14 01:43:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:28,503 INFO L225 Difference]: With dead ends: 40 [2024-10-14 01:43:28,503 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 01:43:28,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:43:28,512 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:28,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 98 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:43:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 01:43:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-14 01:43:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 01:43:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-14 01:43:28,556 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2024-10-14 01:43:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:28,558 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-14 01:43:28,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 01:43:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-14 01:43:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 01:43:28,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:28,560 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:28,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:43:28,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:28,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1042899808, now seen corresponding path program 1 times [2024-10-14 01:43:28,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:28,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545643289] [2024-10-14 01:43:28,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:28,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:28,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 01:43:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:43:28,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545643289] [2024-10-14 01:43:28,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545643289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:43:28,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:43:28,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 01:43:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750629773] [2024-10-14 01:43:28,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:43:28,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 01:43:28,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:28,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 01:43:28,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:43:28,835 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 01:43:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:28,944 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-14 01:43:28,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 01:43:28,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-14 01:43:28,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:28,947 INFO L225 Difference]: With dead ends: 36 [2024-10-14 01:43:28,947 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 01:43:28,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:43:28,949 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:28,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 81 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:43:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 01:43:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 01:43:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 01:43:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-14 01:43:28,958 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2024-10-14 01:43:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:28,960 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-14 01:43:28,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 01:43:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-14 01:43:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 01:43:28,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:28,962 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:28,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:43:28,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:28,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1499609064, now seen corresponding path program 1 times [2024-10-14 01:43:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700808813] [2024-10-14 01:43:28,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:29,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 01:43:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 01:43:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 01:43:29,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700808813] [2024-10-14 01:43:29,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700808813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:43:29,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:43:29,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:43:29,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35309631] [2024-10-14 01:43:29,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:43:29,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:43:29,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:29,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:43:29,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:43:29,138 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 01:43:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:29,217 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-10-14 01:43:29,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:43:29,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-10-14 01:43:29,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:29,219 INFO L225 Difference]: With dead ends: 42 [2024-10-14 01:43:29,220 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 01:43:29,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:43:29,222 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:29,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 59 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:43:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 01:43:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 01:43:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 01:43:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-10-14 01:43:29,230 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2024-10-14 01:43:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:29,231 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-14 01:43:29,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 01:43:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-10-14 01:43:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 01:43:29,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:43:29,232 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:43:29,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:43:29,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:43:29,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:43:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash -543580867, now seen corresponding path program 1 times [2024-10-14 01:43:29,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:43:29,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957207614] [2024-10-14 01:43:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:43:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:43:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:29,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 01:43:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 01:43:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 01:43:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:29,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 01:43:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:29,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 01:43:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:43:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 01:43:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:43:29,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957207614] [2024-10-14 01:43:29,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957207614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:43:29,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:43:29,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 01:43:29,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043470124] [2024-10-14 01:43:29,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:43:29,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:43:29,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:43:29,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:43:29,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:43:29,417 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 01:43:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:43:29,476 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-10-14 01:43:29,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:43:29,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-10-14 01:43:29,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:43:29,478 INFO L225 Difference]: With dead ends: 28 [2024-10-14 01:43:29,478 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 01:43:29,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 01:43:29,481 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:43:29,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:43:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 01:43:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 01:43:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:43:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 01:43:29,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2024-10-14 01:43:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:43:29,485 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 01:43:29,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 01:43:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 01:43:29,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 01:43:29,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 01:43:29,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 01:43:29,495 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 01:43:29,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 01:43:29,572 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 01:43:29,584 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~tmp_slot~0!base [2024-10-14 01:43:29,588 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~tmp_slot~0!base [2024-10-14 01:43:29,598 WARN L155 FloydHoareUtils]: Requires clause for kzalloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-14 01:43:29,599 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-10-14 01:43:29,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:43:29 BoogieIcfgContainer [2024-10-14 01:43:29,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 01:43:29,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 01:43:29,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 01:43:29,600 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 01:43:29,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:43:27" (3/4) ... [2024-10-14 01:43:29,603 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 01:43:29,606 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2024-10-14 01:43:29,606 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2024-10-14 01:43:29,611 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-14 01:43:29,611 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 01:43:29,611 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 01:43:29,611 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 01:43:29,704 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 01:43:29,705 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 01:43:29,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 01:43:29,708 INFO L158 Benchmark]: Toolchain (without parser) took 2749.00ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 99.7MB in the beginning and 90.4MB in the end (delta: 9.3MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-10-14 01:43:29,708 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:43:29,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.44ms. Allocated memory is still 153.1MB. Free memory was 99.7MB in the beginning and 123.3MB in the end (delta: -23.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-10-14 01:43:29,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.40ms. Allocated memory is still 153.1MB. Free memory was 123.3MB in the beginning and 122.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:43:29,709 INFO L158 Benchmark]: Boogie Preprocessor took 39.59ms. Allocated memory is still 153.1MB. Free memory was 122.0MB in the beginning and 119.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:43:29,709 INFO L158 Benchmark]: RCFGBuilder took 508.35ms. Allocated memory is still 153.1MB. Free memory was 119.2MB in the beginning and 100.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 01:43:29,710 INFO L158 Benchmark]: TraceAbstraction took 1790.85ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 99.6MB in the beginning and 95.6MB in the end (delta: 4.0MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2024-10-14 01:43:29,710 INFO L158 Benchmark]: Witness Printer took 107.71ms. Allocated memory is still 190.8MB. Free memory was 95.6MB in the beginning and 90.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 01:43:29,712 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 55.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.44ms. Allocated memory is still 153.1MB. Free memory was 99.7MB in the beginning and 123.3MB in the end (delta: -23.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.40ms. Allocated memory is still 153.1MB. Free memory was 123.3MB in the beginning and 122.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.59ms. Allocated memory is still 153.1MB. Free memory was 122.0MB in the beginning and 119.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 508.35ms. Allocated memory is still 153.1MB. Free memory was 119.2MB in the beginning and 100.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1790.85ms. Allocated memory was 153.1MB in the beginning and 190.8MB in the end (delta: 37.7MB). Free memory was 99.6MB in the beginning and 95.6MB in the end (delta: 4.0MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * Witness Printer took 107.71ms. Allocated memory is still 190.8MB. Free memory was 95.6MB in the beginning and 90.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~tmp_slot~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~tmp_slot~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 273 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 82 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 50]: Procedure Contract for kfree Derived contract for procedure kfree. Requires: (used_tmp_slot == 1) Ensures: (used_tmp_slot == 1) RESULT: Ultimate proved your program to be correct! [2024-10-14 01:43:29,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE