./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/alternating_list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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 valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f533383f211897ea0c402e211f6c19321d99a2ee7c27b850c3f29a2cf1ec1863 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:11:50,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:11:50,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:11:50,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:11:50,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:11:50,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:11:50,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:11:50,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:11:50,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:11:50,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:11:50,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:11:50,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:11:50,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:11:50,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:11:50,594 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:11:50,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:11:50,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:11:50,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:11:50,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:11:50,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:11:50,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:11:50,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:11:50,596 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:11:50,596 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:11:50,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:11:50,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:11:50,597 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:11:50,597 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:11:50,597 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:11:50,597 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:11:50,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:11:50,598 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:11:50,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:11:50,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:11:50,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:11:50,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:11:50,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:11:50,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:11:50,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:11:50,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:11:50,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:11:50,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:11:50,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:11:50,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:11:50,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:11:50,602 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 valid-memcleanup) ) 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 -> f533383f211897ea0c402e211f6c19321d99a2ee7c27b850c3f29a2cf1ec1863 [2024-11-09 07:11:50,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:11:50,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:11:50,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:11:50,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:11:50,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:11:50,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2024-11-09 07:11:52,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:11:52,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:11:52,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2024-11-09 07:11:52,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25282102d/29108819bd604fa49b24aec7e851c38e/FLAGda8256227 [2024-11-09 07:11:52,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25282102d/29108819bd604fa49b24aec7e851c38e [2024-11-09 07:11:52,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:11:52,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:11:52,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:11:52,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:11:52,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:11:52,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454f5694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52, skipping insertion in model container [2024-11-09 07:11:52,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:11:52,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:11:52,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:11:52,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:11:52,597 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:11:52,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52 WrapperNode [2024-11-09 07:11:52,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:11:52,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:11:52,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:11:52,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:11:52,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,627 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2024-11-09 07:11:52,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:11:52,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:11:52,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:11:52,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:11:52,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,647 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-09 07:11:52,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:11:52,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:11:52,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:11:52,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:11:52,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (1/1) ... [2024-11-09 07:11:52,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:11:52,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:52,697 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-11-09 07:11:52,699 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-11-09 07:11:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 07:11:52,738 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 07:11:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:11:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:11:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:11:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:11:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:11:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:11:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:11:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:11:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:11:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:11:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:11:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:11:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:11:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:11:52,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:11:52,895 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:11:52,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:11:52,919 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 07:11:53,041 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 07:11:53,042 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:11:53,053 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:11:53,054 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:11:53,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:53 BoogieIcfgContainer [2024-11-09 07:11:53,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:11:53,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:11:53,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:11:53,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:11:53,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:11:52" (1/3) ... [2024-11-09 07:11:53,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7821bf2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:11:53, skipping insertion in model container [2024-11-09 07:11:53,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:52" (2/3) ... [2024-11-09 07:11:53,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7821bf2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:11:53, skipping insertion in model container [2024-11-09 07:11:53,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:53" (3/3) ... [2024-11-09 07:11:53,064 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2024-11-09 07:11:53,077 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:11:53,078 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:11:53,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:11:53,119 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=None, 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;@16ec6767, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:11:53,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:11:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 32 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:11:53,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:53,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:53,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:53,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash 953782395, now seen corresponding path program 1 times [2024-11-09 07:11:53,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:53,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526501708] [2024-11-09 07:11:53,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:53,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:53,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:53,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526501708] [2024-11-09 07:11:53,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526501708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:53,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:53,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:11:53,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940687209] [2024-11-09 07:11:53,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:53,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:11:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:11:53,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:11:53,291 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 32 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-11-09 07:11:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:53,302 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-09 07:11:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:11:53,303 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2024-11-09 07:11:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:53,307 INFO L225 Difference]: With dead ends: 33 [2024-11-09 07:11:53,307 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 07:11:53,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:11:53,311 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:53,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 07:11:53,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 07:11:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 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-11-09 07:11:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-09 07:11:53,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 11 [2024-11-09 07:11:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:53,332 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 07:11:53,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-11-09 07:11:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-09 07:11:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:11:53,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:53,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:53,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:11:53,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:53,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash 635160532, now seen corresponding path program 1 times [2024-11-09 07:11:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:53,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307160250] [2024-11-09 07:11:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307160250] [2024-11-09 07:11:53,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307160250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:53,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:53,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:11:53,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35331259] [2024-11-09 07:11:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:53,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:11:53,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:11:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:11:53,562 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-11-09 07:11:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:53,653 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2024-11-09 07:11:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:11:53,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 14 [2024-11-09 07:11:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:53,654 INFO L225 Difference]: With dead ends: 61 [2024-11-09 07:11:53,654 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 07:11:53,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:11:53,655 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:53,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 72 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:11:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 07:11:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2024-11-09 07:11:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 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-11-09 07:11:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-09 07:11:53,660 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 14 [2024-11-09 07:11:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:53,661 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-09 07:11:53,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-11-09 07:11:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-09 07:11:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:11:53,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:53,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:53,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:11:53,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:53,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 681880720, now seen corresponding path program 1 times [2024-11-09 07:11:53,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:53,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008255956] [2024-11-09 07:11:53,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:53,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008255956] [2024-11-09 07:11:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008255956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:53,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:53,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:11:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125547259] [2024-11-09 07:11:53,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:53,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:11:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:53,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:11:53,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:53,729 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11-09 07:11:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:53,747 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-11-09 07:11:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:11:53,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2024-11-09 07:11:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:53,750 INFO L225 Difference]: With dead ends: 67 [2024-11-09 07:11:53,751 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 07:11:53,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:53,752 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:53,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 07:11:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2024-11-09 07:11:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 52 states have internal predecessors, (66), 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-11-09 07:11:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-11-09 07:11:53,757 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 14 [2024-11-09 07:11:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:53,757 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-11-09 07:11:53,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11-09 07:11:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-11-09 07:11:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:11:53,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:53,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:53,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:11:53,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:53,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash 675207536, now seen corresponding path program 1 times [2024-11-09 07:11:53,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:53,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679029723] [2024-11-09 07:11:53,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:53,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679029723] [2024-11-09 07:11:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679029723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:53,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:53,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:11:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686963559] [2024-11-09 07:11:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:53,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:11:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:11:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:11:53,918 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-11-09 07:11:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:53,988 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-11-09 07:11:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:11:53,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) Word has length 14 [2024-11-09 07:11:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:53,991 INFO L225 Difference]: With dead ends: 59 [2024-11-09 07:11:53,993 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 07:11:53,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:11:53,994 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:53,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 77 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 07:11:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2024-11-09 07:11:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 44 states have internal predecessors, (53), 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-11-09 07:11:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-11-09 07:11:54,003 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 14 [2024-11-09 07:11:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:54,021 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-11-09 07:11:54,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-11-09 07:11:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-11-09 07:11:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:11:54,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:54,023 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:54,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:11:54,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:54,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash 505478745, now seen corresponding path program 1 times [2024-11-09 07:11:54,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:54,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698702493] [2024-11-09 07:11:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:54,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:54,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698702493] [2024-11-09 07:11:54,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698702493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:54,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:54,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:11:54,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694001418] [2024-11-09 07:11:54,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:54,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:11:54,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:54,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:11:54,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:11:54,130 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-11-09 07:11:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:54,241 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-09 07:11:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:11:54,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) Word has length 16 [2024-11-09 07:11:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:54,242 INFO L225 Difference]: With dead ends: 62 [2024-11-09 07:11:54,242 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 07:11:54,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:11:54,243 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:54,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:11:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 07:11:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2024-11-09 07:11:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 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-11-09 07:11:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-11-09 07:11:54,251 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 16 [2024-11-09 07:11:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:54,252 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-11-09 07:11:54,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-11-09 07:11:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-11-09 07:11:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:11:54,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:54,253 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:54,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:11:54,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:54,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash -100549217, now seen corresponding path program 1 times [2024-11-09 07:11:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:54,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801875788] [2024-11-09 07:11:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:54,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:54,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801875788] [2024-11-09 07:11:54,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801875788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:54,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284933663] [2024-11-09 07:11:54,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:54,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:54,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:54,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:54,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:11:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:54,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 07:11:54,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:54,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:11:54,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:11:54,829 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:11:54,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:11:54,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:11:54,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:11:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:54,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:55,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_95 (Array Int Int)) (v_ArrVal_96 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_95 .cse0))) v_ArrVal_95)) (< (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_95) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_96) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) is different from false [2024-11-09 07:11:55,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:55,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2024-11-09 07:11:55,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-11-09 07:11:55,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:11:55,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2024-11-09 07:11:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:55,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284933663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:55,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2024-11-09 07:11:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767078239] [2024-11-09 07:11:55,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:55,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:11:55,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:55,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:11:55,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=4, NotChecked=46, Total=650 [2024-11-09 07:11:55,369 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 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-11-09 07:11:55,695 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_9| Int)) (or (forall ((v_ArrVal_95 (Array Int Int)) (v_ArrVal_96 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_95 .cse0))) v_ArrVal_95)) (< (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_95) |v_ULTIMATE.start_main_~t~0#1.base_9| v_ArrVal_96) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_9|))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_96 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_96) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) is different from false [2024-11-09 07:11:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:55,977 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2024-11-09 07:11:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 07:11:55,979 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 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) Word has length 20 [2024-11-09 07:11:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:55,980 INFO L225 Difference]: With dead ends: 135 [2024-11-09 07:11:55,980 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 07:11:55,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=336, Invalid=1386, Unknown=8, NotChecked=162, Total=1892 [2024-11-09 07:11:55,981 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 240 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 41 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:55,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 345 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 302 Invalid, 27 Unknown, 135 Unchecked, 0.2s Time] [2024-11-09 07:11:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 07:11:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 78. [2024-11-09 07:11:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 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-11-09 07:11:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2024-11-09 07:11:55,994 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 20 [2024-11-09 07:11:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:55,994 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2024-11-09 07:11:55,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 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-11-09 07:11:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2024-11-09 07:11:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:11:55,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:55,997 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:56,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:11:56,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 07:11:56,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:56,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash -60502213, now seen corresponding path program 1 times [2024-11-09 07:11:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502047909] [2024-11-09 07:11:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:11:56,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:11:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:11:56,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:11:56,238 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:11:56,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-09 07:11:56,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-09 07:11:56,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:11:56,244 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:56,264 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:11:56,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:11:56 BoogieIcfgContainer [2024-11-09 07:11:56,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:11:56,268 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:11:56,268 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:11:56,269 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:11:56,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:53" (3/4) ... [2024-11-09 07:11:56,270 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 07:11:56,303 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:11:56,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:11:56,304 INFO L158 Benchmark]: Toolchain (without parser) took 4045.67ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 89.6MB in the beginning and 63.7MB in the end (delta: 25.9MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2024-11-09 07:11:56,304 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:11:56,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.26ms. Allocated memory is still 159.4MB. Free memory was 89.4MB in the beginning and 70.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 07:11:56,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.48ms. Allocated memory is still 159.4MB. Free memory was 70.0MB in the beginning and 68.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:11:56,305 INFO L158 Benchmark]: Boogie Preprocessor took 33.43ms. Allocated memory is still 159.4MB. Free memory was 68.1MB in the beginning and 65.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:11:56,305 INFO L158 Benchmark]: RCFGBuilder took 393.22ms. Allocated memory is still 159.4MB. Free memory was 65.5MB in the beginning and 119.6MB in the end (delta: -54.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-09 07:11:56,305 INFO L158 Benchmark]: TraceAbstraction took 3210.84ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 119.6MB in the beginning and 65.8MB in the end (delta: 53.8MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-11-09 07:11:56,305 INFO L158 Benchmark]: Witness Printer took 35.15ms. Allocated memory is still 199.2MB. Free memory was 65.8MB in the beginning and 63.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:11:56,306 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.18ms. Allocated memory is still 117.4MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.26ms. Allocated memory is still 159.4MB. Free memory was 89.4MB in the beginning and 70.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.48ms. Allocated memory is still 159.4MB. Free memory was 70.0MB in the beginning and 68.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.43ms. Allocated memory is still 159.4MB. Free memory was 68.1MB in the beginning and 65.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 393.22ms. Allocated memory is still 159.4MB. Free memory was 65.5MB in the beginning and 119.6MB in the end (delta: -54.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3210.84ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 119.6MB in the beginning and 65.8MB in the end (delta: 53.8MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * Witness Printer took 35.15ms. Allocated memory is still 199.2MB. Free memory was 65.8MB in the beginning and 63.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L532] int flag = 1; [L533] List a = (List) malloc(sizeof(struct node)); [L534] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1] [L535] List t; [L536] List p = a; VAL [a={-1:0}, flag=1, p={-1:0}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] COND TRUE \read(flag) [L539] p->h = 2 [L540] flag = 0 VAL [a={-1:0}, flag=0, p={-1:0}] [L545] t = (List) malloc(sizeof(struct node)) [L546] COND FALSE !(t == 0) VAL [a={-1:0}, flag=0, p={-1:0}, t={-2:0}] [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L537] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a [L552] flag = 1 VAL [a={-1:0}, flag=1, p={-1:0}] [L553] EXPR p->h [L553] COND TRUE p->h != 3 [L554] COND TRUE \read(flag) [L555] flag = 0 [L556] EXPR p->h [L556] COND TRUE p->h != 1 [L573] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "alternating_list-2.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 695 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 135 IncrementalHoareTripleChecker+Unchecked, 530 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 165 mSDtfsCounter, 505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=6, InterpolantAutomatonStates: 51, 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, 6 MinimizatonAttempts, 111 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 121 ConstructedInterpolants, 9 QuantifiedInterpolants, 841 SizeOfPredicates, 6 NumberOfNonLiveVariables, 124 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 2/8 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-09 07:11:56,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)