./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/cstrpbrk_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 ce305d75684696e5fabb4c8d08830bbd90a67b7669f979309850a29850c4f917 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:16:13,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:16:14,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:16:14,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:16:14,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:16:14,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:16:14,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:16:14,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:16:14,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:16:14,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:16:14,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:16:14,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:16:14,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:16:14,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:16:14,089 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:16:14,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:16:14,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:16:14,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:16:14,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:16:14,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:16:14,094 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:16:14,097 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:16:14,097 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:16:14,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:16:14,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:16:14,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:16:14,098 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:16:14,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:16:14,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:16:14,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:16:14,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:16:14,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:16:14,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:16:14,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:16:14,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:16:14,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:16:14,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:16:14,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:16:14,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:16:14,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:16:14,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:16:14,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:16:14,103 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 -> ce305d75684696e5fabb4c8d08830bbd90a67b7669f979309850a29850c4f917 [2024-11-17 00:16:14,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:16:14,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:16:14,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:16:14,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:16:14,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:16:14,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i [2024-11-17 00:16:15,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:16:16,065 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:16:16,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i [2024-11-17 00:16:16,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c38d305/8284aa852d8a4c3d840c77eccd6db199/FLAG2612bdda9 [2024-11-17 00:16:16,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c38d305/8284aa852d8a4c3d840c77eccd6db199 [2024-11-17 00:16:16,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:16:16,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:16:16,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:16:16,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:16:16,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:16:16,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8909cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16, skipping insertion in model container [2024-11-17 00:16:16,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:16:16,500 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-17 00:16:16,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:16:16,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:16:16,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:16:16,614 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:16:16,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16 WrapperNode [2024-11-17 00:16:16,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:16:16,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:16:16,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:16:16,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:16:16,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,658 INFO L138 Inliner]: procedures = 118, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-11-17 00:16:16,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:16:16,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:16:16,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:16:16,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:16:16,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,707 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 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-17 00:16:16,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:16:16,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:16:16,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:16:16,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:16:16,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (1/1) ... [2024-11-17 00:16:16,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:16:16,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:16:16,768 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-17 00:16:16,772 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-17 00:16:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:16:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure build_nondet_String [2024-11-17 00:16:16,825 INFO L138 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2024-11-17 00:16:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:16:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:16:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:16:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:16:16,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:16:16,958 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:16:16,962 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:16:17,218 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-17 00:16:17,218 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:16:17,235 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:16:17,237 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:16:17,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:16:17 BoogieIcfgContainer [2024-11-17 00:16:17,239 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:16:17,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:16:17,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:16:17,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:16:17,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:16:16" (1/3) ... [2024-11-17 00:16:17,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbe55de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:16:17, skipping insertion in model container [2024-11-17 00:16:17,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:16:16" (2/3) ... [2024-11-17 00:16:17,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bbe55de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:16:17, skipping insertion in model container [2024-11-17 00:16:17,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:16:17" (3/3) ... [2024-11-17 00:16:17,250 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk_unsafe.i [2024-11-17 00:16:17,267 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:16:17,268 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-17 00:16:17,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:16:17,339 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;@46c92b40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:16:17,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-17 00:16:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 45 states have (on average 1.711111111111111) internal successors, (77), 68 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:16:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 00:16:17,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:17,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:17,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting build_nondet_StringErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:17,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1538448307, now seen corresponding path program 1 times [2024-11-17 00:16:17,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:17,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676348647] [2024-11-17 00:16:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:17,628 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-17 00:16:17,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:16:17,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676348647] [2024-11-17 00:16:17,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676348647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:16:17,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:16:17,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:16:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309694748] [2024-11-17 00:16:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:16:17,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:16:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:16:17,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:16:17,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:16:17,665 INFO L87 Difference]: Start difference. First operand has 72 states, 45 states have (on average 1.711111111111111) internal successors, (77), 68 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:16:17,714 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-17 00:16:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:16:17,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-17 00:16:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:16:17,744 INFO L225 Difference]: With dead ends: 78 [2024-11-17 00:16:17,744 INFO L226 Difference]: Without dead ends: 75 [2024-11-17 00:16:17,746 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-17 00:16:17,750 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:16:17,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:16:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-17 00:16:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-11-17 00:16:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.608695652173913) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:16:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-17 00:16:17,821 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 9 [2024-11-17 00:16:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:16:17,822 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-17 00:16:17,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-17 00:16:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 00:16:17,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:17,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:17,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:16:17,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting build_nondet_StringErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:17,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1539371828, now seen corresponding path program 1 times [2024-11-17 00:16:17,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:17,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269007487] [2024-11-17 00:16:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:17,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:17,951 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-17 00:16:17,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:16:17,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269007487] [2024-11-17 00:16:17,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269007487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:16:17,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:16:17,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:16:17,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481766205] [2024-11-17 00:16:17,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:16:17,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:16:17,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:16:17,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:16:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:16:17,954 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:16:18,012 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-17 00:16:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:16:18,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-17 00:16:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:16:18,014 INFO L225 Difference]: With dead ends: 70 [2024-11-17 00:16:18,014 INFO L226 Difference]: Without dead ends: 70 [2024-11-17 00:16:18,015 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-17 00:16:18,016 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:16:18,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 109 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:16:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-17 00:16:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-17 00:16:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.565217391304348) internal successors, (72), 66 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:16:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-11-17 00:16:18,026 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 9 [2024-11-17 00:16:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:16:18,026 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-11-17 00:16:18,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-11-17 00:16:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 00:16:18,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:18,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:18,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:16:18,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting build_nondet_StringErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1539371829, now seen corresponding path program 1 times [2024-11-17 00:16:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:18,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526927135] [2024-11-17 00:16:18,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:18,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:18,248 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-17 00:16:18,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:16:18,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526927135] [2024-11-17 00:16:18,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526927135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:16:18,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:16:18,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:16:18,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091484578] [2024-11-17 00:16:18,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:16:18,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:16:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:16:18,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:16:18,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:16:18,251 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:16:18,332 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2024-11-17 00:16:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:16:18,333 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-17 00:16:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:16:18,334 INFO L225 Difference]: With dead ends: 74 [2024-11-17 00:16:18,334 INFO L226 Difference]: Without dead ends: 74 [2024-11-17 00:16:18,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:16:18,335 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:16:18,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 174 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:16:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-17 00:16:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-17 00:16:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:16:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-17 00:16:18,342 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 9 [2024-11-17 00:16:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:16:18,342 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-17 00:16:18,342 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-17 00:16:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:16:18,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:18,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:18,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:16:18,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:18,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash 447255249, now seen corresponding path program 1 times [2024-11-17 00:16:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:18,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802560194] [2024-11-17 00:16:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:18,511 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-17 00:16:18,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:16:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802560194] [2024-11-17 00:16:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802560194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:16:18,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:16:18,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:16:18,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825117337] [2024-11-17 00:16:18,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:16:18,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:16:18,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:16:18,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:16:18,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:16:18,516 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:16:18,572 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2024-11-17 00:16:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:16:18,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 00:16:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:16:18,577 INFO L225 Difference]: With dead ends: 75 [2024-11-17 00:16:18,577 INFO L226 Difference]: Without dead ends: 75 [2024-11-17 00:16:18,577 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-17 00:16:18,578 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:16:18,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:16:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-17 00:16:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-17 00:16:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:16:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2024-11-17 00:16:18,584 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 10 [2024-11-17 00:16:18,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:16:18,585 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2024-11-17 00:16:18,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-17 00:16:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:16:18,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:18,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:18,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:16:18,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:18,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash 475884400, now seen corresponding path program 1 times [2024-11-17 00:16:18,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:18,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051770929] [2024-11-17 00:16:18,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:18,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:18,754 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-17 00:16:18,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:16:18,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051770929] [2024-11-17 00:16:18,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051770929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:16:18,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:16:18,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:16:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761665727] [2024-11-17 00:16:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:16:18,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:16:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:16:18,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:16:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:16:18,759 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:16:18,800 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-17 00:16:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:16:18,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 00:16:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:16:18,802 INFO L225 Difference]: With dead ends: 78 [2024-11-17 00:16:18,802 INFO L226 Difference]: Without dead ends: 78 [2024-11-17 00:16:18,802 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-17 00:16:18,804 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:16:18,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 129 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:16:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-17 00:16:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-11-17 00:16:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:16:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2024-11-17 00:16:18,813 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 10 [2024-11-17 00:16:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:16:18,813 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2024-11-17 00:16:18,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-17 00:16:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:16:18,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:18,814 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:18,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:16:18,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting build_nondet_StringErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:18,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:18,815 INFO L85 PathProgramCache]: Analyzing trace with hash -555705897, now seen corresponding path program 1 times [2024-11-17 00:16:18,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:18,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549910312] [2024-11-17 00:16:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:18,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:19,067 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-17 00:16:19,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:16:19,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549910312] [2024-11-17 00:16:19,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549910312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:16:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147427466] [2024-11-17 00:16:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:19,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:16:19,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:16:19,072 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-17 00:16:19,106 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-17 00:16:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:19,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 00:16:19,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:16:19,318 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-17 00:16:19,548 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-17 00:16:19,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:16:19,819 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-17 00:16:19,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147427466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:16:19,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:16:19,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-11-17 00:16:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478494948] [2024-11-17 00:16:19,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:16:19,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 00:16:19,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:16:19,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 00:16:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:16:19,822 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:16:20,056 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-11-17 00:16:20,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:16:20,057 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 00:16:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:16:20,058 INFO L225 Difference]: With dead ends: 77 [2024-11-17 00:16:20,058 INFO L226 Difference]: Without dead ends: 77 [2024-11-17 00:16:20,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:16:20,061 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 16 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:16:20,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 373 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:16:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-17 00:16:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-17 00:16:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:16:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-17 00:16:20,071 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 13 [2024-11-17 00:16:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:16:20,072 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-17 00:16:20,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-17 00:16:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-17 00:16:20,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:20,075 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:20,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:16:20,275 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-17 00:16:20,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash -47015666, now seen corresponding path program 1 times [2024-11-17 00:16:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:20,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110447041] [2024-11-17 00:16:20,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:20,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:16:20,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:16:20,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110447041] [2024-11-17 00:16:20,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110447041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:16:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993975709] [2024-11-17 00:16:20,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:20,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:16:20,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:16:20,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:16:20,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:16:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:20,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:16:20,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:16:20,633 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-17 00:16:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:16:20,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:16:20,831 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-17 00:16:20,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993975709] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-17 00:16:20,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:16:20,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 12 [2024-11-17 00:16:20,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980503066] [2024-11-17 00:16:20,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:16:20,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:16:20,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:16:20,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:16:20,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:16:20,834 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:16:20,902 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-17 00:16:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:16:20,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-17 00:16:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:16:20,905 INFO L225 Difference]: With dead ends: 72 [2024-11-17 00:16:20,906 INFO L226 Difference]: Without dead ends: 72 [2024-11-17 00:16:20,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:16:20,907 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 7 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:16:20,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 174 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:16:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-17 00:16:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-11-17 00:16:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 64 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:16:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-11-17 00:16:20,911 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 14 [2024-11-17 00:16:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:16:20,912 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-11-17 00:16:20,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:16:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-11-17 00:16:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:16:20,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:20,913 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:20,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:16:21,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-17 00:16:21,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:21,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1733886037, now seen corresponding path program 1 times [2024-11-17 00:16:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:21,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120601580] [2024-11-17 00:16:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:21,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:16:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:16:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:16:21,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:16:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120601580] [2024-11-17 00:16:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120601580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:16:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025513021] [2024-11-17 00:16:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:21,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:16:21,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:16:21,680 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:16:21,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:16:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:21,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-17 00:16:21,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:16:21,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:16:21,997 WARN L873 $PredicateComparison]: unable to prove that (exists ((build_nondet_String_~nondetString~0.base Int)) (= |c_#length| (store |c_old(#length)| build_nondet_String_~nondetString~0.base 1))) is different from true [2024-11-17 00:16:22,029 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:16:22,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:16:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-17 00:16:22,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:16:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:16:22,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025513021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:16:22,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:16:22,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2024-11-17 00:16:22,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244537615] [2024-11-17 00:16:22,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:16:22,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-17 00:16:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:16:22,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-17 00:16:22,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=826, Unknown=1, NotChecked=58, Total=992 [2024-11-17 00:16:22,625 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 32 states, 30 states have (on average 2.2) internal successors, (66), 27 states have internal predecessors, (66), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:16:26,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-17 00:16:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:16:27,694 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2024-11-17 00:16:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:16:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.2) internal successors, (66), 27 states have internal predecessors, (66), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2024-11-17 00:16:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:16:27,697 INFO L225 Difference]: With dead ends: 134 [2024-11-17 00:16:27,697 INFO L226 Difference]: Without dead ends: 134 [2024-11-17 00:16:27,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=218, Invalid=1591, Unknown=1, NotChecked=82, Total=1892 [2024-11-17 00:16:27,699 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 120 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:16:27,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1047 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 831 Invalid, 1 Unknown, 151 Unchecked, 4.6s Time] [2024-11-17 00:16:27,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-17 00:16:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2024-11-17 00:16:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 90 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:16:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2024-11-17 00:16:27,715 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 28 [2024-11-17 00:16:27,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:16:27,715 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2024-11-17 00:16:27,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.2) internal successors, (66), 27 states have internal predecessors, (66), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:16:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2024-11-17 00:16:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:16:27,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:27,716 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:27,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:16:27,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:16:27,917 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:27,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1733886036, now seen corresponding path program 1 times [2024-11-17 00:16:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359133648] [2024-11-17 00:16:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:28,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:16:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:28,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:16:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:16:28,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:16:28,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359133648] [2024-11-17 00:16:28,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359133648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:16:28,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611299272] [2024-11-17 00:16:28,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:28,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:16:28,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:16:28,195 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:16:28,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:16:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:28,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 00:16:28,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:16:28,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:16:28,298 WARN L873 $PredicateComparison]: unable to prove that (exists ((build_nondet_String_~nondetString~0.base Int)) (= |c_#valid| (store |c_old(#valid)| build_nondet_String_~nondetString~0.base 1))) is different from true [2024-11-17 00:16:28,326 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:16:28,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:16:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-17 00:16:28,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:16:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:16:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611299272] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:16:28,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:16:28,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 12 [2024-11-17 00:16:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710916068] [2024-11-17 00:16:28,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:16:28,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:16:28,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:16:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:16:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-11-17 00:16:28,495 INFO L87 Difference]: Start difference. First operand 96 states and 121 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:16:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:16:28,710 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2024-11-17 00:16:28,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:16:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-11-17 00:16:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:16:28,712 INFO L225 Difference]: With dead ends: 96 [2024-11-17 00:16:28,712 INFO L226 Difference]: Without dead ends: 96 [2024-11-17 00:16:28,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=189, Unknown=1, NotChecked=28, Total=272 [2024-11-17 00:16:28,712 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:16:28,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 261 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 61 Unchecked, 0.1s Time] [2024-11-17 00:16:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-17 00:16:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-11-17 00:16:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.452054794520548) internal successors, (106), 87 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-17 00:16:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2024-11-17 00:16:28,727 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 28 [2024-11-17 00:16:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:16:28,727 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2024-11-17 00:16:28,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:16:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2024-11-17 00:16:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-17 00:16:28,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:28,728 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:28,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:16:28,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:16:28,933 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:28,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:28,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1666879284, now seen corresponding path program 1 times [2024-11-17 00:16:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:28,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483402506] [2024-11-17 00:16:28,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:29,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 00:16:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 00:16:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:16:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:16:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483402506] [2024-11-17 00:16:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483402506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:16:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184353258] [2024-11-17 00:16:29,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:29,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:16:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:16:29,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:16:29,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:16:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:16:29,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 00:16:29,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:16:29,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:16:29,612 WARN L873 $PredicateComparison]: unable to prove that (exists ((build_nondet_String_~nondetString~0.base Int)) (and (= (store |c_old(#length)| build_nondet_String_~nondetString~0.base (select |c_#length| build_nondet_String_~nondetString~0.base)) |c_#length|) (= (select |c_old(#valid)| build_nondet_String_~nondetString~0.base) 0))) is different from true [2024-11-17 00:16:29,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:16:29,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:16:29,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:16:29,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:16:29,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-17 00:16:29,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:16:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184353258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:16:29,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:16:29,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-11-17 00:16:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730939676] [2024-11-17 00:16:29,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:16:29,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 00:16:29,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:16:29,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 00:16:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=407, Unknown=1, NotChecked=40, Total=506 [2024-11-17 00:16:29,825 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:16:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:16:30,417 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2024-11-17 00:16:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 00:16:30,418 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-17 00:16:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:16:30,419 INFO L225 Difference]: With dead ends: 138 [2024-11-17 00:16:30,419 INFO L226 Difference]: Without dead ends: 138 [2024-11-17 00:16:30,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=983, Unknown=2, NotChecked=64, Total=1190 [2024-11-17 00:16:30,421 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 151 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:16:30,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 412 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 427 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2024-11-17 00:16:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-17 00:16:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 65. [2024-11-17 00:16:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:16:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-17 00:16:30,431 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 28 [2024-11-17 00:16:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:16:30,431 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-17 00:16:30,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:16:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-17 00:16:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:16:30,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:16:30,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:30,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 00:16:30,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-17 00:16:30,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-17 00:16:30,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:16:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash 395142387, now seen corresponding path program 1 times [2024-11-17 00:16:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:16:30,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636715740] [2024-11-17 00:16:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:16:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:16:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:16:30,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 00:16:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:16:30,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 00:16:30,690 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 00:16:30,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2024-11-17 00:16:30,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-11-17 00:16:30,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-11-17 00:16:30,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-11-17 00:16:30,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-11-17 00:16:30,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (17 of 23 remaining) [2024-11-17 00:16:30,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (16 of 23 remaining) [2024-11-17 00:16:30,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (15 of 23 remaining) [2024-11-17 00:16:30,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (14 of 23 remaining) [2024-11-17 00:16:30,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (13 of 23 remaining) [2024-11-17 00:16:30,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (12 of 23 remaining) [2024-11-17 00:16:30,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (11 of 23 remaining) [2024-11-17 00:16:30,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2024-11-17 00:16:30,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2024-11-17 00:16:30,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2024-11-17 00:16:30,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2024-11-17 00:16:30,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2024-11-17 00:16:30,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2024-11-17 00:16:30,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2024-11-17 00:16:30,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2024-11-17 00:16:30,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2024-11-17 00:16:30,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2024-11-17 00:16:30,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2024-11-17 00:16:30,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:16:30,701 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:16:30,730 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:16:30,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:16:30 BoogieIcfgContainer [2024-11-17 00:16:30,734 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:16:30,735 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:16:30,735 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:16:30,735 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:16:30,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:16:17" (3/4) ... [2024-11-17 00:16:30,736 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-17 00:16:30,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:16:30,782 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:16:30,782 INFO L158 Benchmark]: Toolchain (without parser) took 14673.42ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 71.0MB in the beginning and 170.1MB in the end (delta: -99.1MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-11-17 00:16:30,783 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:16:30,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.09ms. Allocated memory was 142.6MB in the beginning and 195.0MB in the end (delta: 52.4MB). Free memory was 70.9MB in the beginning and 157.5MB in the end (delta: -86.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-17 00:16:30,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.84ms. Allocated memory is still 195.0MB. Free memory was 157.5MB in the beginning and 155.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:16:30,783 INFO L158 Benchmark]: Boogie Preprocessor took 70.47ms. Allocated memory is still 195.0MB. Free memory was 155.4MB in the beginning and 153.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:16:30,783 INFO L158 Benchmark]: IcfgBuilder took 508.74ms. Allocated memory is still 195.0MB. Free memory was 153.3MB in the beginning and 134.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 00:16:30,784 INFO L158 Benchmark]: TraceAbstraction took 13493.01ms. Allocated memory was 195.0MB in the beginning and 243.3MB in the end (delta: 48.2MB). Free memory was 134.4MB in the beginning and 173.3MB in the end (delta: -38.8MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-17 00:16:30,784 INFO L158 Benchmark]: Witness Printer took 47.07ms. Allocated memory is still 243.3MB. Free memory was 173.3MB in the beginning and 170.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 00:16:30,785 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.09ms. Allocated memory was 142.6MB in the beginning and 195.0MB in the end (delta: 52.4MB). Free memory was 70.9MB in the beginning and 157.5MB in the end (delta: -86.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.84ms. Allocated memory is still 195.0MB. Free memory was 157.5MB in the beginning and 155.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.47ms. Allocated memory is still 195.0MB. Free memory was 155.4MB in the beginning and 153.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 508.74ms. Allocated memory is still 195.0MB. Free memory was 153.3MB in the beginning and 134.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13493.01ms. Allocated memory was 195.0MB in the beginning and 243.3MB in the end (delta: 48.2MB). Free memory was 134.4MB in the beginning and 173.3MB in the end (delta: -38.8MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Witness Printer took 47.07ms. Allocated memory is still 243.3MB. Free memory was 173.3MB in the beginning and 170.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L546] 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}] [L527] nondetString[length-1] = '\0' VAL [nondetString={-1:0}] [L528] return nondetString; VAL [\result={-1:0}] [L546] RET, EXPR build_nondet_String() [L546] char* s1 = build_nondet_String(); [L547] 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={-2:0}] [L521] COND FALSE !(i < length - 1) VAL [length=1, nondetString={-2:0}] [L527] nondetString[length-1] = '\0' VAL [nondetString={-2:0}] [L528] return nondetString; VAL [\result={-2:0}] [L547] RET, EXPR build_nondet_String() VAL [s1={-1:0}] [L547] char* s2 = build_nondet_String(); [L548] CALL cstrpbrk(s1,s2) [L532] const char *sc1; [L533] const char *s; [L534] int c; [L535] sc1 = s1 VAL [s2={-2:0}, sc1={-1:0}] [L535] EXPR \read(*sc1) [L535] COND FALSE !(*sc1 != '\0') [L543] return 0; VAL [\result={0:0}, s2={-2:0}, sc1={-1:0}] [L548] RET cstrpbrk(s1,s2) - 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: 545]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: 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 2 procedures, 72 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 3009 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 308 IncrementalHoareTripleChecker+Unchecked, 2376 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1822 IncrementalHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 633 mSDtfsCounter, 1822 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 157 SyntacticMatches, 7 SemanticMatches, 133 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=8, InterpolantAutomatonStates: 76, 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, 129 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 333 ConstructedInterpolants, 37 QuantifiedInterpolants, 3153 SizeOfPredicates, 12 NumberOfNonLiveVariables, 479 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 32/95 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-17 00:16:30,822 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)