./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strlcpy.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/termination-dietlibc/strlcpy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash c2292e98244edafad4d7dc9607780b552ab07213ed34494d4f4d17ad8279c4d0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:33:01,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:33:01,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-22 18:33:01,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:33:01,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:33:01,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:33:01,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:33:01,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:33:01,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:33:01,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:33:01,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:33:01,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:33:01,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:33:01,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:33:01,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:33:01,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:33:01,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:33:01,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:33:01,509 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:33:01,509 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:33:01,509 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:33:01,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:33:01,512 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:33:01,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:33:01,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:33:01,513 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:33:01,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:33:01,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:33:01,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:33:01,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:33:01,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:33:01,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:33:01,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:33:01,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:33:01,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:33:01,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:33:01,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:33:01,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:33:01,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:33:01,517 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2292e98244edafad4d7dc9607780b552ab07213ed34494d4f4d17ad8279c4d0 [2024-11-22 18:33:01,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:33:01,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:33:01,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:33:01,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:33:01,803 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:33:01,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strlcpy.i [2024-11-22 18:33:03,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:33:03,441 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:33:03,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcpy.i [2024-11-22 18:33:03,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed884d10b/8f14074d8b144a2b9eb0a27357b7b837/FLAG42b96ac65 [2024-11-22 18:33:03,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed884d10b/8f14074d8b144a2b9eb0a27357b7b837 [2024-11-22 18:33:03,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:33:03,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:33:03,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:33:03,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:33:03,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:33:03,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:33:03" (1/1) ... [2024-11-22 18:33:03,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c7f40cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:03, skipping insertion in model container [2024-11-22 18:33:03,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:33:03" (1/1) ... [2024-11-22 18:33:03,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:33:04,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:33:04,207 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:33:04,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:33:04,287 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:33:04,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04 WrapperNode [2024-11-22 18:33:04,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:33:04,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:33:04,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:33:04,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:33:04,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,334 INFO L138 Inliner]: procedures = 113, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92 [2024-11-22 18:33:04,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:33:04,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:33:04,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:33:04,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:33:04,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,365 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [0, 3]. [2024-11-22 18:33:04,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:33:04,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:33:04,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:33:04,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:33:04,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (1/1) ... [2024-11-22 18:33:04,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:33:04,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:33:04,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:33:04,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:33:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 18:33:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 18:33:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:33:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:33:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:33:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:33:04,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:33:04,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:33:04,533 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:33:04,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:33:04,814 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-22 18:33:04,814 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:33:04,847 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:33:04,848 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 18:33:04,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:33:04 BoogieIcfgContainer [2024-11-22 18:33:04,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:33:04,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:33:04,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:33:04,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:33:04,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:33:03" (1/3) ... [2024-11-22 18:33:04,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fefa178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:33:04, skipping insertion in model container [2024-11-22 18:33:04,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:33:04" (2/3) ... [2024-11-22 18:33:04,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fefa178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:33:04, skipping insertion in model container [2024-11-22 18:33:04,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:33:04" (3/3) ... [2024-11-22 18:33:04,860 INFO L112 eAbstractionObserver]: Analyzing ICFG strlcpy.i [2024-11-22 18:33:04,879 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:33:04,879 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-22 18:33:04,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:33:04,922 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;@5f03eddb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:33:04,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-22 18:33:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 35 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 18:33:04,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:04,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 18:33:04,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:04,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:04,936 INFO L85 PathProgramCache]: Analyzing trace with hash 925686, now seen corresponding path program 1 times [2024-11-22 18:33:04,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:04,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822121541] [2024-11-22 18:33:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:04,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:05,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822121541] [2024-11-22 18:33:05,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822121541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:05,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:05,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:33:05,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813366582] [2024-11-22 18:33:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:05,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:33:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:05,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:33:05,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:33:05,121 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 35 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:05,187 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-22 18:33:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:33:05,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-22 18:33:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:05,197 INFO L225 Difference]: With dead ends: 37 [2024-11-22 18:33:05,197 INFO L226 Difference]: Without dead ends: 34 [2024-11-22 18:33:05,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:33:05,203 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-11-22 18:33:05,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-22 18:33:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-22 18:33:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-22 18:33:05,234 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 4 [2024-11-22 18:33:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:05,235 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-22 18:33:05,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-22 18:33:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 18:33:05,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:05,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 18:33:05,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:33:05,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:05,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:05,238 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-22 18:33:05,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:05,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325472561] [2024-11-22 18:33:05,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:05,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325472561] [2024-11-22 18:33:05,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325472561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:05,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:05,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:33:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614157943] [2024-11-22 18:33:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:05,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:33:05,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:05,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:33:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:33:05,369 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:05,405 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-22 18:33:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:33:05,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-22 18:33:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:05,407 INFO L225 Difference]: With dead ends: 33 [2024-11-22 18:33:05,408 INFO L226 Difference]: Without dead ends: 33 [2024-11-22 18:33:05,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:33:05,410 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 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-11-22 18:33:05,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-22 18:33:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-22 18:33:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-22 18:33:05,418 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 4 [2024-11-22 18:33:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:05,418 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-22 18:33:05,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-22 18:33:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 18:33:05,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:05,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 18:33:05,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:33:05,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:05,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:05,422 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2024-11-22 18:33:05,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:05,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888423125] [2024-11-22 18:33:05,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:05,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:05,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:05,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888423125] [2024-11-22 18:33:05,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888423125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:05,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:05,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:33:05,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979413025] [2024-11-22 18:33:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:05,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:33:05,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:05,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:33:05,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:05,661 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:05,704 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-11-22 18:33:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:33:05,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-11-22 18:33:05,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:05,707 INFO L225 Difference]: With dead ends: 32 [2024-11-22 18:33:05,707 INFO L226 Difference]: Without dead ends: 32 [2024-11-22 18:33:05,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:05,709 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:05,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-22 18:33:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-22 18:33:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-22 18:33:05,715 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 4 [2024-11-22 18:33:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:05,717 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-22 18:33:05,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-22 18:33:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:33:05,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:05,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:05,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:33:05,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:05,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:05,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782705, now seen corresponding path program 1 times [2024-11-22 18:33:05,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:05,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357823242] [2024-11-22 18:33:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:05,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:05,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357823242] [2024-11-22 18:33:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357823242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:05,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:05,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:33:05,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66629256] [2024-11-22 18:33:05,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:05,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:33:05,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:05,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:33:05,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:05,837 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:05,883 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-22 18:33:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:33:05,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 18:33:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:05,884 INFO L225 Difference]: With dead ends: 33 [2024-11-22 18:33:05,884 INFO L226 Difference]: Without dead ends: 32 [2024-11-22 18:33:05,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-22 18:33:05,886 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:05,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-22 18:33:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-22 18:33:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-22 18:33:05,892 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2024-11-22 18:33:05,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:05,892 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-22 18:33:05,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-22 18:33:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:33:05,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:05,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:05,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:33:05,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:05,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:05,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1333227602, now seen corresponding path program 1 times [2024-11-22 18:33:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:05,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020375071] [2024-11-22 18:33:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:06,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:06,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020375071] [2024-11-22 18:33:06,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020375071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:06,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:06,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:33:06,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783081046] [2024-11-22 18:33:06,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:06,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:33:06,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:06,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:33:06,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:06,164 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:06,231 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-11-22 18:33:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:33:06,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-22 18:33:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:06,234 INFO L225 Difference]: With dead ends: 41 [2024-11-22 18:33:06,235 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 18:33:06,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:06,236 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:06,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 96 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:33:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 18:33:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2024-11-22 18:33:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.64) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-22 18:33:06,248 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 10 [2024-11-22 18:33:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:06,248 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-22 18:33:06,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-22 18:33:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:33:06,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:06,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:06,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:33:06,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:06,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:06,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1333227601, now seen corresponding path program 1 times [2024-11-22 18:33:06,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:06,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804494553] [2024-11-22 18:33:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:06,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:06,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:06,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804494553] [2024-11-22 18:33:06,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804494553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:06,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:06,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:33:06,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086758013] [2024-11-22 18:33:06,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:06,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:33:06,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:06,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:33:06,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:06,369 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:06,418 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-22 18:33:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:33:06,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-22 18:33:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:06,419 INFO L225 Difference]: With dead ends: 33 [2024-11-22 18:33:06,420 INFO L226 Difference]: Without dead ends: 33 [2024-11-22 18:33:06,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:06,421 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:06,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 45 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-22 18:33:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-22 18:33:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-22 18:33:06,425 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 10 [2024-11-22 18:33:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:06,425 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-22 18:33:06,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-22 18:33:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:33:06,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:06,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:06,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:33:06,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:06,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:06,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1618786096, now seen corresponding path program 1 times [2024-11-22 18:33:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:06,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499094038] [2024-11-22 18:33:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:06,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499094038] [2024-11-22 18:33:06,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499094038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:06,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:06,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:33:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982706619] [2024-11-22 18:33:06,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:06,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:33:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:06,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:33:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:06,561 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:06,598 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-11-22 18:33:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:33:06,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 18:33:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:06,599 INFO L225 Difference]: With dead ends: 39 [2024-11-22 18:33:06,599 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 18:33:06,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-22 18:33:06,601 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:06,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 18:33:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-11-22 18:33:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.52) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-22 18:33:06,607 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2024-11-22 18:33:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:06,608 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-22 18:33:06,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-22 18:33:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:33:06,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:06,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:06,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:33:06,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:06,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:06,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1618786095, now seen corresponding path program 1 times [2024-11-22 18:33:06,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:06,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238769831] [2024-11-22 18:33:06,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:06,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:06,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238769831] [2024-11-22 18:33:06,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238769831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:06,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:06,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:33:06,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485896307] [2024-11-22 18:33:06,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:06,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:33:06,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:06,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:33:06,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:06,803 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:06,849 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-22 18:33:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:33:06,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 18:33:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:06,851 INFO L225 Difference]: With dead ends: 42 [2024-11-22 18:33:06,851 INFO L226 Difference]: Without dead ends: 42 [2024-11-22 18:33:06,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:06,852 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:06,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 94 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-22 18:33:06,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2024-11-22 18:33:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-22 18:33:06,857 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2024-11-22 18:33:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:06,857 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-22 18:33:06,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-22 18:33:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:33:06,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:06,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:06,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:33:06,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:06,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:06,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1619617326, now seen corresponding path program 1 times [2024-11-22 18:33:06,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849602491] [2024-11-22 18:33:06,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:06,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:06,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:06,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849602491] [2024-11-22 18:33:06,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849602491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:06,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:06,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:33:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002648702] [2024-11-22 18:33:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:06,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:33:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:06,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:33:06,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:06,969 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:07,024 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-11-22 18:33:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:33:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 18:33:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:07,029 INFO L225 Difference]: With dead ends: 41 [2024-11-22 18:33:07,031 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 18:33:07,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-22 18:33:07,032 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:07,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 66 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 18:33:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2024-11-22 18:33:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.5) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-22 18:33:07,038 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 11 [2024-11-22 18:33:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:07,038 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-22 18:33:07,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-22 18:33:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:33:07,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:07,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:07,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:33:07,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:07,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:07,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1619617325, now seen corresponding path program 1 times [2024-11-22 18:33:07,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:07,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870383401] [2024-11-22 18:33:07,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:07,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:07,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:07,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870383401] [2024-11-22 18:33:07,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870383401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:07,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:07,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:33:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071040841] [2024-11-22 18:33:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:07,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:33:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:33:07,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:33:07,258 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:07,313 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-22 18:33:07,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:33:07,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 18:33:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:07,315 INFO L225 Difference]: With dead ends: 42 [2024-11-22 18:33:07,315 INFO L226 Difference]: Without dead ends: 42 [2024-11-22 18:33:07,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:33:07,316 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 107 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:07,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 107 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:33:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-22 18:33:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2024-11-22 18:33:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-22 18:33:07,322 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2024-11-22 18:33:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:07,325 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-22 18:33:07,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-22 18:33:07,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:33:07,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:07,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:07,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:33:07,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:07,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1358038030, now seen corresponding path program 1 times [2024-11-22 18:33:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079230851] [2024-11-22 18:33:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:07,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079230851] [2024-11-22 18:33:07,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079230851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:07,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:07,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:33:07,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509343120] [2024-11-22 18:33:07,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:07,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:33:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:07,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:33:07,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:33:07,483 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:07,513 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-22 18:33:07,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:33:07,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-22 18:33:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:07,514 INFO L225 Difference]: With dead ends: 34 [2024-11-22 18:33:07,514 INFO L226 Difference]: Without dead ends: 31 [2024-11-22 18:33:07,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:33:07,515 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 71 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-11-22 18:33:07,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 71 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-22 18:33:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-22 18:33:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-22 18:33:07,518 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 12 [2024-11-22 18:33:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:07,518 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-22 18:33:07,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-22 18:33:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:33:07,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:07,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:07,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:33:07,519 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:07,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1357243700, now seen corresponding path program 1 times [2024-11-22 18:33:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244920809] [2024-11-22 18:33:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:07,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244920809] [2024-11-22 18:33:07,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244920809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:07,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:07,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:33:07,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999687285] [2024-11-22 18:33:07,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:07,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:33:07,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:07,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:33:07,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:07,591 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:07,618 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-22 18:33:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:33:07,619 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-22 18:33:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:07,619 INFO L225 Difference]: With dead ends: 30 [2024-11-22 18:33:07,619 INFO L226 Difference]: Without dead ends: 30 [2024-11-22 18:33:07,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:07,620 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 39 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-11-22 18:33:07,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-22 18:33:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-22 18:33:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-22 18:33:07,625 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 12 [2024-11-22 18:33:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:07,625 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-22 18:33:07,626 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-22 18:33:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:33:07,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:07,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:07,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 18:33:07,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:07,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1357243701, now seen corresponding path program 1 times [2024-11-22 18:33:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:07,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764541817] [2024-11-22 18:33:07,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:07,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:07,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764541817] [2024-11-22 18:33:07,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764541817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:07,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:07,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:33:07,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856543535] [2024-11-22 18:33:07,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:07,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:33:07,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:07,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:33:07,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:07,723 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:07,738 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-22 18:33:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:33:07,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-22 18:33:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:07,739 INFO L225 Difference]: With dead ends: 38 [2024-11-22 18:33:07,739 INFO L226 Difference]: Without dead ends: 36 [2024-11-22 18:33:07,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:07,740 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 84 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-11-22 18:33:07,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 84 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-22 18:33:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-22 18:33:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-22 18:33:07,744 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 12 [2024-11-22 18:33:07,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:07,744 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-22 18:33:07,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-22 18:33:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:33:07,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:07,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:07,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 18:33:07,745 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:07,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:07,746 INFO L85 PathProgramCache]: Analyzing trace with hash -875275854, now seen corresponding path program 1 times [2024-11-22 18:33:07,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:07,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369564816] [2024-11-22 18:33:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:07,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:07,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:07,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369564816] [2024-11-22 18:33:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369564816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:07,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:07,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:33:07,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108262711] [2024-11-22 18:33:07,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:07,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:33:07,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:07,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:33:07,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:07,878 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:07,909 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-22 18:33:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:33:07,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-11-22 18:33:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:07,910 INFO L225 Difference]: With dead ends: 37 [2024-11-22 18:33:07,912 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 18:33:07,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:33:07,913 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:33:07,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 18:33:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-22 18:33:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-22 18:33:07,915 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 13 [2024-11-22 18:33:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:07,915 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-22 18:33:07,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-22 18:33:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 18:33:07,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:07,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:07,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 18:33:07,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:07,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:07,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1813342470, now seen corresponding path program 1 times [2024-11-22 18:33:07,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:07,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159442491] [2024-11-22 18:33:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:07,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:33:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:33:08,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:33:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159442491] [2024-11-22 18:33:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159442491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:33:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:33:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:33:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292596290] [2024-11-22 18:33:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:33:08,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:33:08,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:33:08,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:33:08,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:08,030 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:33:08,043 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-22 18:33:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:33:08,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-22 18:33:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:33:08,044 INFO L225 Difference]: With dead ends: 40 [2024-11-22 18:33:08,045 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 18:33:08,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:33:08,045 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 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-11-22 18:33:08,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:33:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 18:33:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2024-11-22 18:33:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-22 18:33:08,048 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2024-11-22 18:33:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:33:08,048 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-22 18:33:08,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:33:08,049 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-22 18:33:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:33:08,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:33:08,049 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:08,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:33:08,049 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-22 18:33:08,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:33:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash -596495872, now seen corresponding path program 1 times [2024-11-22 18:33:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:33:08,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401023556] [2024-11-22 18:33:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:33:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:33:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:33:08,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 18:33:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:33:08,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 18:33:08,094 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 18:33:08,095 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2024-11-22 18:33:08,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2024-11-22 18:33:08,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2024-11-22 18:33:08,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2024-11-22 18:33:08,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2024-11-22 18:33:08,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2024-11-22 18:33:08,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2024-11-22 18:33:08,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2024-11-22 18:33:08,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2024-11-22 18:33:08,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2024-11-22 18:33:08,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2024-11-22 18:33:08,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 18:33:08,101 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:33:08,120 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 18:33:08,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:33:08 BoogieIcfgContainer [2024-11-22 18:33:08,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 18:33:08,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 18:33:08,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 18:33:08,124 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 18:33:08,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:33:04" (3/4) ... [2024-11-22 18:33:08,125 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 18:33:08,159 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 18:33:08,159 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 18:33:08,160 INFO L158 Benchmark]: Toolchain (without parser) took 4367.01ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 98.3MB in the beginning and 64.5MB in the end (delta: 33.8MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2024-11-22 18:33:08,160 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:33:08,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.22ms. Allocated memory is still 155.2MB. Free memory was 97.9MB in the beginning and 79.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 18:33:08,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.51ms. Allocated memory is still 155.2MB. Free memory was 79.4MB in the beginning and 77.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:33:08,161 INFO L158 Benchmark]: Boogie Preprocessor took 47.70ms. Allocated memory is still 155.2MB. Free memory was 77.2MB in the beginning and 75.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:33:08,161 INFO L158 Benchmark]: RCFGBuilder took 465.84ms. Allocated memory is still 155.2MB. Free memory was 74.8MB in the beginning and 122.1MB in the end (delta: -47.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-22 18:33:08,161 INFO L158 Benchmark]: TraceAbstraction took 3271.56ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 121.3MB in the beginning and 66.6MB in the end (delta: 54.8MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. [2024-11-22 18:33:08,161 INFO L158 Benchmark]: Witness Printer took 35.71ms. Allocated memory is still 211.8MB. Free memory was 66.6MB in the beginning and 64.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:33:08,163 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.20ms. Allocated memory is still 155.2MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.22ms. Allocated memory is still 155.2MB. Free memory was 97.9MB in the beginning and 79.4MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.51ms. Allocated memory is still 155.2MB. Free memory was 79.4MB in the beginning and 77.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.70ms. Allocated memory is still 155.2MB. Free memory was 77.2MB in the beginning and 75.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.84ms. Allocated memory is still 155.2MB. Free memory was 74.8MB in the beginning and 122.1MB in the end (delta: -47.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3271.56ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 121.3MB in the beginning and 66.6MB in the end (delta: 54.8MB). Peak memory consumption was 114.1MB. Max. memory is 16.1GB. * Witness Printer took 35.71ms. Allocated memory is still 211.8MB. Free memory was 66.6MB in the beginning and 64.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L529] int in_len = __VERIFIER_nondet_int(); [L530] COND FALSE !(in_len < 1) [L531] char* in = __builtin_alloca (in_len); VAL [in={3:0}, in_len=1] [L532] in[in_len-1]=0 [L533] int out_len = __VERIFIER_nondet_int(); [L534] COND FALSE !(out_len < 1) [L535] char* out = __builtin_alloca (out_len); [L536] CALL strlcpy(in, out, out_len) [L511] register char *d = dst; [L512] register const char *s = src; [L513] register size_t n = siz; [L514] n != 0 && --n != 0 [L514] EXPR --n [L514] n != 0 && --n != 0 VAL [d={3:0}, n=0, s={2:0}, siz=1] [L514] COND FALSE !(n != 0 && --n != 0) [L520] COND TRUE n == 0 [L521] COND TRUE siz != 0 [L522] *d = '\0' [L523] EXPR s++ VAL [s={2:1}] [L523] EXPR s++ [L523] COND TRUE *s++ [L523] s++ - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 528]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 1092 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 655 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 474 IncrementalHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 437 mSDtfsCounter, 474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=14, InterpolantAutomatonStates: 66, 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, 15 MinimizatonAttempts, 41 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-22 18:33:08,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)