./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/test21-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test21-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 05085beafc13f38fbda38ea415197838c6c50810d8ce271072546e893cc1f1e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:54:16,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:54:16,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:54:16,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:54:16,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:54:16,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:54:16,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:54:16,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:54:16,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:54:16,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:54:16,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:54:16,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:54:16,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:54:16,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:54:16,523 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:54:16,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:54:16,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:54:16,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:54:16,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:54:16,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:54:16,524 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:54:16,524 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:54:16,527 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:54:16,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:54:16,527 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:54:16,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:54:16,528 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:54:16,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:54:16,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:54:16,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:54:16,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:54:16,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:54:16,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:54:16,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:54:16,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:54:16,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:54:16,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:54:16,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:54:16,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:54:16,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:54:16,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:54:16,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:54:16,530 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-clean/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-clean/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 -> 05085beafc13f38fbda38ea415197838c6c50810d8ce271072546e893cc1f1e6 [2024-10-11 17:54:16,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:54:16,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:54:16,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:54:16,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:54:16,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:54:16,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test21-1.c [2024-10-11 17:54:18,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:54:18,191 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:54:18,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test21-1.c [2024-10-11 17:54:18,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c59e696b3/db7e7e13f8bc4820883c962b05a23a46/FLAG6ca5668c3 [2024-10-11 17:54:18,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c59e696b3/db7e7e13f8bc4820883c962b05a23a46 [2024-10-11 17:54:18,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:54:18,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:54:18,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:54:18,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:54:18,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:54:18,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42090c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18, skipping insertion in model container [2024-10-11 17:54:18,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:54:18,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:54:18,790 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:54:18,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:54:18,815 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:54:18,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18 WrapperNode [2024-10-11 17:54:18,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:54:18,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:54:18,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:54:18,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:54:18,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,838 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 65 [2024-10-11 17:54:18,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:54:18,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:54:18,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:54:18,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:54:18,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,864 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 4 writes are split as follows [0, 4]. [2024-10-11 17:54:18,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:54:18,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:54:18,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:54:18,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:54:18,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (1/1) ... [2024-10-11 17:54:18,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:54:18,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:54:18,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:54:18,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:54:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:54:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:54:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:54:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:54:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:54:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2024-10-11 17:54:18,950 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2024-10-11 17:54:18,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:54:18,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:54:18,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:54:18,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:54:19,015 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:54:19,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:54:19,185 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 17:54:19,185 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:54:19,234 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:54:19,235 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:54:19,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:54:19 BoogieIcfgContainer [2024-10-11 17:54:19,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:54:19,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:54:19,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:54:19,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:54:19,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:54:18" (1/3) ... [2024-10-11 17:54:19,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fc3d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:54:19, skipping insertion in model container [2024-10-11 17:54:19,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:54:18" (2/3) ... [2024-10-11 17:54:19,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fc3d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:54:19, skipping insertion in model container [2024-10-11 17:54:19,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:54:19" (3/3) ... [2024-10-11 17:54:19,244 INFO L112 eAbstractionObserver]: Analyzing ICFG test21-1.c [2024-10-11 17:54:19,255 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:54:19,256 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-11 17:54:19,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:54:19,290 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;@23bf44f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:54:19,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-11 17:54:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 15 states have (on average 2.066666666666667) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:54:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 17:54:19,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:19,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 17:54:19,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:19,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:19,302 INFO L85 PathProgramCache]: Analyzing trace with hash 3013, now seen corresponding path program 1 times [2024-10-11 17:54:19,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:19,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481142639] [2024-10-11 17:54:19,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:19,485 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-11 17:54:19,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:19,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481142639] [2024-10-11 17:54:19,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481142639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:19,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:19,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:54:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700511111] [2024-10-11 17:54:19,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:19,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:54:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:19,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:54:19,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:54:19,514 INFO L87 Difference]: Start difference. First operand has 33 states, 15 states have (on average 2.066666666666667) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-11 17:54:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:19,547 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-11 17:54:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:54:19,552 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-11 17:54:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:19,556 INFO L225 Difference]: With dead ends: 31 [2024-10-11 17:54:19,557 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 17:54:19,558 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-11 17:54:19,560 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:19,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 17:54:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 17:54:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.8) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:54:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-11 17:54:19,584 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 2 [2024-10-11 17:54:19,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:19,584 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-11 17:54:19,584 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-11 17:54:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-11 17:54:19,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 17:54:19,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:19,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 17:54:19,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:54:19,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:19,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash 3014, now seen corresponding path program 1 times [2024-10-11 17:54:19,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:19,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707833909] [2024-10-11 17:54:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:19,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:19,653 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-11 17:54:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:19,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707833909] [2024-10-11 17:54:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707833909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:19,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:54:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798460225] [2024-10-11 17:54:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:19,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:54:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:54:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:54:19,656 INFO L87 Difference]: Start difference. First operand 30 states and 31 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-11 17:54:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:19,681 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-10-11 17:54:19,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:54:19,682 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-11 17:54:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:19,683 INFO L225 Difference]: With dead ends: 28 [2024-10-11 17:54:19,683 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 17:54:19,684 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-11 17:54:19,685 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:19,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 16 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 17:54:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 17:54:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 24 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:54:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-10-11 17:54:19,689 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 2 [2024-10-11 17:54:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:19,689 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-11 17:54:19,689 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-11 17:54:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-10-11 17:54:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:54:19,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:19,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:54:19,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:54:19,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:19,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2953353, now seen corresponding path program 1 times [2024-10-11 17:54:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907474901] [2024-10-11 17:54:19,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:19,774 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-11 17:54:19,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:19,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907474901] [2024-10-11 17:54:19,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907474901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:19,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:19,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:54:19,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379683843] [2024-10-11 17:54:19,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:19,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:54:19,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:19,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:54:19,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:54:19,777 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11 17:54:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:19,799 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2024-10-11 17:54:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:54:19,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-10-11 17:54:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:19,801 INFO L225 Difference]: With dead ends: 26 [2024-10-11 17:54:19,801 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 17:54:19,801 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-11 17:54:19,802 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 13 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-11 17:54:19,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 13 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 17:54:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 17:54:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:54:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-11 17:54:19,806 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 4 [2024-10-11 17:54:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:19,806 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-11 17:54:19,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11 17:54:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-11 17:54:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:54:19,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:19,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:54:19,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:54:19,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:19,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2953354, now seen corresponding path program 1 times [2024-10-11 17:54:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:19,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126644851] [2024-10-11 17:54:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:19,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:19,891 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-11 17:54:19,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:19,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126644851] [2024-10-11 17:54:19,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126644851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:19,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:19,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:54:19,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722337211] [2024-10-11 17:54:19,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:19,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:54:19,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:19,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:54:19,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:54:19,894 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11 17:54:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:19,914 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-10-11 17:54:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:54:19,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-10-11 17:54:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:19,915 INFO L225 Difference]: With dead ends: 24 [2024-10-11 17:54:19,915 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 17:54:19,915 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-11 17:54:19,916 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:19,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 14 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 17:54:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-11 17:54:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:54:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-10-11 17:54:19,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 4 [2024-10-11 17:54:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:19,920 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-10-11 17:54:19,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11 17:54:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-10-11 17:54:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:54:19,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:19,921 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:19,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:54:19,921 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:19,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash -317513882, now seen corresponding path program 1 times [2024-10-11 17:54:19,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:19,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938695086] [2024-10-11 17:54:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:20,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:54:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 17:54:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:54:20,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:20,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938695086] [2024-10-11 17:54:20,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938695086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:54:20,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345452574] [2024-10-11 17:54:20,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:20,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:54:20,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:54:20,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:54:20,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:54:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:20,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 17:54:20,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:54:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:54:20,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:54:20,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345452574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:20,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:54:20,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-11 17:54:20,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700828404] [2024-10-11 17:54:20,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:20,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:54:20,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:20,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:54:20,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:54:20,848 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:20,987 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-10-11 17:54:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:54:20,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-10-11 17:54:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:20,988 INFO L225 Difference]: With dead ends: 23 [2024-10-11 17:54:20,989 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 17:54:20,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:54:20,990 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:20,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:54:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 17:54:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 17:54:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:54:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-11 17:54:20,997 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2024-10-11 17:54:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:20,997 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-11 17:54:20,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-11 17:54:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:54:20,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:20,998 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:21,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:54:21,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:54:21,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:21,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash -317513883, now seen corresponding path program 1 times [2024-10-11 17:54:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:21,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460840616] [2024-10-11 17:54:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:54:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 17:54:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:54:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460840616] [2024-10-11 17:54:21,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460840616] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:54:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364870065] [2024-10-11 17:54:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:21,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:54:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:54:21,335 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:54:21,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:54:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:21,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 17:54:21,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:54:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:54:21,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:54:21,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364870065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:21,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:54:21,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2024-10-11 17:54:21,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284152768] [2024-10-11 17:54:21,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:21,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:54:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:54:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:54:21,587 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:21,670 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-10-11 17:54:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:54:21,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-10-11 17:54:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:21,671 INFO L225 Difference]: With dead ends: 22 [2024-10-11 17:54:21,671 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 17:54:21,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:54:21,672 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:21,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 17:54:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 17:54:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:54:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-10-11 17:54:21,678 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2024-10-11 17:54:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:21,678 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-11 17:54:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-10-11 17:54:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:54:21,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:21,679 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:21,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:54:21,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:54:21,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:21,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1252995778, now seen corresponding path program 1 times [2024-10-11 17:54:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633964605] [2024-10-11 17:54:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:21,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:54:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:21,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 17:54:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:54:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633964605] [2024-10-11 17:54:21,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633964605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:21,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:21,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:54:21,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865462551] [2024-10-11 17:54:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:21,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:54:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:54:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:54:21,941 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:21,964 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-10-11 17:54:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:54:21,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-11 17:54:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:21,965 INFO L225 Difference]: With dead ends: 21 [2024-10-11 17:54:21,966 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 17:54:21,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11 17:54:21,966 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:21,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 17:54:21,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 17:54:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:54:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-11 17:54:21,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-10-11 17:54:21,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:21,972 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-11 17:54:21,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-11 17:54:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:54:21,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:21,973 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:21,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:54:21,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:21,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:21,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1252995777, now seen corresponding path program 1 times [2024-10-11 17:54:21,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:21,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452716888] [2024-10-11 17:54:21,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:21,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:22,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:54:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:22,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 17:54:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:54:22,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:22,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452716888] [2024-10-11 17:54:22,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452716888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:22,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:22,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:54:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125771155] [2024-10-11 17:54:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:22,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:54:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:22,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:54:22,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:54:22,119 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:22,195 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-10-11 17:54:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:54:22,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-11 17:54:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:22,197 INFO L225 Difference]: With dead ends: 20 [2024-10-11 17:54:22,197 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 17:54:22,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:54:22,198 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:22,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 17:54:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 17:54:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:54:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-11 17:54:22,200 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2024-10-11 17:54:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:22,202 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-11 17:54:22,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-11 17:54:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:54:22,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:22,203 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:22,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:54:22,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:22,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1252979854, now seen corresponding path program 1 times [2024-10-11 17:54:22,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:22,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207045581] [2024-10-11 17:54:22,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:22,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:22,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:54:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:22,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 17:54:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:54:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207045581] [2024-10-11 17:54:22,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207045581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:22,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:22,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:54:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799007713] [2024-10-11 17:54:22,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:22,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:54:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:54:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:54:22,235 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:22,248 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-10-11 17:54:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:54:22,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-11 17:54:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:22,248 INFO L225 Difference]: With dead ends: 19 [2024-10-11 17:54:22,249 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 17:54:22,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 17:54:22,249 INFO L432 NwaCegarLoop]: 11 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, 11 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-11 17:54:22,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 17:54:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-11 17:54:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:54:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-10-11 17:54:22,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 16 [2024-10-11 17:54:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:22,251 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-10-11 17:54:22,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-10-11 17:54:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:54:22,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:54:22,252 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:22,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:54:22,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-10-11 17:54:22,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:54:22,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1538062900, now seen corresponding path program 1 times [2024-10-11 17:54:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:54:22,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822518932] [2024-10-11 17:54:22,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:54:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:54:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 17:54:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:22,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 17:54:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:54:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:54:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:54:22,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822518932] [2024-10-11 17:54:22,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822518932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:54:22,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:54:22,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:54:22,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022106838] [2024-10-11 17:54:22,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:54:22,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:54:22,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:54:22,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:54:22,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:54:22,364 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:54:22,381 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-10-11 17:54:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:54:22,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 17:54:22,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:54:22,382 INFO L225 Difference]: With dead ends: 15 [2024-10-11 17:54:22,382 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 17:54:22,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-11 17:54:22,384 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:54:22,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:54:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 17:54:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 17:54:22,385 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-11 17:54:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 17:54:22,385 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2024-10-11 17:54:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:54:22,385 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 17:54:22,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:54:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 17:54:22,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 17:54:22,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2024-10-11 17:54:22,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-10-11 17:54:22,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-10-11 17:54:22,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-10-11 17:54:22,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-10-11 17:54:22,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-10-11 17:54:22,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-10-11 17:54:22,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-10-11 17:54:22,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-10-11 17:54:22,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-10-11 17:54:22,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-10-11 17:54:22,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-10-11 17:54:22,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (1 of 14 remaining) [2024-10-11 17:54:22,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2024-10-11 17:54:22,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:54:22,392 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:54:22,393 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:54:22,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:54:22 BoogieIcfgContainer [2024-10-11 17:54:22,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:54:22,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:54:22,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:54:22,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:54:22,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:54:19" (3/4) ... [2024-10-11 17:54:22,397 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:54:22,399 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2024-10-11 17:54:22,402 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-11 17:54:22,402 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 17:54:22,402 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:54:22,403 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:54:22,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:54:22,462 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:54:22,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:54:22,462 INFO L158 Benchmark]: Toolchain (without parser) took 3851.63ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 131.8MB in the beginning and 157.0MB in the end (delta: -25.2MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-11 17:54:22,463 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:54:22,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.11ms. Allocated memory is still 172.0MB. Free memory was 131.8MB in the beginning and 118.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 17:54:22,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.57ms. Allocated memory is still 172.0MB. Free memory was 118.7MB in the beginning and 117.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:54:22,466 INFO L158 Benchmark]: Boogie Preprocessor took 36.90ms. Allocated memory is still 172.0MB. Free memory was 117.2MB in the beginning and 115.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:54:22,466 INFO L158 Benchmark]: RCFGBuilder took 358.21ms. Allocated memory is still 172.0MB. Free memory was 115.1MB in the beginning and 132.4MB in the end (delta: -17.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 17:54:22,467 INFO L158 Benchmark]: TraceAbstraction took 3156.99ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 131.8MB in the beginning and 161.2MB in the end (delta: -29.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-10-11 17:54:22,467 INFO L158 Benchmark]: Witness Printer took 66.64ms. Allocated memory is still 207.6MB. Free memory was 161.2MB in the beginning and 157.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:54:22,468 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.17ms. Allocated memory is still 100.7MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.11ms. Allocated memory is still 172.0MB. Free memory was 131.8MB in the beginning and 118.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.57ms. Allocated memory is still 172.0MB. Free memory was 118.7MB in the beginning and 117.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.90ms. Allocated memory is still 172.0MB. Free memory was 117.2MB in the beginning and 115.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.21ms. Allocated memory is still 172.0MB. Free memory was 115.1MB in the beginning and 132.4MB in the end (delta: -17.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3156.99ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 131.8MB in the beginning and 161.2MB in the end (delta: -29.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Witness Printer took 66.64ms. Allocated memory is still 207.6MB. Free memory was 161.2MB in the beginning and 157.0MB 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: -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: -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: 32]: 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 2 procedures, 33 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 365 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 116 mSDtfsCounter, 365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 46, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 1186 SizeOfPredicates, 6 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 14/16 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 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:54:22,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE