./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce305d75684696e5fabb4c8d08830bbd90a67b7669f979309850a29850c4f917 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:10:23,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:10:23,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:10:23,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:10:23,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:10:23,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:10:23,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:10:23,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:10:23,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:10:23,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:10:23,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:10:23,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:10:23,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:10:23,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:10:23,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:10:23,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:10:23,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:10:23,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:10:23,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:10:23,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:10:23,765 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:10:23,765 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:10:23,765 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:10:23,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:10:23,766 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:10:23,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:10:23,767 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:10:23,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:10:23,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:10:23,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:10:23,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:10:23,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:10:23,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:10:23,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:10:23,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:10:23,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:10:23,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:10:23,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:10:23,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:10:23,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:10:23,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:10:23,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:10:23,772 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce305d75684696e5fabb4c8d08830bbd90a67b7669f979309850a29850c4f917 [2024-11-12 13:10:24,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:10:24,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:10:24,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:10:24,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:10:24,068 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:10:24,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i [2024-11-12 13:10:25,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:10:25,775 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:10:25,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk_unsafe.i [2024-11-12 13:10:25,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ad4dee7/7e3189225da449939e8a5d9d3810c8b4/FLAG72613568f [2024-11-12 13:10:26,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ad4dee7/7e3189225da449939e8a5d9d3810c8b4 [2024-11-12 13:10:26,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:10:26,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:10:26,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:10:26,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:10:26,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:10:26,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3ba929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26, skipping insertion in model container [2024-11-12 13:10:26,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:10:26,514 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:10:26,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:10:26,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:10:26,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:10:26,626 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:10:26,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26 WrapperNode [2024-11-12 13:10:26,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:10:26,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:10:26,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:10:26,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:10:26,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,680 INFO L138 Inliner]: procedures = 118, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2024-11-12 13:10:26,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:10:26,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:10:26,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:10:26,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:10:26,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,721 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-12 13:10:26,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:10:26,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:10:26,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:10:26,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:10:26,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (1/1) ... [2024-11-12 13:10:26,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:10:26,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:10:26,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:10:26,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:10:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 13:10:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure build_nondet_String [2024-11-12 13:10:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2024-11-12 13:10:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:10:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:10:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:10:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:10:26,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:10:26,931 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:10:26,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:10:27,216 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-12 13:10:27,216 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:10:27,234 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:10:27,234 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 13:10:27,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:10:27 BoogieIcfgContainer [2024-11-12 13:10:27,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:10:27,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:10:27,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:10:27,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:10:27,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:10:26" (1/3) ... [2024-11-12 13:10:27,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a41f0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:10:27, skipping insertion in model container [2024-11-12 13:10:27,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:26" (2/3) ... [2024-11-12 13:10:27,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a41f0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:10:27, skipping insertion in model container [2024-11-12 13:10:27,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:10:27" (3/3) ... [2024-11-12 13:10:27,262 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk_unsafe.i [2024-11-12 13:10:27,281 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:10:27,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-12 13:10:27,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:10:27,334 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;@d7087f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:10:27,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-12 13:10:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:10:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 13:10:27,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:27,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:27,350 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-11-12 13:10:27,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1099609578, now seen corresponding path program 1 times [2024-11-12 13:10:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:27,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258692607] [2024-11-12 13:10:27,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:27,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:27,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258692607] [2024-11-12 13:10:27,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258692607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:10:27,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:10:27,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:10:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343430190] [2024-11-12 13:10:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:10:27,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:10:27,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:27,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:10:27,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:10:27,687 INFO L87 Difference]: Start difference. First operand has 67 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.75) 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-11-12 13:10:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:27,729 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-12 13:10:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:10:27,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-11-12 13:10:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:27,737 INFO L225 Difference]: With dead ends: 72 [2024-11-12 13:10:27,738 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 13:10:27,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:10:27,742 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:27,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 135 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:10:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 13:10:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-11-12 13:10:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 63 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:10:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-11-12 13:10:27,777 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 8 [2024-11-12 13:10:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:27,778 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-11-12 13:10:27,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:10:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-11-12 13:10:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 13:10:27,778 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:27,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:27,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:10:27,779 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-11-12 13:10:27,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1099549996, now seen corresponding path program 1 times [2024-11-12 13:10:27,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:27,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086492463] [2024-11-12 13:10:27,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:27,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:27,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:27,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086492463] [2024-11-12 13:10:27,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086492463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:10:27,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:10:27,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:10:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147083003] [2024-11-12 13:10:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:10:27,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:10:27,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:27,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:10:27,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:10:27,902 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-11-12 13:10:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:27,963 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2024-11-12 13:10:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:10:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-11-12 13:10:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:27,966 INFO L225 Difference]: With dead ends: 65 [2024-11-12 13:10:27,966 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 13:10:27,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:10:27,967 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:27,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:10:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 13:10:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-12 13:10:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:10:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-12 13:10:27,976 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 8 [2024-11-12 13:10:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:27,976 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-12 13:10:27,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:10:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-12 13:10:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 13:10:27,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:27,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:27,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:10:27,979 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-11-12 13:10:27,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1099549995, now seen corresponding path program 1 times [2024-11-12 13:10:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:27,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695861815] [2024-11-12 13:10:27,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:28,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695861815] [2024-11-12 13:10:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695861815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:10:28,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:10:28,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:10:28,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390129178] [2024-11-12 13:10:28,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:10:28,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:10:28,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:28,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:10:28,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:10:28,205 INFO L87 Difference]: Start difference. First operand 65 states and 71 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-11-12 13:10:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:28,324 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-11-12 13:10:28,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:10:28,325 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-11-12 13:10:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:28,326 INFO L225 Difference]: With dead ends: 69 [2024-11-12 13:10:28,327 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 13:10:28,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:10:28,328 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:28,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 205 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:10:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 13:10:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-11-12 13:10:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.627906976744186) internal successors, (70), 63 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:10:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-11-12 13:10:28,337 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 8 [2024-11-12 13:10:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:28,338 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-11-12 13:10:28,338 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-11-12 13:10:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-11-12 13:10:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 13:10:28,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:28,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:28,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:10:28,339 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-11-12 13:10:28,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash 271839804, now seen corresponding path program 1 times [2024-11-12 13:10:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:28,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451471700] [2024-11-12 13:10:28,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:28,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:28,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:28,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451471700] [2024-11-12 13:10:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451471700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:10:28,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:10:28,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:10:28,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810487402] [2024-11-12 13:10:28,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:10:28,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:10:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:28,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:10:28,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:10:28,509 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:10:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:28,572 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2024-11-12 13:10:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:10:28,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 13:10:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:28,574 INFO L225 Difference]: With dead ends: 69 [2024-11-12 13:10:28,576 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 13:10:28,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:10:28,578 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:28,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:10:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 13:10:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-12 13:10:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.6) internal successors, (72), 65 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:10:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-11-12 13:10:28,589 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 9 [2024-11-12 13:10:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:28,589 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-12 13:10:28,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:10:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-11-12 13:10:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 13:10:28,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:28,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:28,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:10:28,590 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-11-12 13:10:28,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash 273686846, now seen corresponding path program 1 times [2024-11-12 13:10:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136927751] [2024-11-12 13:10:28,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:28,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:28,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136927751] [2024-11-12 13:10:28,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136927751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:10:28,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:10:28,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:10:28,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508051677] [2024-11-12 13:10:28,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:10:28,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:10:28,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:28,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:10:28,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:10:28,835 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:10:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:28,899 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-12 13:10:28,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:10:28,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 13:10:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:28,902 INFO L225 Difference]: With dead ends: 73 [2024-11-12 13:10:28,902 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 13:10:28,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:10:28,903 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 14 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:28,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:10:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 13:10:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2024-11-12 13:10:28,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.6) internal successors, (72), 65 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:10:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-11-12 13:10:28,912 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 9 [2024-11-12 13:10:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:28,912 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-12 13:10:28,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:10:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-11-12 13:10:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:10:28,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:28,915 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:28,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:10:28,916 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-11-12 13:10:28,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:28,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1605600536, now seen corresponding path program 1 times [2024-11-12 13:10:28,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:28,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642469822] [2024-11-12 13:10:28,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:29,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:29,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642469822] [2024-11-12 13:10:29,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642469822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:10:29,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109621163] [2024-11-12 13:10:29,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:29,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:10:29,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:10:29,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:10:29,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 13:10:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:29,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 13:10:29,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:10:29,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 13:10:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:29,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:10:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:29,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109621163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:10:29,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:10:29,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-11-12 13:10:29,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571394411] [2024-11-12 13:10:29,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:10:29,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:10:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:29,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:10:29,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:10:29,762 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:10:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:29,964 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2024-11-12 13:10:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:10:29,964 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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 12 [2024-11-12 13:10:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:29,965 INFO L225 Difference]: With dead ends: 71 [2024-11-12 13:10:29,965 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 13:10:29,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:10:29,966 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:29,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 206 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:10:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 13:10:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-11-12 13:10:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 63 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:10:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-11-12 13:10:29,978 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 12 [2024-11-12 13:10:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:29,978 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-11-12 13:10:29,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:10:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-11-12 13:10:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:10:29,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:29,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:30,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 13:10:30,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 13:10:30,180 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-11-12 13:10:30,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1765992613, now seen corresponding path program 1 times [2024-11-12 13:10:30,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:30,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668930600] [2024-11-12 13:10:30,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:30,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:30,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668930600] [2024-11-12 13:10:30,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668930600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:10:30,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308815504] [2024-11-12 13:10:30,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:30,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:10:30,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:10:30,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:10:30,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 13:10:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:30,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 13:10:30,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:10:30,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-12 13:10:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:30,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:10:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308815504] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 13:10:30,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:10:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 12 [2024-11-12 13:10:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222356284] [2024-11-12 13:10:30,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:10:30,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:10:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:30,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:10:30,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:10:30,722 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:10:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:30,799 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-11-12 13:10:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:10:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-12 13:10:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:30,802 INFO L225 Difference]: With dead ends: 66 [2024-11-12 13:10:30,802 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 13:10:30,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:10:30,803 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:30,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 160 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:10:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 13:10:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-11-12 13:10:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:10:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-11-12 13:10:30,812 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 13 [2024-11-12 13:10:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:30,814 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-11-12 13:10:30,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:10:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2024-11-12 13:10:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:10:30,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:30,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:30,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 13:10:31,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-12 13:10:31,016 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-12 13:10:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1007624645, now seen corresponding path program 1 times [2024-11-12 13:10:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392046462] [2024-11-12 13:10:31,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:10:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 13:10:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:10:31,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:31,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392046462] [2024-11-12 13:10:31,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392046462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:10:31,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871078865] [2024-11-12 13:10:31,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:31,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:10:31,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:10:31,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:10:31,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 13:10:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:31,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 13:10:31,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:10:31,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:10:31,417 WARN L873 $PredicateComparison]: unable to prove that (exists ((build_nondet_String_~nondetString~0.base Int)) (= |c_#valid| (store |c_old(#valid)| build_nondet_String_~nondetString~0.base 1))) is different from true [2024-11-12 13:10:31,445 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:10:31,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-12 13:10:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-12 13:10:31,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:10:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:31,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871078865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:10:31,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:10:31,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 12 [2024-11-12 13:10:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878613595] [2024-11-12 13:10:31,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:10:31,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:10:31,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:31,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:10:31,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-11-12 13:10:31,647 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:10:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:31,896 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2024-11-12 13:10:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:10:31,897 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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 25 [2024-11-12 13:10:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:31,898 INFO L225 Difference]: With dead ends: 62 [2024-11-12 13:10:31,898 INFO L226 Difference]: Without dead ends: 62 [2024-11-12 13:10:31,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=189, Unknown=1, NotChecked=28, Total=272 [2024-11-12 13:10:31,900 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:31,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 246 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2024-11-12 13:10:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-12 13:10:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-11-12 13:10:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 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-11-12 13:10:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-11-12 13:10:31,905 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 25 [2024-11-12 13:10:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:31,907 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-11-12 13:10:31,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:10:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-11-12 13:10:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:10:31,908 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:31,908 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:31,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 13:10:32,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:10:32,109 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-12 13:10:32,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:32,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1007624646, now seen corresponding path program 1 times [2024-11-12 13:10:32,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:32,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822263288] [2024-11-12 13:10:32,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:32,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:10:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:32,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 13:10:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:10:32,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:32,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822263288] [2024-11-12 13:10:32,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822263288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:10:32,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736366249] [2024-11-12 13:10:32,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:32,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:10:32,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:10:32,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:10:32,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 13:10:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:32,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-12 13:10:32,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:10:32,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:10:32,838 WARN L873 $PredicateComparison]: unable to prove that (exists ((build_nondet_String_~nondetString~0.base Int)) (= |c_#length| (store |c_old(#length)| build_nondet_String_~nondetString~0.base 1))) is different from true [2024-11-12 13:10:32,860 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:10:32,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-12 13:10:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-12 13:10:32,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:10:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:10:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736366249] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:10:33,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:10:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2024-11-12 13:10:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884452383] [2024-11-12 13:10:33,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:10:33,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 13:10:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 13:10:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=826, Unknown=1, NotChecked=58, Total=992 [2024-11-12 13:10:33,433 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 32 states, 30 states have (on average 1.9) internal successors, (57), 27 states have internal predecessors, (57), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:10:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:34,371 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2024-11-12 13:10:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 13:10:34,372 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.9) internal successors, (57), 27 states have internal predecessors, (57), 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 25 [2024-11-12 13:10:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:34,374 INFO L225 Difference]: With dead ends: 121 [2024-11-12 13:10:34,374 INFO L226 Difference]: Without dead ends: 121 [2024-11-12 13:10:34,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=228, Invalid=1667, Unknown=1, NotChecked=84, Total=1980 [2024-11-12 13:10:34,376 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 145 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:34,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 618 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 534 Invalid, 0 Unknown, 136 Unchecked, 0.4s Time] [2024-11-12 13:10:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-12 13:10:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2024-11-12 13:10:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.5) internal successors, (99), 80 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:10:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2024-11-12 13:10:34,383 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 25 [2024-11-12 13:10:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:34,383 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2024-11-12 13:10:34,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.9) internal successors, (57), 27 states have internal predecessors, (57), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:10:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2024-11-12 13:10:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:10:34,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:34,384 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:34,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 13:10:34,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:10:34,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-12 13:10:34,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1430326472, now seen corresponding path program 1 times [2024-11-12 13:10:34,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:34,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286915283] [2024-11-12 13:10:34,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:34,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:10:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:34,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 13:10:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:10:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286915283] [2024-11-12 13:10:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286915283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:10:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557870986] [2024-11-12 13:10:35,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:35,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:10:35,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:10:35,007 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:10:35,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 13:10:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:35,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 13:10:35,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:10:35,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:10:35,262 WARN L873 $PredicateComparison]: unable to prove that (exists ((build_nondet_String_~nondetString~0.base Int)) (and (= (store |c_old(#length)| build_nondet_String_~nondetString~0.base (select |c_#length| build_nondet_String_~nondetString~0.base)) |c_#length|) (= (select |c_old(#valid)| build_nondet_String_~nondetString~0.base) 0))) is different from true [2024-11-12 13:10:35,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:10:35,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:10:35,317 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:10:35,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:10:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-12 13:10:35,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:10:35,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557870986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:10:35,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:10:35,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-11-12 13:10:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917201160] [2024-11-12 13:10:35,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:10:35,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:10:35,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:35,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:10:35,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=405, Unknown=1, NotChecked=40, Total=506 [2024-11-12 13:10:35,489 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 22 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:10:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:36,083 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2024-11-12 13:10:36,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:10:36,083 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 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 25 [2024-11-12 13:10:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:36,084 INFO L225 Difference]: With dead ends: 129 [2024-11-12 13:10:36,084 INFO L226 Difference]: Without dead ends: 129 [2024-11-12 13:10:36,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=863, Unknown=1, NotChecked=60, Total=1056 [2024-11-12 13:10:36,086 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 146 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:36,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 407 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 466 Invalid, 0 Unknown, 91 Unchecked, 0.3s Time] [2024-11-12 13:10:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-12 13:10:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 59. [2024-11-12 13:10:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 55 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-11-12 13:10:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-12 13:10:36,098 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 25 [2024-11-12 13:10:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:36,102 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-12 13:10:36,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 13:10:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-12 13:10:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:10:36,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:36,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:36,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 13:10:36,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 13:10:36,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-12 13:10:36,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:36,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2021077003, now seen corresponding path program 1 times [2024-11-12 13:10:36,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:36,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861959201] [2024-11-12 13:10:36,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:10:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:36,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 13:10:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:10:36,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861959201] [2024-11-12 13:10:36,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861959201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:10:36,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:10:36,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:10:36,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196891658] [2024-11-12 13:10:36,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:10:36,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:10:36,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:36,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:10:36,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:10:36,437 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-11-12 13:10:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:36,538 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-12 13:10:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:10:36,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 29 [2024-11-12 13:10:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:36,539 INFO L225 Difference]: With dead ends: 56 [2024-11-12 13:10:36,539 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 13:10:36,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:10:36,540 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:36,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 215 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:10:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 13:10:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 13:10:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.380952380952381) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:10:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-12 13:10:36,544 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 29 [2024-11-12 13:10:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:36,545 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-12 13:10:36,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-11-12 13:10:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-12 13:10:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:10:36,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:36,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:36,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:10:36,548 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-12 13:10:36,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:36,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2021077004, now seen corresponding path program 1 times [2024-11-12 13:10:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:36,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841498449] [2024-11-12 13:10:36,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:36,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:36,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:10:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:36,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 13:10:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:10:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:10:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:10:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841498449] [2024-11-12 13:10:36,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841498449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:10:36,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:10:36,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:10:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113785023] [2024-11-12 13:10:36,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:10:36,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:10:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:10:36,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:10:36,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:10:36,782 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-11-12 13:10:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:10:36,933 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2024-11-12 13:10:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:10:36,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 29 [2024-11-12 13:10:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:10:36,934 INFO L225 Difference]: With dead ends: 67 [2024-11-12 13:10:36,934 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 13:10:36,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:10:36,935 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 53 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:10:36,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 274 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:10:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 13:10:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-11-12 13:10:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:10:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-11-12 13:10:36,938 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 29 [2024-11-12 13:10:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:10:36,939 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-11-12 13:10:36,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-11-12 13:10:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-12 13:10:36,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:10:36,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:10:36,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:36,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:10:36,940 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2024-11-12 13:10:36,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:10:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2021060084, now seen corresponding path program 1 times [2024-11-12 13:10:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:10:36,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10242751] [2024-11-12 13:10:36,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:10:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:10:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 13:10:36,952 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 13:10:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 13:10:36,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 13:10:36,980 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 13:10:36,981 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2024-11-12 13:10:36,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2024-11-12 13:10:36,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2024-11-12 13:10:36,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2024-11-12 13:10:36,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location build_nondet_StringErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2024-11-12 13:10:36,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2024-11-12 13:10:36,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2024-11-12 13:10:36,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2024-11-12 13:10:36,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2024-11-12 13:10:36,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2024-11-12 13:10:36,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2024-11-12 13:10:36,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2024-11-12 13:10:36,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2024-11-12 13:10:36,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2024-11-12 13:10:36,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2024-11-12 13:10:36,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2024-11-12 13:10:36,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 23 remaining) [2024-11-12 13:10:36,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 23 remaining) [2024-11-12 13:10:36,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 23 remaining) [2024-11-12 13:10:36,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 23 remaining) [2024-11-12 13:10:36,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 23 remaining) [2024-11-12 13:10:36,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 23 remaining) [2024-11-12 13:10:36,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (0 of 23 remaining) [2024-11-12 13:10:36,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:10:36,991 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:10:37,027 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 13:10:37,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:10:37 BoogieIcfgContainer [2024-11-12 13:10:37,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 13:10:37,033 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 13:10:37,033 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 13:10:37,033 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 13:10:37,034 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:10:27" (3/4) ... [2024-11-12 13:10:37,035 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 13:10:37,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 13:10:37,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 13:10:37,088 INFO L158 Benchmark]: Toolchain (without parser) took 10963.11ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 101.0MB in the beginning and 183.3MB in the end (delta: -82.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:10:37,089 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:10:37,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.25ms. Allocated memory is still 159.4MB. Free memory was 101.0MB in the beginning and 82.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 13:10:37,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.96ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:10:37,089 INFO L158 Benchmark]: Boogie Preprocessor took 55.78ms. Allocated memory is still 159.4MB. Free memory was 80.0MB in the beginning and 77.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:10:37,089 INFO L158 Benchmark]: RCFGBuilder took 495.37ms. Allocated memory is still 159.4MB. Free memory was 77.5MB in the beginning and 125.9MB in the end (delta: -48.4MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-12 13:10:37,090 INFO L158 Benchmark]: TraceAbstraction took 9780.20ms. Allocated memory is still 218.1MB. Free memory was 186.6MB in the beginning and 185.4MB in the end (delta: 1.2MB). Peak memory consumption was 128.2MB. Max. memory is 16.1GB. [2024-11-12 13:10:37,090 INFO L158 Benchmark]: Witness Printer took 54.95ms. Allocated memory is still 218.1MB. Free memory was 185.4MB in the beginning and 183.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:10:37,091 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.21ms. Allocated memory is still 159.4MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.25ms. Allocated memory is still 159.4MB. Free memory was 101.0MB in the beginning and 82.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.96ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.78ms. Allocated memory is still 159.4MB. Free memory was 80.0MB in the beginning and 77.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 495.37ms. Allocated memory is still 159.4MB. Free memory was 77.5MB in the beginning and 125.9MB in the end (delta: -48.4MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9780.20ms. Allocated memory is still 218.1MB. Free memory was 186.6MB in the beginning and 185.4MB in the end (delta: 1.2MB). Peak memory consumption was 128.2MB. Max. memory is 16.1GB. * Witness Printer took 54.95ms. Allocated memory is still 218.1MB. Free memory was 185.4MB in the beginning and 183.3MB 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' VAL [nondetString={-1:0}] [L528] return nondetString; VAL [\result={-1:0}] [L546] RET, EXPR build_nondet_String() [L546] char* s1 = build_nondet_String(); [L547] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND TRUE length < 1 [L517] length = 1 VAL [length=1] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=1, nondetString={-2:0}] [L521] COND FALSE !(i < length - 1) VAL [length=1, nondetString={-2:0}] [L527] nondetString[length-1] = '\0' VAL [nondetString={-2:0}] [L528] return nondetString; VAL [\result={-2:0}] [L547] RET, EXPR build_nondet_String() VAL [s1={-1:0}] [L547] char* s2 = build_nondet_String(); [L548] CALL cstrpbrk(s1,s2) [L532] const char *sc1; [L533] const char *s; [L534] int c; [L535] sc1 = s1 VAL [s2={-2:0}, sc1={-1:0}] [L535] EXPR \read(*sc1) [L535] COND FALSE !(*sc1 != '\0') [L543] return 0; VAL [\result={0:0}, s2={-2:0}, sc1={-1:0}] [L548] RET cstrpbrk(s1,s2) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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, 67 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 518 mSDsluCounter, 2862 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 287 IncrementalHoareTripleChecker+Unchecked, 2213 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1847 IncrementalHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 649 mSDtfsCounter, 1847 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 150 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=9, InterpolantAutomatonStates: 96, 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, 127 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 354 ConstructedInterpolants, 33 QuantifiedInterpolants, 2935 SizeOfPredicates, 12 NumberOfNonLiveVariables, 468 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 21 InterpolantComputations, 8 PerfectInterpolantSequences, 46/99 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-12 13:10:37,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)