./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce305d75684696e5fabb4c8d08830bbd90a67b7669f979309850a29850c4f917 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:46:20,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:46:20,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:46:20,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:46:20,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:46:20,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:46:20,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:46:20,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:46:20,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:46:20,344 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:46:20,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:46:20,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:46:20,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:46:20,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:46:20,349 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:46:20,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:46:20,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:46:20,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:46:20,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:46:20,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:46:20,350 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:46:20,350 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:46:20,351 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:46:20,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:46:20,351 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:46:20,351 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:46:20,351 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:46:20,352 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:46:20,352 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:46:20,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:46:20,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:46:20,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:46:20,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:46:20,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:46:20,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:46:20,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:46:20,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:46:20,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:46:20,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:46:20,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:46:20,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:46:20,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:46:20,356 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce305d75684696e5fabb4c8d08830bbd90a67b7669f979309850a29850c4f917 [2024-10-11 17:46:20,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:46:20,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:46:20,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:46:20,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:46:20,662 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:46:20,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i [2024-10-11 17:46:22,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:46:22,347 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:46:22,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i [2024-10-11 17:46:22,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3ec8fe115/d11df04954524398bf7bae1e5960d35b/FLAGcacb3aa49 [2024-10-11 17:46:22,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3ec8fe115/d11df04954524398bf7bae1e5960d35b [2024-10-11 17:46:22,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:46:22,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:46:22,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:46:22,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:46:22,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:46:22,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b05b717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22, skipping insertion in model container [2024-10-11 17:46:22,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:46:22,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:46:22,754 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:46:22,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:46:22,830 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:46:22,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22 WrapperNode [2024-10-11 17:46:22,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:46:22,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:46:22,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:46:22,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:46:22,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,878 INFO L138 Inliner]: procedures = 118, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2024-10-11 17:46:22,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:46:22,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:46:22,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:46:22,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:46:22,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,918 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-10-11 17:46:22,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:46:22,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:46:22,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:46:22,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:46:22,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (1/1) ... [2024-10-11 17:46:22,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:46:22,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:22,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:46:22,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:46:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:46:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure build_nondet_String [2024-10-11 17:46:23,019 INFO L138 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2024-10-11 17:46:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:46:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:46:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:46:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:46:23,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:46:23,121 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:46:23,124 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:46:23,336 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-11 17:46:23,337 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:46:23,383 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:46:23,383 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 17:46:23,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:46:23 BoogieIcfgContainer [2024-10-11 17:46:23,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:46:23,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:46:23,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:46:23,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:46:23,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:46:22" (1/3) ... [2024-10-11 17:46:23,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507321e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:46:23, skipping insertion in model container [2024-10-11 17:46:23,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:22" (2/3) ... [2024-10-11 17:46:23,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507321e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:46:23, skipping insertion in model container [2024-10-11 17:46:23,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:46:23" (3/3) ... [2024-10-11 17:46:23,396 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk_unsafe.i [2024-10-11 17:46:23,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:46:23,413 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-10-11 17:46:23,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:46:23,467 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;@12894f14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:46:23,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-10-11 17:46:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 29 states have (on average 2.103448275862069) internal successors, (61), 52 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:46:23,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:23,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:23,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:23,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash 9102415, now seen corresponding path program 1 times [2024-10-11 17:46:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15626575] [2024-10-11 17:46:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:23,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:23,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:23,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15626575] [2024-10-11 17:46:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15626575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:23,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:23,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:46:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259309152] [2024-10-11 17:46:23,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:23,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:46:23,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:46:23,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:46:23,813 INFO L87 Difference]: Start difference. First operand has 56 states, 29 states have (on average 2.103448275862069) internal successors, (61), 52 states have internal predecessors, (61), 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 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-10-11 17:46:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:23,882 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2024-10-11 17:46:23,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:46:23,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2024-10-11 17:46:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:23,892 INFO L225 Difference]: With dead ends: 61 [2024-10-11 17:46:23,892 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 17:46:23,894 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-10-11 17:46:23,898 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:23,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 97 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 17:46:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-10-11 17:46:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.903225806451613) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-10-11 17:46:23,932 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 7 [2024-10-11 17:46:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:23,933 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-10-11 17:46:23,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-10-11 17:46:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-10-11 17:46:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:46:23,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:23,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:46:23,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:23,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash 9161997, now seen corresponding path program 1 times [2024-10-11 17:46:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471635953] [2024-10-11 17:46:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:24,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471635953] [2024-10-11 17:46:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471635953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:24,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:24,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:46:24,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453512374] [2024-10-11 17:46:24,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:24,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:46:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:24,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:46:24,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:46:24,022 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-11 17:46:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:24,073 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-10-11 17:46:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:46:24,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-10-11 17:46:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:24,075 INFO L225 Difference]: With dead ends: 55 [2024-10-11 17:46:24,075 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:46:24,076 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-10-11 17:46:24,078 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:24,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:46:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 17:46:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-10-11 17:46:24,088 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 7 [2024-10-11 17:46:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:24,091 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-10-11 17:46:24,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-11 17:46:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-10-11 17:46:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:46:24,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:24,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:24,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:46:24,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:24,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash 9161998, now seen corresponding path program 1 times [2024-10-11 17:46:24,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:24,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672832722] [2024-10-11 17:46:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:24,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672832722] [2024-10-11 17:46:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672832722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:24,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:24,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:46:24,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568263892] [2024-10-11 17:46:24,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:24,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:46:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:24,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:46:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:46:24,329 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-10-11 17:46:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:24,447 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2024-10-11 17:46:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:46:24,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 7 [2024-10-11 17:46:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:24,449 INFO L225 Difference]: With dead ends: 57 [2024-10-11 17:46:24,449 INFO L226 Difference]: Without dead ends: 57 [2024-10-11 17:46:24,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:24,451 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:24,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 156 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-11 17:46:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-11 17:46:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 53 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2024-10-11 17:46:24,464 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 7 [2024-10-11 17:46:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:24,464 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-10-11 17:46:24,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-10-11 17:46:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2024-10-11 17:46:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:46:24,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:24,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:24,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:46:24,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting build_nondet_StringErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:24,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash 282173219, now seen corresponding path program 1 times [2024-10-11 17:46:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:24,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262667925] [2024-10-11 17:46:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:24,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-10-11 17:46:24,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:24,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262667925] [2024-10-11 17:46:24,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262667925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:24,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:24,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:46:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671671670] [2024-10-11 17:46:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:24,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:46:24,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:46:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:46:24,633 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10-11 17:46:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:24,675 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-10-11 17:46:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:46:24,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2024-10-11 17:46:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:24,677 INFO L225 Difference]: With dead ends: 59 [2024-10-11 17:46:24,677 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 17:46:24,677 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-10-11 17:46:24,678 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:24,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 17:46:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 17:46:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 55 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-10-11 17:46:24,687 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 8 [2024-10-11 17:46:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:24,687 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-10-11 17:46:24,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10-11 17:46:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-10-11 17:46:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:46:24,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:24,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:24,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:46:24,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting build_nondet_StringErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:24,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:24,689 INFO L85 PathProgramCache]: Analyzing trace with hash 284020261, now seen corresponding path program 1 times [2024-10-11 17:46:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:24,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507151325] [2024-10-11 17:46:24,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:24,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:24,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:24,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507151325] [2024-10-11 17:46:24,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507151325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:24,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:24,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:46:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622940628] [2024-10-11 17:46:24,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:24,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:46:24,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:24,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:46:24,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:46:24,852 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-10-11 17:46:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:24,924 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2024-10-11 17:46:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:46:24,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 8 [2024-10-11 17:46:24,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:24,925 INFO L225 Difference]: With dead ends: 61 [2024-10-11 17:46:24,926 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 17:46:24,926 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-10-11 17:46:24,927 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:24,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 123 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 17:46:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2024-10-11 17:46:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 55 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-10-11 17:46:24,938 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 8 [2024-10-11 17:46:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:24,939 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-10-11 17:46:24,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-10-11 17:46:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-10-11 17:46:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:46:24,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:24,940 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:24,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:46:24,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:24,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash 214845913, now seen corresponding path program 1 times [2024-10-11 17:46:24,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:24,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250851313] [2024-10-11 17:46:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:24,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:25,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250851313] [2024-10-11 17:46:25,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250851313] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223119722] [2024-10-11 17:46:25,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:25,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:25,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:25,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:25,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:46:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:25,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 17:46:25,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:25,280 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-10-11 17:46:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:25,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223119722] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:25,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:25,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-11 17:46:25,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137872671] [2024-10-11 17:46:25,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:25,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:46:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:25,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:46:25,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:46:25,659 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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-10-11 17:46:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:25,933 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-10-11 17:46:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:46:25,934 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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-10-11 17:46:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:25,935 INFO L225 Difference]: With dead ends: 59 [2024-10-11 17:46:25,935 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 17:46:25,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:46:25,936 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:25,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 334 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:46:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 17:46:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-10-11 17:46:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2024-10-11 17:46:25,942 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 9 [2024-10-11 17:46:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:25,943 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-10-11 17:46:25,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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-10-11 17:46:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2024-10-11 17:46:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:46:25,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:25,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:25,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:46:26,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:26,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting build_nondet_StringErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:26,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1929712966, now seen corresponding path program 1 times [2024-10-11 17:46:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:26,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250386903] [2024-10-11 17:46:26,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250386903] [2024-10-11 17:46:26,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250386903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:26,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678425401] [2024-10-11 17:46:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:26,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:26,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:26,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:26,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:46:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:26,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:46:26,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:26,421 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-10-11 17:46:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:26,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678425401] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:26,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:46:26,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 11 [2024-10-11 17:46:26,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544159954] [2024-10-11 17:46:26,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:26,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:46:26,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:26,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:46:26,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:46:26,596 INFO L87 Difference]: Start difference. First operand 57 states and 64 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-10-11 17:46:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:26,684 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-10-11 17:46:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:46:26,685 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-10-11 17:46:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:26,685 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:46:26,685 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 17:46:26,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:46:26,686 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:26,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 156 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:26,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 17:46:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-10-11 17:46:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-10-11 17:46:26,691 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 10 [2024-10-11 17:46:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:26,691 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-11 17:46:26,691 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-10-11 17:46:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-10-11 17:46:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:46:26,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:26,695 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:26,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:26,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:26,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:26,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1382426828, now seen corresponding path program 1 times [2024-10-11 17:46:26,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:26,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990917651] [2024-10-11 17:46:26,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:46:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:27,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:46:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990917651] [2024-10-11 17:46:27,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990917651] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171260328] [2024-10-11 17:46:27,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:27,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:27,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:27,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:27,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:46:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:27,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 17:46:27,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:27,245 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-10-11 17:46:27,281 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-10-11 17:46:27,314 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 17:46:27,314 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-10-11 17:46:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-11 17:46:27,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171260328] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:27,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:27,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 12 [2024-10-11 17:46:27,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007458721] [2024-10-11 17:46:27,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:27,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 17:46:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:27,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 17:46:27,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-10-11 17:46:27,496 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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-10-11 17:46:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:27,714 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-10-11 17:46:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:46:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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 20 [2024-10-11 17:46:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:27,716 INFO L225 Difference]: With dead ends: 55 [2024-10-11 17:46:27,717 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:46:27,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=215, Unknown=1, NotChecked=30, Total=306 [2024-10-11 17:46:27,718 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:27,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 151 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 57 Unchecked, 0.1s Time] [2024-10-11 17:46:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:46:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-10-11 17:46:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-10-11 17:46:27,723 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 20 [2024-10-11 17:46:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:27,723 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-10-11 17:46:27,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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-10-11 17:46:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-10-11 17:46:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:46:27,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:27,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:27,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:46:27,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:27,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:27,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1382426829, now seen corresponding path program 1 times [2024-10-11 17:46:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:27,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658654931] [2024-10-11 17:46:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:27,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:28,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:46:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:28,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:46:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:28,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:28,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658654931] [2024-10-11 17:46:28,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658654931] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:28,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280371292] [2024-10-11 17:46:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:28,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:28,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:28,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:28,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:46:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:28,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 17:46:28,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:28,436 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-10-11 17:46:28,611 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_build_nondet_String_~nondetString~0.base_34 Int)) (= (store |c_old(#length)| v_build_nondet_String_~nondetString~0.base_34 1) |c_#length|)) is different from true [2024-10-11 17:46:28,627 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 17:46:28,627 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-10-11 17:46:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-11 17:46:28,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:29,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280371292] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:29,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:29,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2024-10-11 17:46:29,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014039789] [2024-10-11 17:46:29,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:29,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 17:46:29,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:29,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 17:46:29,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=767, Unknown=1, NotChecked=56, Total=930 [2024-10-11 17:46:29,147 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 31 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 26 states have internal predecessors, (44), 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-10-11 17:46:33,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 17:46:37,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 17:46:41,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 17:46:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:41,959 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2024-10-11 17:46:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:46:41,961 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 26 states have internal predecessors, (44), 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 20 [2024-10-11 17:46:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:41,962 INFO L225 Difference]: With dead ends: 100 [2024-10-11 17:46:41,962 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 17:46:41,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1438, Unknown=1, NotChecked=78, Total=1722 [2024-10-11 17:46:41,963 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 148 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:41,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 406 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 444 Invalid, 3 Unknown, 117 Unchecked, 12.4s Time] [2024-10-11 17:46:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 17:46:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 69. [2024-10-11 17:46:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 63 states have internal predecessors, (82), 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-10-11 17:46:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-10-11 17:46:41,976 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 20 [2024-10-11 17:46:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:41,976 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-10-11 17:46:41,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 26 states have internal predecessors, (44), 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-10-11 17:46:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-10-11 17:46:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:46:41,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:41,977 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:41,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:42,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 17:46:42,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash -205921073, now seen corresponding path program 1 times [2024-10-11 17:46:42,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:42,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833438468] [2024-10-11 17:46:42,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:42,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:46:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:42,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:46:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:42,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:42,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833438468] [2024-10-11 17:46:42,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833438468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:42,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332489399] [2024-10-11 17:46:42,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:42,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:42,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:42,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:42,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:46:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:42,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 17:46:42,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:42,690 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-10-11 17:46:42,824 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-10-11 17:46:42,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:46:42,856 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-10-11 17:46:42,867 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:46:42,867 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-10-11 17:46:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-11 17:46:42,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:43,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332489399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:43,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:46:43,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-10-11 17:46:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394065916] [2024-10-11 17:46:43,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:43,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 17:46:43,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:43,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 17:46:43,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=328, Unknown=1, NotChecked=36, Total=420 [2024-10-11 17:46:43,027 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 20 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 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-10-11 17:46:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:43,437 INFO L93 Difference]: Finished difference Result 101 states and 140 transitions. [2024-10-11 17:46:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:46:43,438 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 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 20 [2024-10-11 17:46:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:43,439 INFO L225 Difference]: With dead ends: 101 [2024-10-11 17:46:43,439 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 17:46:43,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=605, Unknown=1, NotChecked=50, Total=756 [2024-10-11 17:46:43,439 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 94 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:43,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 267 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 363 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2024-10-11 17:46:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 17:46:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 49. [2024-10-11 17:46:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.59375) internal successors, (51), 45 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-10-11 17:46:43,448 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 20 [2024-10-11 17:46:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:43,449 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-10-11 17:46:43,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 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-10-11 17:46:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-10-11 17:46:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:46:43,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:43,450 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:43,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:46:43,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 17:46:43,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:43,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash -563748064, now seen corresponding path program 1 times [2024-10-11 17:46:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:43,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28736820] [2024-10-11 17:46:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:43,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:46:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:43,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:46:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:46:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:43,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28736820] [2024-10-11 17:46:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28736820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:43,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:43,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:46:43,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295313752] [2024-10-11 17:46:43,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:43,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:46:43,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:46:43,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:46:43,763 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:46:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:43,849 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-10-11 17:46:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:46:43,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-11 17:46:43,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:43,850 INFO L225 Difference]: With dead ends: 46 [2024-10-11 17:46:43,850 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 17:46:43,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:46:43,851 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:43,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 138 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 17:46:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 17:46:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-10-11 17:46:43,857 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 23 [2024-10-11 17:46:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:43,857 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-11 17:46:43,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:46:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-10-11 17:46:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:46:43,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:43,860 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:43,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:46:43,860 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:43,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash -563748063, now seen corresponding path program 1 times [2024-10-11 17:46:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:43,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799591427] [2024-10-11 17:46:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:43,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:44,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 17:46:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:46:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:46:44,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:44,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799591427] [2024-10-11 17:46:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799591427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:44,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:44,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:46:44,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349215224] [2024-10-11 17:46:44,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:44,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:46:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:44,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:46:44,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:46:44,086 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:46:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:44,220 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-10-11 17:46:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:46:44,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-11 17:46:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:44,221 INFO L225 Difference]: With dead ends: 51 [2024-10-11 17:46:44,221 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 17:46:44,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:46:44,222 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 36 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:44,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 166 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 17:46:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 17:46:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 47 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:46:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-10-11 17:46:44,225 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 23 [2024-10-11 17:46:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:44,226 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-10-11 17:46:44,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:46:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-10-11 17:46:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 17:46:44,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:44,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:44,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:46:44,227 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-10-11 17:46:44,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash -296412805, now seen corresponding path program 1 times [2024-10-11 17:46:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:44,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438906752] [2024-10-11 17:46:44,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:46:44,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:46:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:46:44,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:46:44,280 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:46:44,281 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2024-10-11 17:46:44,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-10-11 17:46:44,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-10-11 17:46:44,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-10-11 17:46:44,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-10-11 17:46:44,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2024-10-11 17:46:44,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2024-10-11 17:46:44,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2024-10-11 17:46:44,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2024-10-11 17:46:44,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2024-10-11 17:46:44,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2024-10-11 17:46:44,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2024-10-11 17:46:44,284 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2024-10-11 17:46:44,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2024-10-11 17:46:44,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2024-10-11 17:46:44,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2024-10-11 17:46:44,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2024-10-11 17:46:44,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2024-10-11 17:46:44,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2024-10-11 17:46:44,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2024-10-11 17:46:44,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2024-10-11 17:46:44,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2024-10-11 17:46:44,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2024-10-11 17:46:44,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:46:44,289 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:44,313 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:46:44,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:46:44 BoogieIcfgContainer [2024-10-11 17:46:44,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:46:44,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:46:44,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:46:44,317 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:46:44,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:46:23" (3/4) ... [2024-10-11 17:46:44,319 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 17:46:44,362 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:46:44,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:46:44,363 INFO L158 Benchmark]: Toolchain (without parser) took 21987.97ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 132.2MB in the beginning and 157.0MB in the end (delta: -24.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-10-11 17:46:44,364 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:46:44,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.24ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 113.0MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 17:46:44,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.78ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:46:44,365 INFO L158 Benchmark]: Boogie Preprocessor took 58.82ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 108.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:46:44,365 INFO L158 Benchmark]: RCFGBuilder took 443.68ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 88.6MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:46:44,365 INFO L158 Benchmark]: TraceAbstraction took 20928.80ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 87.8MB in the beginning and 159.1MB in the end (delta: -71.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:46:44,366 INFO L158 Benchmark]: Witness Printer took 45.36ms. Allocated memory is still 201.3MB. Free memory was 159.1MB in the beginning and 157.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:46:44,367 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.24ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 113.0MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.78ms. Allocated memory is still 167.8MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.82ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 108.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.68ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 88.6MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20928.80ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 87.8MB in the beginning and 159.1MB in the end (delta: -71.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 45.36ms. Allocated memory is still 201.3MB. Free memory was 159.1MB in the beginning and 157.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [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' [L528] return nondetString; [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' [L528] return nondetString; [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: -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. - 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: 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: 545]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 395 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 2168 SdHoareTripleChecker+Invalid, 13.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 250 IncrementalHoareTripleChecker+Unchecked, 1688 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1704 IncrementalHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 480 mSDtfsCounter, 1704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 111 SyntacticMatches, 6 SemanticMatches, 137 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=9, InterpolantAutomatonStates: 89, 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, 12 MinimizatonAttempts, 98 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 279 ConstructedInterpolants, 23 QuantifiedInterpolants, 2348 SizeOfPredicates, 10 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 21 InterpolantComputations, 8 PerfectInterpolantSequences, 42/79 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-10-11 17:46:44,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)