./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10a3b461143c2c5d394f7bd34cd6fefed4195b79a5252178f7ede404a303cf96 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:58:44,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:58:44,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 14:58:44,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:58:44,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:58:44,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:58:44,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:58:44,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:58:44,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:58:44,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:58:44,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:58:44,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:58:44,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:58:44,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:58:44,479 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:58:44,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:58:44,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:58:44,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:58:44,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:58:44,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:58:44,483 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:58:44,484 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:58:44,484 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 14:58:44,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:58:44,484 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:58:44,484 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:58:44,485 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:58:44,485 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:58:44,485 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:58:44,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:58:44,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:58:44,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:58:44,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:58:44,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:58:44,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:58:44,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:58:44,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:58:44,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:58:44,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:58:44,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:58:44,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:58:44,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:58:44,488 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10a3b461143c2c5d394f7bd34cd6fefed4195b79a5252178f7ede404a303cf96 [2024-11-10 14:58:44,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:58:44,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:58:44,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:58:44,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:58:44,814 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:58:44,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i [2024-11-10 14:58:46,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:58:46,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:58:46,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrchr_unsafe.i [2024-11-10 14:58:46,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae90d60a/35dac1044df546879039a517f12c9610/FLAG15f51a512 [2024-11-10 14:58:46,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae90d60a/35dac1044df546879039a517f12c9610 [2024-11-10 14:58:46,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:58:46,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:58:46,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:58:46,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:58:46,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:58:46,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:58:46" (1/1) ... [2024-11-10 14:58:46,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad7afb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:46, skipping insertion in model container [2024-11-10 14:58:46,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:58:46" (1/1) ... [2024-11-10 14:58:46,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:58:46,967 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:58:46,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:58:47,001 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:58:47,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:58:47,086 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:58:47,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47 WrapperNode [2024-11-10 14:58:47,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:58:47,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:58:47,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:58:47,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:58:47,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,136 INFO L138 Inliner]: procedures = 118, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-11-10 14:58:47,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:58:47,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:58:47,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:58:47,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:58:47,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,167 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-10 14:58:47,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:58:47,184 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:58:47,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:58:47,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:58:47,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (1/1) ... [2024-11-10 14:58:47,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:58:47,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:58:47,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:58:47,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:58:47,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 14:58:47,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 14:58:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:58:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:58:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:58:47,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:58:47,410 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:58:47,412 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:58:47,595 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: havoc cstrchr_#t~mem10#1; [2024-11-10 14:58:47,612 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-10 14:58:47,615 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:58:47,626 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:58:47,627 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:58:47,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:58:47 BoogieIcfgContainer [2024-11-10 14:58:47,627 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:58:47,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:58:47,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:58:47,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:58:47,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:58:46" (1/3) ... [2024-11-10 14:58:47,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba97ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:58:47, skipping insertion in model container [2024-11-10 14:58:47,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:58:47" (2/3) ... [2024-11-10 14:58:47,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba97ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:58:47, skipping insertion in model container [2024-11-10 14:58:47,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:58:47" (3/3) ... [2024-11-10 14:58:47,637 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe.i [2024-11-10 14:58:47,654 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:58:47,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-10 14:58:47,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:58:47,699 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;@749def63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:58:47,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 14:58:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 32 states have (on average 1.6875) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 14:58:47,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:47,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:47,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:47,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash 901938834, now seen corresponding path program 1 times [2024-11-10 14:58:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:47,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999748072] [2024-11-10 14:58:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:47,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999748072] [2024-11-10 14:58:47,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999748072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:47,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:47,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:58:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152787562] [2024-11-10 14:58:47,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:47,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:58:47,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:47,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:58:47,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:58:47,964 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.6875) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:48,010 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-11-10 14:58:48,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:58:48,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 14:58:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:48,018 INFO L225 Difference]: With dead ends: 55 [2024-11-10 14:58:48,018 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 14:58:48,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:58:48,022 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:48,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 14:58:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-11-10 14:58:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-10 14:58:48,049 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 7 [2024-11-10 14:58:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:48,050 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-10 14:58:48,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-10 14:58:48,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 14:58:48,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:48,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:48,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:58:48,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:48,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:48,052 INFO L85 PathProgramCache]: Analyzing trace with hash 902862355, now seen corresponding path program 1 times [2024-11-10 14:58:48,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:48,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68354458] [2024-11-10 14:58:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:48,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68354458] [2024-11-10 14:58:48,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68354458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:48,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:58:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420029225] [2024-11-10 14:58:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:48,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:58:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:48,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:58:48,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:58:48,140 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:48,183 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2024-11-10 14:58:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:58:48,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 14:58:48,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:48,185 INFO L225 Difference]: With dead ends: 47 [2024-11-10 14:58:48,185 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 14:58:48,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:58:48,186 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:48,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 14:58:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-10 14:58:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-11-10 14:58:48,196 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 7 [2024-11-10 14:58:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:48,196 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-10 14:58:48,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-11-10 14:58:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 14:58:48,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:48,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:48,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:58:48,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:48,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash 902862356, now seen corresponding path program 1 times [2024-11-10 14:58:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524348952] [2024-11-10 14:58:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:48,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:48,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524348952] [2024-11-10 14:58:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524348952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:48,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:48,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:58:48,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449293637] [2024-11-10 14:58:48,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:48,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:58:48,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:48,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:58:48,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:58:48,462 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:48,571 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-11-10 14:58:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:58:48,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 14:58:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:48,573 INFO L225 Difference]: With dead ends: 51 [2024-11-10 14:58:48,573 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 14:58:48,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:58:48,575 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:48,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 121 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:58:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 14:58:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-10 14:58:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.5) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-11-10 14:58:48,582 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 7 [2024-11-10 14:58:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:48,582 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-11-10 14:58:48,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-11-10 14:58:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 14:58:48,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:48,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:48,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:58:48,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:48,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2104669189, now seen corresponding path program 1 times [2024-11-10 14:58:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353990508] [2024-11-10 14:58:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:48,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353990508] [2024-11-10 14:58:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353990508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:48,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:48,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:58:48,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867614848] [2024-11-10 14:58:48,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:48,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:58:48,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:58:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:58:48,766 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:48,830 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-11-10 14:58:48,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:58:48,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 14:58:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:48,832 INFO L225 Difference]: With dead ends: 52 [2024-11-10 14:58:48,832 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 14:58:48,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:58:48,834 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:48,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:58:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 14:58:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 14:58:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-11-10 14:58:48,839 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 8 [2024-11-10 14:58:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:48,839 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-11-10 14:58:48,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-11-10 14:58:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 14:58:48,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:48,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:48,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:58:48,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:48,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2076040038, now seen corresponding path program 1 times [2024-11-10 14:58:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:48,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854759777] [2024-11-10 14:58:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:49,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:49,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854759777] [2024-11-10 14:58:49,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854759777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:49,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:49,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:58:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655280517] [2024-11-10 14:58:49,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:49,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:58:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:49,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:58:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:58:49,060 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:49,120 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-11-10 14:58:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:58:49,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 14:58:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:49,123 INFO L225 Difference]: With dead ends: 55 [2024-11-10 14:58:49,124 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 14:58:49,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:58:49,125 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:49,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 100 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:58:49,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 14:58:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-11-10 14:58:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-11-10 14:58:49,136 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 8 [2024-11-10 14:58:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:49,137 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-11-10 14:58:49,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-11-10 14:58:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 14:58:49,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:49,140 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:49,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:58:49,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:49,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 279508854, now seen corresponding path program 1 times [2024-11-10 14:58:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:49,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202218962] [2024-11-10 14:58:49,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:49,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:49,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:49,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202218962] [2024-11-10 14:58:49,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202218962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:58:49,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023981375] [2024-11-10 14:58:49,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:49,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:58:49,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:58:49,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:58:49,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:58:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:49,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 14:58:49,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:58:49,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-10 14:58:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:49,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:58:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:49,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023981375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:58:49,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:58:49,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-11-10 14:58:49,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51260998] [2024-11-10 14:58:49,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:58:49,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 14:58:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:49,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 14:58:49,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-10 14:58:49,998 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:50,227 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-11-10 14:58:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 14:58:50,229 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 14:58:50,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:50,229 INFO L225 Difference]: With dead ends: 54 [2024-11-10 14:58:50,229 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 14:58:50,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2024-11-10 14:58:50,230 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:50,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 156 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:58:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 14:58:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-11-10 14:58:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-11-10 14:58:50,234 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2024-11-10 14:58:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:50,235 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-11-10 14:58:50,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-11-10 14:58:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 14:58:50,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:50,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:50,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:58:50,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 14:58:50,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:50,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1565007435, now seen corresponding path program 1 times [2024-11-10 14:58:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:50,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082598819] [2024-11-10 14:58:50,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:50,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082598819] [2024-11-10 14:58:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082598819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:50,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:50,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:58:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839711212] [2024-11-10 14:58:50,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:50,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:58:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:50,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:58:50,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:58:50,509 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:50,566 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-11-10 14:58:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:58:50,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-10 14:58:50,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:50,567 INFO L225 Difference]: With dead ends: 47 [2024-11-10 14:58:50,568 INFO L226 Difference]: Without dead ends: 47 [2024-11-10 14:58:50,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:58:50,570 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:50,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 81 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:58:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-10 14:58:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-10 14:58:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-11-10 14:58:50,578 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 12 [2024-11-10 14:58:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:50,578 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-11-10 14:58:50,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-11-10 14:58:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 14:58:50,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:50,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:50,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:58:50,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:50,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1565007434, now seen corresponding path program 1 times [2024-11-10 14:58:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:50,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243541131] [2024-11-10 14:58:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:50,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243541131] [2024-11-10 14:58:50,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243541131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:50,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:50,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 14:58:50,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950671340] [2024-11-10 14:58:50,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:50,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:58:50,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:50,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:58:50,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:58:50,713 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:50,798 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-10 14:58:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 14:58:50,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2024-11-10 14:58:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:50,800 INFO L225 Difference]: With dead ends: 57 [2024-11-10 14:58:50,800 INFO L226 Difference]: Without dead ends: 57 [2024-11-10 14:58:50,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:58:50,800 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:50,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 131 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:58:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-10 14:58:50,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-10 14:58:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-10 14:58:50,808 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 12 [2024-11-10 14:58:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:50,808 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-10 14:58:50,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-11-10 14:58:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 14:58:50,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:50,811 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:50,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:58:50,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:50,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash 74837880, now seen corresponding path program 1 times [2024-11-10 14:58:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:50,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68933750] [2024-11-10 14:58:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:50,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:51,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:51,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68933750] [2024-11-10 14:58:51,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68933750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:51,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:51,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 14:58:51,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780462158] [2024-11-10 14:58:51,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:51,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:58:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:51,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:58:51,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:58:51,012 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:51,052 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-10 14:58:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:58:51,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2024-11-10 14:58:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:51,053 INFO L225 Difference]: With dead ends: 54 [2024-11-10 14:58:51,053 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 14:58:51,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:58:51,054 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:51,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 14:58:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-11-10 14:58:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-10 14:58:51,057 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 12 [2024-11-10 14:58:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:51,057 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-10 14:58:51,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-10 14:58:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 14:58:51,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:51,058 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:51,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:58:51,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:51,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1626011514, now seen corresponding path program 1 times [2024-11-10 14:58:51,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:51,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877671212] [2024-11-10 14:58:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:51,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:58:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:58:51,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:58:51,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877671212] [2024-11-10 14:58:51,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877671212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:58:51,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:58:51,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:58:51,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324189279] [2024-11-10 14:58:51,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:58:51,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:58:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:58:51,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:58:51,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:58:51,082 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:58:51,091 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-11-10 14:58:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:58:51,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-10 14:58:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:58:51,092 INFO L225 Difference]: With dead ends: 52 [2024-11-10 14:58:51,093 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 14:58:51,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:58:51,093 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:58:51,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:58:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 14:58:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-10 14:58:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-11-10 14:58:51,097 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 17 [2024-11-10 14:58:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:58:51,097 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-10 14:58:51,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:58:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-10 14:58:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 14:58:51,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:58:51,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:51,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:58:51,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2024-11-10 14:58:51,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:58:51,099 INFO L85 PathProgramCache]: Analyzing trace with hash 768661474, now seen corresponding path program 1 times [2024-11-10 14:58:51,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:58:51,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293252206] [2024-11-10 14:58:51,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:58:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:58:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:58:51,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:58:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:58:51,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:58:51,137 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:58:51,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 16 remaining) [2024-11-10 14:58:51,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2024-11-10 14:58:51,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (13 of 16 remaining) [2024-11-10 14:58:51,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (12 of 16 remaining) [2024-11-10 14:58:51,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (11 of 16 remaining) [2024-11-10 14:58:51,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2024-11-10 14:58:51,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2024-11-10 14:58:51,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2024-11-10 14:58:51,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2024-11-10 14:58:51,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2024-11-10 14:58:51,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2024-11-10 14:58:51,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2024-11-10 14:58:51,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2024-11-10 14:58:51,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2024-11-10 14:58:51,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2024-11-10 14:58:51,142 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2024-11-10 14:58:51,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:58:51,145 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:58:51,164 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:58:51,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:58:51 BoogieIcfgContainer [2024-11-10 14:58:51,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:58:51,168 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:58:51,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:58:51,169 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:58:51,169 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:58:47" (3/4) ... [2024-11-10 14:58:51,170 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:58:51,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:58:51,207 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:58:51,208 INFO L158 Benchmark]: Toolchain (without parser) took 4623.05ms. Allocated memory was 180.4MB in the beginning and 237.0MB in the end (delta: 56.6MB). Free memory was 144.5MB in the beginning and 89.1MB in the end (delta: 55.4MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. [2024-11-10 14:58:51,208 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:58:51,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.75ms. Allocated memory is still 180.4MB. Free memory was 144.3MB in the beginning and 134.2MB in the end (delta: 10.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:58:51,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.24ms. Allocated memory is still 180.4MB. Free memory was 134.2MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:58:51,209 INFO L158 Benchmark]: Boogie Preprocessor took 44.66ms. Allocated memory is still 180.4MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:58:51,209 INFO L158 Benchmark]: IcfgBuilder took 443.56ms. Allocated memory is still 180.4MB. Free memory was 130.1MB in the beginning and 136.6MB in the end (delta: -6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:58:51,210 INFO L158 Benchmark]: TraceAbstraction took 3538.65ms. Allocated memory was 180.4MB in the beginning and 237.0MB in the end (delta: 56.6MB). Free memory was 136.6MB in the beginning and 91.2MB in the end (delta: 45.4MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2024-11-10 14:58:51,210 INFO L158 Benchmark]: Witness Printer took 38.91ms. Allocated memory is still 237.0MB. Free memory was 91.2MB in the beginning and 89.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:58:51,212 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.19ms. Allocated memory is still 180.4MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.75ms. Allocated memory is still 180.4MB. Free memory was 144.3MB in the beginning and 134.2MB in the end (delta: 10.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.24ms. Allocated memory is still 180.4MB. Free memory was 134.2MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.66ms. Allocated memory is still 180.4MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 443.56ms. Allocated memory is still 180.4MB. Free memory was 130.1MB in the beginning and 136.6MB in the end (delta: -6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3538.65ms. Allocated memory was 180.4MB in the beginning and 237.0MB in the end (delta: 56.6MB). Free memory was 136.6MB in the beginning and 91.2MB in the end (delta: 45.4MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. * Witness Printer took 38.91ms. Allocated memory is still 237.0MB. Free memory was 91.2MB in the beginning and 89.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L536] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L517] length = 1 VAL [length=1] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=1, nondetString={-1:0}] [L521] COND FALSE !(i < length - 1) VAL [length=1, nondetString={-1:0}] [L526] nondetString[length-1] = '\0' [L527] return nondetString; VAL [\result={-1:0}] [L536] RET, EXPR build_nondet_String() [L536] char* s = build_nondet_String(); [L537] CALL cstrchr(s,__VERIFIER_nondet_int()) [L531] EXPR \read(*s) [L531] *s != '\0' && *s != (char)c VAL [c=2, s={-1:0}] [L531] *s != '\0' && *s != (char)c [L531] COND FALSE !(*s != '\0' && *s != (char)c) [L533] EXPR \read(*s) [L533] return ( (*s == c) ? (char *) s : 0 ); [L537] RET cstrchr(s,__VERIFIER_nondet_int()) - UnprovableResult [Line: 535]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 1017 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 627 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 471 IncrementalHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 390 mSDtfsCounter, 471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 1052 SizeOfPredicates, 1 NumberOfNonLiveVariables, 42 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 6/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:58:51,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)