./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.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 60396cce4fa0936fb91e88a54a287214045469c9d9b3d447954681e0a5aabbc0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:46:20,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:46:20,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:46:20,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:46:20,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:46:20,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:46:20,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:46:20,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:46:20,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:46:20,935 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:46:20,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:46:20,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:46:20,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:46:20,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:46:20,936 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:46:20,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:46:20,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:46:20,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:46:20,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:46:20,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:46:20,937 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:46:20,938 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:46:20,939 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:46:20,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:46:20,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:46:20,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:46:20,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:46:20,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:46:20,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:46:20,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:46:20,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:46:20,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:46:20,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:46:20,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:46:20,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:46:20,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:46:20,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:46:20,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:46:20,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:46:20,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:46:20,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:46:20,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:46:20,942 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 -> 60396cce4fa0936fb91e88a54a287214045469c9d9b3d447954681e0a5aabbc0 [2024-10-14 17:46:21,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:46:21,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:46:21,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:46:21,162 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:46:21,162 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:46:21,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2024-10-14 17:46:22,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:46:22,498 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:46:22,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/rec_strlen-alloca-1.i [2024-10-14 17:46:22,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0627b599/c0ec96953ee243d69e21f07c3d85bd73/FLAG47ce067f9 [2024-10-14 17:46:22,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0627b599/c0ec96953ee243d69e21f07c3d85bd73 [2024-10-14 17:46:22,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:46:22,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:46:22,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:46:22,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:46:22,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:46:22,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28363385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22, skipping insertion in model container [2024-10-14 17:46:22,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:46:22,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:46:22,819 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:46:22,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:46:22,882 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:46:22,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22 WrapperNode [2024-10-14 17:46:22,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:46:22,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:46:22,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:46:22,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:46:22,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,917 INFO L138 Inliner]: procedures = 117, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-10-14 17:46:22,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:46:22,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:46:22,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:46:22,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:46:22,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,943 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-14 17:46:22,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:46:22,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:46:22,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:46:22,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:46:22,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (1/1) ... [2024-10-14 17:46:22,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:46:22,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:46:23,007 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-10-14 17:46:23,009 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-10-14 17:46:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:46:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:46:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:46:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:46:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2024-10-14 17:46:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2024-10-14 17:46:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:46:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:46:23,136 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:46:23,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:46:23,247 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-14 17:46:23,250 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:46:23,275 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:46:23,278 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 17:46:23,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:46:23 BoogieIcfgContainer [2024-10-14 17:46:23,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:46:23,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:46:23,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:46:23,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:46:23,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:46:22" (1/3) ... [2024-10-14 17:46:23,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209ac2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:46:23, skipping insertion in model container [2024-10-14 17:46:23,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:46:22" (2/3) ... [2024-10-14 17:46:23,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209ac2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:46:23, skipping insertion in model container [2024-10-14 17:46:23,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:46:23" (3/3) ... [2024-10-14 17:46:23,286 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca-1.i [2024-10-14 17:46:23,299 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:46:23,300 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-14 17:46:23,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:46:23,347 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;@4b504032, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:46:23,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 17:46:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:46:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:46:23,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:23,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:46:23,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:23,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:23,363 INFO L85 PathProgramCache]: Analyzing trace with hash 78657435, now seen corresponding path program 1 times [2024-10-14 17:46:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:23,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596266811] [2024-10-14 17:46:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:23,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:23,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596266811] [2024-10-14 17:46:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596266811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:23,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:23,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:46:23,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857225267] [2024-10-14 17:46:23,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:23,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:46:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:23,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:46:23,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:46:23,592 INFO L87 Difference]: Start difference. First operand has 25 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:23,643 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-14 17:46:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:46:23,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:46:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:23,650 INFO L225 Difference]: With dead ends: 30 [2024-10-14 17:46:23,650 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 17:46:23,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:46:23,661 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:23,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 40 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 17:46:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-10-14 17:46:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:46:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-10-14 17:46:23,721 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 5 [2024-10-14 17:46:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:23,722 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-10-14 17:46:23,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-10-14 17:46:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:46:23,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:23,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:46:23,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:46:23,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:23,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash 78717017, now seen corresponding path program 1 times [2024-10-14 17:46:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:23,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775260614] [2024-10-14 17:46:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:23,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:23,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775260614] [2024-10-14 17:46:23,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775260614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:23,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:23,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:46:23,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099724891] [2024-10-14 17:46:23,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:23,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:46:23,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:23,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:46:23,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:46:23,802 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:23,821 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-10-14 17:46:23,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:46:23,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:46:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:23,822 INFO L225 Difference]: With dead ends: 24 [2024-10-14 17:46:23,822 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 17:46:23,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:46:23,823 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:23,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 29 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 17:46:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 17:46:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:46:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-10-14 17:46:23,828 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 5 [2024-10-14 17:46:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:23,828 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-14 17:46:23,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-10-14 17:46:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:46:23,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:23,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:46:23,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:46:23,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:23,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash 78717018, now seen corresponding path program 1 times [2024-10-14 17:46:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681878671] [2024-10-14 17:46:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:24,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:24,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681878671] [2024-10-14 17:46:24,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681878671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:24,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:24,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:46:24,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925130645] [2024-10-14 17:46:24,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:24,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:46:24,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:24,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:46:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:46:24,003 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:24,046 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2024-10-14 17:46:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:46:24,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:46:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:24,046 INFO L225 Difference]: With dead ends: 26 [2024-10-14 17:46:24,047 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 17:46:24,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:46:24,047 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:24,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 42 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 17:46:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-14 17:46:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:46:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-10-14 17:46:24,051 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 5 [2024-10-14 17:46:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:24,051 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-14 17:46:24,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-10-14 17:46:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:46:24,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:24,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:46:24,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:46:24,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:24,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:24,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1856588455, now seen corresponding path program 1 times [2024-10-14 17:46:24,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:24,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003368606] [2024-10-14 17:46:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:24,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:24,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003368606] [2024-10-14 17:46:24,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003368606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:24,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:24,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:46:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161243459] [2024-10-14 17:46:24,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:24,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:46:24,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:24,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:46:24,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:46:24,160 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:24,202 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-14 17:46:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:46:24,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:46:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:24,204 INFO L225 Difference]: With dead ends: 28 [2024-10-14 17:46:24,204 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 17:46:24,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:46:24,206 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:24,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 17:46:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 17:46:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.4) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:46:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-14 17:46:24,213 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2024-10-14 17:46:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:24,213 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-14 17:46:24,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-14 17:46:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:46:24,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:24,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:46:24,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:46:24,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:24,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1854741413, now seen corresponding path program 1 times [2024-10-14 17:46:24,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:24,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584181399] [2024-10-14 17:46:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:24,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:24,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584181399] [2024-10-14 17:46:24,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584181399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:46:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185310041] [2024-10-14 17:46:24,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:24,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:46:24,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:46:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:46:24,348 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:24,378 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-14 17:46:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:46:24,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:46:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:24,379 INFO L225 Difference]: With dead ends: 30 [2024-10-14 17:46:24,379 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 17:46:24,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:46:24,380 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:24,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 33 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 17:46:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-14 17:46:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.4) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:46:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-14 17:46:24,384 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2024-10-14 17:46:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:24,385 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-14 17:46:24,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-14 17:46:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:46:24,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:24,385 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 17:46:24,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:46:24,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1662324770, now seen corresponding path program 1 times [2024-10-14 17:46:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:24,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239531543] [2024-10-14 17:46:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:24,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:24,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239531543] [2024-10-14 17:46:24,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239531543] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:46:24,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458603581] [2024-10-14 17:46:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:24,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:46:24,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:46:24,581 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-10-14 17:46:24,582 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-10-14 17:46:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:24,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 17:46:24,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:46:24,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-14 17:46:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:24,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:46:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458603581] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:46:24,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:46:24,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2024-10-14 17:46:24,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877772800] [2024-10-14 17:46:24,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:46:24,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:46:24,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:46:24,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:46:24,970 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:25,105 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-10-14 17:46:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:46:25,105 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:46:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:25,106 INFO L225 Difference]: With dead ends: 28 [2024-10-14 17:46:25,106 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 17:46:25,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:46:25,107 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:25,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 103 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:46:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 17:46:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-14 17:46:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:46:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-10-14 17:46:25,110 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2024-10-14 17:46:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:25,110 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-14 17:46:25,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-10-14 17:46:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:46:25,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:25,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:25,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:46:25,314 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-10-14 17:46:25,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting strlen_recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:25,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash 962162715, now seen corresponding path program 1 times [2024-10-14 17:46:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020117355] [2024-10-14 17:46:25,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:25,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020117355] [2024-10-14 17:46:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020117355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:25,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:25,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:46:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23262673] [2024-10-14 17:46:25,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:25,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:46:25,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:25,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:46:25,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:46:25,366 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:25,401 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-14 17:46:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:46:25,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 17:46:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:25,402 INFO L225 Difference]: With dead ends: 25 [2024-10-14 17:46:25,402 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 17:46:25,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:46:25,402 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:25,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 29 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 17:46:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 17:46:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:46:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-14 17:46:25,406 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2024-10-14 17:46:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:25,406 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-14 17:46:25,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-14 17:46:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:46:25,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:25,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:25,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:46:25,408 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting strlen_recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:25,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash 962162716, now seen corresponding path program 1 times [2024-10-14 17:46:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000738990] [2024-10-14 17:46:25,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:25,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:25,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000738990] [2024-10-14 17:46:25,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000738990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:25,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:25,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:46:25,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20785756] [2024-10-14 17:46:25,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:25,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:46:25,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:25,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:46:25,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:46:25,502 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-10-14 17:46:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:25,570 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-10-14 17:46:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:46:25,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-10-14 17:46:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:25,571 INFO L225 Difference]: With dead ends: 33 [2024-10-14 17:46:25,571 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 17:46:25,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:46:25,571 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:25,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 58 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 17:46:25,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-14 17:46:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:46:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-10-14 17:46:25,577 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 9 [2024-10-14 17:46:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:25,577 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-10-14 17:46:25,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-10-14 17:46:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-10-14 17:46:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:46:25,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:25,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:25,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:46:25,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:25,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:25,579 INFO L85 PathProgramCache]: Analyzing trace with hash 7538007, now seen corresponding path program 1 times [2024-10-14 17:46:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:25,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668817470] [2024-10-14 17:46:25,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:25,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668817470] [2024-10-14 17:46:25,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668817470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:25,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:25,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:46:25,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451489525] [2024-10-14 17:46:25,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:25,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:46:25,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:25,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:46:25,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:46:25,755 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:25,774 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-14 17:46:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:46:25,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:46:25,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:25,775 INFO L225 Difference]: With dead ends: 31 [2024-10-14 17:46:25,775 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 17:46:25,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:46:25,776 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:25,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 17:46:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-14 17:46:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:46:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-14 17:46:25,778 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 8 [2024-10-14 17:46:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:25,778 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-14 17:46:25,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-14 17:46:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:46:25,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:25,779 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:25,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:46:25,779 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting strlen_recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:25,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:25,780 INFO L85 PathProgramCache]: Analyzing trace with hash 279221187, now seen corresponding path program 1 times [2024-10-14 17:46:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:25,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226924431] [2024-10-14 17:46:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:25,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:25,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226924431] [2024-10-14 17:46:25,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226924431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:25,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:25,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:46:25,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125340514] [2024-10-14 17:46:25,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:25,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:46:25,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:25,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:46:25,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:46:25,873 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:25,918 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-10-14 17:46:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:46:25,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:46:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:25,919 INFO L225 Difference]: With dead ends: 39 [2024-10-14 17:46:25,919 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 17:46:25,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:46:25,920 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:25,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 17:46:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-10-14 17:46:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 17:46:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-10-14 17:46:25,927 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 13 [2024-10-14 17:46:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:25,927 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-14 17:46:25,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-10-14 17:46:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:46:25,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:25,928 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:25,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:46:25,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting strlen_recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash 537386625, now seen corresponding path program 1 times [2024-10-14 17:46:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391061548] [2024-10-14 17:46:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:26,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:26,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391061548] [2024-10-14 17:46:26,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391061548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:26,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:26,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 17:46:26,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139450125] [2024-10-14 17:46:26,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:26,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 17:46:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:26,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 17:46:26,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:46:26,023 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:26,084 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2024-10-14 17:46:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:46:26,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:46:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:26,086 INFO L225 Difference]: With dead ends: 49 [2024-10-14 17:46:26,087 INFO L226 Difference]: Without dead ends: 49 [2024-10-14 17:46:26,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:46:26,087 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:26,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 85 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-14 17:46:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2024-10-14 17:46:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 17:46:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-14 17:46:26,090 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 13 [2024-10-14 17:46:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:26,090 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-14 17:46:26,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-14 17:46:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:46:26,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:26,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:26,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:46:26,091 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:26,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:26,091 INFO L85 PathProgramCache]: Analyzing trace with hash 64920629, now seen corresponding path program 1 times [2024-10-14 17:46:26,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:26,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057558940] [2024-10-14 17:46:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:26,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:26,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 17:46:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:26,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:26,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057558940] [2024-10-14 17:46:26,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057558940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:46:26,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:46:26,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:46:26,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808092191] [2024-10-14 17:46:26,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:46:26,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:46:26,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:26,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:46:26,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:46:26,144 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:46:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:26,155 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-14 17:46:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:46:26,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-14 17:46:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:26,156 INFO L225 Difference]: With dead ends: 36 [2024-10-14 17:46:26,156 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 17:46:26,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:46:26,157 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:26,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:46:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 17:46:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-10-14 17:46:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-10-14 17:46:26,159 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2024-10-14 17:46:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:26,159 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-10-14 17:46:26,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 17:46:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-10-14 17:46:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:46:26,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:26,159 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:26,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:46:26,160 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting strlen_recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:26,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash 944499205, now seen corresponding path program 1 times [2024-10-14 17:46:26,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:26,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667258416] [2024-10-14 17:46:26,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:26,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667258416] [2024-10-14 17:46:26,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667258416] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:46:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346687771] [2024-10-14 17:46:26,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:26,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:46:26,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:46:26,296 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-10-14 17:46:26,306 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-10-14 17:46:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:26,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 17:46:26,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:46:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:26,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:46:26,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 17:46:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346687771] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:46:26,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:46:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-14 17:46:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963331211] [2024-10-14 17:46:26,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:46:26,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 17:46:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 17:46:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:46:26,581 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:26,684 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-10-14 17:46:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:46:26,684 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:46:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:26,685 INFO L225 Difference]: With dead ends: 23 [2024-10-14 17:46:26,685 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 17:46:26,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-10-14 17:46:26,685 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:26,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 47 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:46:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 17:46:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-10-14 17:46:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-14 17:46:26,688 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2024-10-14 17:46:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:26,689 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-14 17:46:26,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-14 17:46:26,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:46:26,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:26,689 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:26,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:46:26,890 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,SelfDestructingSolverStorable12 [2024-10-14 17:46:26,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting strlen_recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:26,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:26,891 INFO L85 PathProgramCache]: Analyzing trace with hash -58330836, now seen corresponding path program 2 times [2024-10-14 17:46:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:26,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221608648] [2024-10-14 17:46:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:26,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:27,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:27,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221608648] [2024-10-14 17:46:27,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221608648] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:46:27,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306908575] [2024-10-14 17:46:27,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:46:27,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:46:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:46:27,116 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-10-14 17:46:27,118 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-10-14 17:46:27,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:46:27,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:46:27,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 17:46:27,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:46:27,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2024-10-14 17:46:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:27,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:46:27,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-14 17:46:27,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-10-14 17:46:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:27,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306908575] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:46:27,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:46:27,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2024-10-14 17:46:27,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132336589] [2024-10-14 17:46:27,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:46:27,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 17:46:27,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:27,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 17:46:27,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-10-14 17:46:27,377 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 24 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 20 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:27,512 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-10-14 17:46:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 17:46:27,513 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 20 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 17:46:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:27,513 INFO L225 Difference]: With dead ends: 33 [2024-10-14 17:46:27,513 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 17:46:27,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2024-10-14 17:46:27,514 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:27,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 56 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:46:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 17:46:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-10-14 17:46:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-10-14 17:46:27,515 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2024-10-14 17:46:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:27,515 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-14 17:46:27,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 20 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-10-14 17:46:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:46:27,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:27,516 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:27,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 17:46:27,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:46:27,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting strlen_recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:27,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash -49526352, now seen corresponding path program 3 times [2024-10-14 17:46:27,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:27,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972851778] [2024-10-14 17:46:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:27,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:27,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972851778] [2024-10-14 17:46:27,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972851778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:46:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363309735] [2024-10-14 17:46:27,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:46:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:46:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:46:27,947 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-10-14 17:46:27,948 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-10-14 17:46:27,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 17:46:28,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:46:28,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 17:46:28,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:46:28,012 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 1 [2024-10-14 17:46:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:28,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:46:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363309735] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:46:28,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:46:28,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2024-10-14 17:46:28,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322772858] [2024-10-14 17:46:28,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:46:28,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 17:46:28,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:28,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 17:46:28,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 17:46:28,464 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 34 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 25 states have internal predecessors, (50), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:28,704 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-10-14 17:46:28,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 17:46:28,705 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 25 states have internal predecessors, (50), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 17:46:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:28,705 INFO L225 Difference]: With dead ends: 28 [2024-10-14 17:46:28,705 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 17:46:28,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 17:46:28,706 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:28,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 76 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:46:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 17:46:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-14 17:46:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-14 17:46:28,707 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2024-10-14 17:46:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:28,707 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-14 17:46:28,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 25 states have internal predecessors, (50), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-14 17:46:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 17:46:28,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:46:28,708 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:28,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 17:46:28,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 17:46:28,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting strlen_recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-10-14 17:46:28,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:46:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1519877289, now seen corresponding path program 4 times [2024-10-14 17:46:28,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:46:28,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558643044] [2024-10-14 17:46:28,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:46:28,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:46:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:46:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:46:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:46:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558643044] [2024-10-14 17:46:29,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558643044] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:46:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263686604] [2024-10-14 17:46:29,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 17:46:29,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:46:29,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:46:29,142 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-10-14 17:46:29,143 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-10-14 17:46:29,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 17:46:29,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:46:29,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-14 17:46:29,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:46:29,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2024-10-14 17:46:29,822 INFO L349 Elim1Store]: treesize reduction 8, result has 76.5 percent of original size [2024-10-14 17:46:29,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2024-10-14 17:46:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:46:29,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:46:30,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-10-14 17:46:30,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2024-10-14 17:46:30,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 17:46:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:46:30,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263686604] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:46:30,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:46:30,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 46 [2024-10-14 17:46:30,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107002024] [2024-10-14 17:46:30,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:46:30,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-14 17:46:30,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:46:30,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-14 17:46:30,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1875, Unknown=0, NotChecked=0, Total=2070 [2024-10-14 17:46:30,670 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 35 states have internal predecessors, (51), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:46:34,835 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2024-10-14 17:46:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:46:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 35 states have internal predecessors, (51), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-14 17:46:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:46:34,835 INFO L225 Difference]: With dead ends: 44 [2024-10-14 17:46:34,835 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 17:46:34,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=720, Invalid=4682, Unknown=0, NotChecked=0, Total=5402 [2024-10-14 17:46:34,838 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 54 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:46:34,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:46:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 17:46:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 17:46:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 17:46:34,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-10-14 17:46:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:46:34,839 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 17:46:34,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 35 states have internal predecessors, (51), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:46:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 17:46:34,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 17:46:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 7 remaining) [2024-10-14 17:46:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-10-14 17:46:34,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-10-14 17:46:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-10-14 17:46:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-10-14 17:46:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location strlen_recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-10-14 17:46:34,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location strlen_recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2024-10-14 17:46:34,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 17:46:35,043 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,SelfDestructingSolverStorable15 [2024-10-14 17:46:35,046 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:46:35,048 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:46:35,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:46:35 BoogieIcfgContainer [2024-10-14 17:46:35,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:46:35,050 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:46:35,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:46:35,050 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:46:35,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:46:23" (3/4) ... [2024-10-14 17:46:35,052 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:46:35,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure strlen_rec [2024-10-14 17:46:35,057 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 17:46:35,058 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 17:46:35,058 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 17:46:35,058 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 17:46:35,121 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:46:35,122 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:46:35,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:46:35,122 INFO L158 Benchmark]: Toolchain (without parser) took 12600.26ms. Allocated memory was 138.4MB in the beginning and 224.4MB in the end (delta: 86.0MB). Free memory was 66.8MB in the beginning and 113.9MB in the end (delta: -47.0MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-10-14 17:46:35,123 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 138.4MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:46:35,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.13ms. Allocated memory is still 138.4MB. Free memory was 66.5MB in the beginning and 49.0MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 17:46:35,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.50ms. Allocated memory is still 138.4MB. Free memory was 49.0MB in the beginning and 47.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:46:35,123 INFO L158 Benchmark]: Boogie Preprocessor took 37.71ms. Allocated memory is still 138.4MB. Free memory was 47.2MB in the beginning and 45.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:46:35,124 INFO L158 Benchmark]: RCFGBuilder took 321.17ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 45.5MB in the beginning and 141.6MB in the end (delta: -96.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 17:46:35,124 INFO L158 Benchmark]: TraceAbstraction took 11769.30ms. Allocated memory was 182.5MB in the beginning and 224.4MB in the end (delta: 41.9MB). Free memory was 140.5MB in the beginning and 117.8MB in the end (delta: 22.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2024-10-14 17:46:35,124 INFO L158 Benchmark]: Witness Printer took 71.99ms. Allocated memory is still 224.4MB. Free memory was 117.8MB in the beginning and 113.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:46:35,126 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.13ms. Allocated memory is still 138.4MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.13ms. Allocated memory is still 138.4MB. Free memory was 66.5MB in the beginning and 49.0MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.50ms. Allocated memory is still 138.4MB. Free memory was 49.0MB in the beginning and 47.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.71ms. Allocated memory is still 138.4MB. Free memory was 47.2MB in the beginning and 45.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 321.17ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 45.5MB in the beginning and 141.6MB in the end (delta: -96.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11769.30ms. Allocated memory was 182.5MB in the beginning and 224.4MB in the end (delta: 41.9MB). Free memory was 140.5MB in the beginning and 117.8MB in the end (delta: 22.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * Witness Printer took 71.99ms. Allocated memory is still 224.4MB. Free memory was 117.8MB in the beginning and 113.9MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 862 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 635 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1694 IncrementalHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 227 mSDtfsCounter, 1694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=11, InterpolantAutomatonStates: 144, 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, 16 MinimizatonAttempts, 34 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 267 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 328 ConstructedInterpolants, 13 QuantifiedInterpolants, 3209 SizeOfPredicates, 45 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 26 InterpolantComputations, 11 PerfectInterpolantSequences, 47/149 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:46:35,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE