./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 774a580136eb5be5517f5bdf88a1aea58349f7d80571f2499dc303b413dfbdb7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:37:20,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:37:21,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:37:21,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:37:21,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:37:21,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:37:21,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:37:21,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:37:21,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:37:21,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:37:21,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:37:21,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:37:21,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:37:21,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:37:21,080 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:37:21,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:37:21,081 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:37:21,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:37:21,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:37:21,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:37:21,086 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:37:21,087 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:37:21,087 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:37:21,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:37:21,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:37:21,088 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:37:21,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:37:21,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:37:21,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:37:21,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:37:21,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:37:21,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:37:21,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:37:21,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:37:21,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:37:21,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:37:21,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:37:21,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:37:21,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:37:21,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:37:21,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:37:21,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:37:21,094 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 774a580136eb5be5517f5bdf88a1aea58349f7d80571f2499dc303b413dfbdb7 [2024-10-13 10:37:21,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:37:21,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:37:21,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:37:21,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:37:21,410 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:37:21,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test04.c [2024-10-13 10:37:22,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:37:23,126 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:37:23,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test04.c [2024-10-13 10:37:23,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eba1e4bd6/6fa9ffe7b1064e01a0113e83dda05bb2/FLAGd44569de9 [2024-10-13 10:37:23,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eba1e4bd6/6fa9ffe7b1064e01a0113e83dda05bb2 [2024-10-13 10:37:23,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:37:23,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:37:23,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:37:23,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:37:23,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:37:23,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390c3f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23, skipping insertion in model container [2024-10-13 10:37:23,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:37:23,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:37:23,746 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:37:23,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:37:23,781 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:37:23,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23 WrapperNode [2024-10-13 10:37:23,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:37:23,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:37:23,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:37:23,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:37:23,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,815 INFO L138 Inliner]: procedures = 13, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2024-10-13 10:37:23,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:37:23,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:37:23,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:37:23,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:37:23,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,846 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-13 10:37:23,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:37:23,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:37:23,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:37:23,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:37:23,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (1/1) ... [2024-10-13 10:37:23,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:37:23,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:23,901 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-13 10:37:23,902 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-13 10:37:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:37:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:37:23,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:37:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:37:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:37:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:37:23,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:37:23,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:37:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:37:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:37:23,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:37:24,022 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:37:24,025 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:37:24,170 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-13 10:37:24,170 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:37:24,218 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:37:24,219 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 10:37:24,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:24 BoogieIcfgContainer [2024-10-13 10:37:24,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:37:24,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:37:24,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:37:24,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:37:24,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:37:23" (1/3) ... [2024-10-13 10:37:24,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2357a04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:37:24, skipping insertion in model container [2024-10-13 10:37:24,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:23" (2/3) ... [2024-10-13 10:37:24,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2357a04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:37:24, skipping insertion in model container [2024-10-13 10:37:24,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:24" (3/3) ... [2024-10-13 10:37:24,227 INFO L112 eAbstractionObserver]: Analyzing ICFG test04.c [2024-10-13 10:37:24,244 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:37:24,244 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 10:37:24,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:37:24,292 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;@713ef54f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:37:24,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 10:37:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 12 states have internal predecessors, (13), 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-13 10:37:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:37:24,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:24,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:37:24,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2024-10-13 10:37:24,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1866, now seen corresponding path program 1 times [2024-10-13 10:37:24,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758734687] [2024-10-13 10:37:24,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:24,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:24,727 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-13 10:37:24,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:24,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758734687] [2024-10-13 10:37:24,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758734687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:24,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:24,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:37:24,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802002494] [2024-10-13 10:37:24,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:24,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:24,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:24,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:24,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:24,762 INFO L87 Difference]: Start difference. First operand has 13 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-13 10:37:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:24,802 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2024-10-13 10:37:24,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:24,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-13 10:37:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:24,809 INFO L225 Difference]: With dead ends: 12 [2024-10-13 10:37:24,810 INFO L226 Difference]: Without dead ends: 11 [2024-10-13 10:37:24,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-13 10:37:24,814 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:24,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:24,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-13 10:37:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-13 10:37:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 10 states have internal predecessors, (10), 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-13 10:37:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 10 transitions. [2024-10-13 10:37:24,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 10 transitions. Word has length 2 [2024-10-13 10:37:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:24,840 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 10 transitions. [2024-10-13 10:37:24,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-13 10:37:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2024-10-13 10:37:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:37:24,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:24,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:37:24,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:37:24,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2024-10-13 10:37:24,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:24,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1867, now seen corresponding path program 1 times [2024-10-13 10:37:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:24,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323703861] [2024-10-13 10:37:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:25,020 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-13 10:37:25,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:25,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323703861] [2024-10-13 10:37:25,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323703861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:25,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:25,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:37:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75148328] [2024-10-13 10:37:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:25,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:37:25,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:25,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:37:25,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:37:25,027 INFO L87 Difference]: Start difference. First operand 11 states and 10 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-13 10:37:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:25,046 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2024-10-13 10:37:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:25,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-13 10:37:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:25,047 INFO L225 Difference]: With dead ends: 10 [2024-10-13 10:37:25,047 INFO L226 Difference]: Without dead ends: 10 [2024-10-13 10:37:25,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-13 10:37:25,049 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:25,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-13 10:37:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-13 10:37:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 6 states have (on average 1.5) internal successors, (9), 9 states have internal predecessors, (9), 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-13 10:37:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9 transitions. [2024-10-13 10:37:25,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 9 transitions. Word has length 2 [2024-10-13 10:37:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:25,052 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 9 transitions. [2024-10-13 10:37:25,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-13 10:37:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2024-10-13 10:37:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:37:25,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:25,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:37:25,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:37:25,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2024-10-13 10:37:25,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:25,055 INFO L85 PathProgramCache]: Analyzing trace with hash 58662, now seen corresponding path program 1 times [2024-10-13 10:37:25,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:25,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192626461] [2024-10-13 10:37:25,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:25,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:25,146 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-13 10:37:25,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:25,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192626461] [2024-10-13 10:37:25,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192626461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:25,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:25,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:37:25,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430960410] [2024-10-13 10:37:25,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:25,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:37:25,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:25,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:37:25,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:37:25,151 INFO L87 Difference]: Start difference. First operand 10 states and 9 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-13 10:37:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:25,198 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2024-10-13 10:37:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:37:25,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-13 10:37:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:25,200 INFO L225 Difference]: With dead ends: 9 [2024-10-13 10:37:25,200 INFO L226 Difference]: Without dead ends: 9 [2024-10-13 10:37:25,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-13 10:37:25,202 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:25,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-13 10:37:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-13 10:37:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 8 states have internal predecessors, (8), 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-13 10:37:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions. [2024-10-13 10:37:25,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 3 [2024-10-13 10:37:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:25,209 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions. [2024-10-13 10:37:25,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-13 10:37:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2024-10-13 10:37:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:37:25,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:25,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:37:25,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:37:25,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2024-10-13 10:37:25,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 58663, now seen corresponding path program 1 times [2024-10-13 10:37:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:25,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660453155] [2024-10-13 10:37:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:25,377 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-13 10:37:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660453155] [2024-10-13 10:37:25,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660453155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:37:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636548562] [2024-10-13 10:37:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:25,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:37:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:25,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:37:25,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:37:25,380 INFO L87 Difference]: Start difference. First operand 9 states and 8 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-13 10:37:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:25,421 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2024-10-13 10:37:25,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:37:25,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-13 10:37:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:25,423 INFO L225 Difference]: With dead ends: 8 [2024-10-13 10:37:25,423 INFO L226 Difference]: Without dead ends: 8 [2024-10-13 10:37:25,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-13 10:37:25,427 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:25,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-13 10:37:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-13 10:37:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 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-13 10:37:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2024-10-13 10:37:25,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 3 [2024-10-13 10:37:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:25,434 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2024-10-13 10:37:25,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-13 10:37:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2024-10-13 10:37:25,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:37:25,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:25,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:37:25,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:37:25,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2024-10-13 10:37:25,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash 56373741, now seen corresponding path program 1 times [2024-10-13 10:37:25,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:25,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413256168] [2024-10-13 10:37:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:25,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:25,596 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-13 10:37:25,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:25,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413256168] [2024-10-13 10:37:25,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413256168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:25,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:37:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957213741] [2024-10-13 10:37:25,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:25,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:37:25,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:37:25,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:37:25,601 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-13 10:37:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:25,620 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2024-10-13 10:37:25,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:37:25,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-13 10:37:25,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:25,621 INFO L225 Difference]: With dead ends: 7 [2024-10-13 10:37:25,621 INFO L226 Difference]: Without dead ends: 6 [2024-10-13 10:37:25,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:37:25,623 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:25,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2024-10-13 10:37:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-10-13 10:37:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 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-13 10:37:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5 transitions. [2024-10-13 10:37:25,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 5 transitions. Word has length 5 [2024-10-13 10:37:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:25,631 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 5 transitions. [2024-10-13 10:37:25,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-13 10:37:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2024-10-13 10:37:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:37:25,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:25,632 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:37:25,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:37:25,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2024-10-13 10:37:25,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 56374201, now seen corresponding path program 1 times [2024-10-13 10:37:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:25,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772431874] [2024-10-13 10:37:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:25,749 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-13 10:37:25,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:25,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772431874] [2024-10-13 10:37:25,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772431874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:25,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:25,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:37:25,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497164883] [2024-10-13 10:37:25,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:25,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:37:25,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:25,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:37:25,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:37:25,752 INFO L87 Difference]: Start difference. First operand 6 states and 5 transitions. Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 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-13 10:37:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:25,766 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2024-10-13 10:37:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:37:25,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-10-13 10:37:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:25,769 INFO L225 Difference]: With dead ends: 4 [2024-10-13 10:37:25,769 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 10:37:25,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:37:25,770 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:25,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:37:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 10:37:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 10:37:25,775 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-13 10:37:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 10:37:25,775 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2024-10-13 10:37:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:25,775 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 10:37:25,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 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-13 10:37:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 10:37:25,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 10:37:25,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 6 remaining) [2024-10-13 10:37:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2024-10-13 10:37:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2024-10-13 10:37:25,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2024-10-13 10:37:25,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2024-10-13 10:37:25,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-13 10:37:25,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:37:25,785 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 10:37:25,787 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:37:25,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:37:25 BoogieIcfgContainer [2024-10-13 10:37:25,793 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:37:25,794 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:37:25,794 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:37:25,794 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:37:25,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:24" (3/4) ... [2024-10-13 10:37:25,797 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:37:25,806 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-13 10:37:25,807 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-13 10:37:25,807 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 10:37:25,807 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 10:37:25,894 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:37:25,895 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:37:25,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:37:25,897 INFO L158 Benchmark]: Toolchain (without parser) took 2365.58ms. Allocated memory is still 165.7MB. Free memory was 111.0MB in the beginning and 49.5MB in the end (delta: 61.5MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2024-10-13 10:37:25,897 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 165.7MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:37:25,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.34ms. Allocated memory is still 165.7MB. Free memory was 111.0MB in the beginning and 98.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:37:25,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.81ms. Allocated memory is still 165.7MB. Free memory was 98.4MB in the beginning and 96.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:37:25,899 INFO L158 Benchmark]: Boogie Preprocessor took 46.51ms. Allocated memory is still 165.7MB. Free memory was 96.8MB in the beginning and 95.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:37:25,900 INFO L158 Benchmark]: RCFGBuilder took 353.90ms. Allocated memory is still 165.7MB. Free memory was 95.2MB in the beginning and 81.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 10:37:25,900 INFO L158 Benchmark]: TraceAbstraction took 1571.54ms. Allocated memory is still 165.7MB. Free memory was 80.5MB in the beginning and 53.8MB in the end (delta: 26.7MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-10-13 10:37:25,900 INFO L158 Benchmark]: Witness Printer took 102.66ms. Allocated memory is still 165.7MB. Free memory was 53.8MB in the beginning and 49.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:37:25,902 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.31ms. Allocated memory is still 165.7MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.34ms. Allocated memory is still 165.7MB. Free memory was 111.0MB in the beginning and 98.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.81ms. Allocated memory is still 165.7MB. Free memory was 98.4MB in the beginning and 96.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.51ms. Allocated memory is still 165.7MB. Free memory was 96.8MB in the beginning and 95.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 353.90ms. Allocated memory is still 165.7MB. Free memory was 95.2MB in the beginning and 81.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1571.54ms. Allocated memory is still 165.7MB. Free memory was 80.5MB in the beginning and 53.8MB in the end (delta: 26.7MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Witness Printer took 102.66ms. Allocated memory is still 165.7MB. Free memory was 53.8MB in the beginning and 49.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 10]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 16 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:37:25,934 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 Result: TRUE