./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-token-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-token-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3438cae56d160b7d84eadaf1a799e28d3e56fe8aa8ad4206f8bf5c7c0818717b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:35:03,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:35:03,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:35:03,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:35:03,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:35:03,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:35:03,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:35:03,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:35:03,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:35:03,548 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:35:03,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:35:03,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:35:03,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:35:03,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:35:03,550 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:35:03,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:35:03,550 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:35:03,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:35:03,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:35:03,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:35:03,550 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:35:03,550 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:35:03,551 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:35:03,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:35:03,551 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:35:03,551 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:35:03,551 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:35:03,551 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:35:03,551 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:35:03,551 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:35:03,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:35:03,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:35:03,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:35:03,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:35:03,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:35:03,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:35:03,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:35:03,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:35:03,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:35:03,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:35:03,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:35:03,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:35:03,552 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3438cae56d160b7d84eadaf1a799e28d3e56fe8aa8ad4206f8bf5c7c0818717b [2025-02-06 10:35:03,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:35:03,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:35:03,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:35:03,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:35:03,795 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:35:03,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-token-2.i [2025-02-06 10:35:04,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d024b68fb/b7735b62f49145cba0208eb78aac770c/FLAGd5b9c5d6d [2025-02-06 10:35:05,302 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:35:05,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-2.i [2025-02-06 10:35:05,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d024b68fb/b7735b62f49145cba0208eb78aac770c/FLAGd5b9c5d6d [2025-02-06 10:35:05,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d024b68fb/b7735b62f49145cba0208eb78aac770c [2025-02-06 10:35:05,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:35:05,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:35:05,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:35:05,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:35:05,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:35:05,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1581076a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05, skipping insertion in model container [2025-02-06 10:35:05,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:35:05,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:35:05,769 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:35:05,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:35:05,812 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:35:05,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05 WrapperNode [2025-02-06 10:35:05,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:35:05,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:35:05,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:35:05,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:35:05,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,836 INFO L138 Inliner]: procedures = 119, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2025-02-06 10:35:05,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:35:05,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:35:05,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:35:05,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:35:05,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,867 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-02-06 10:35:05,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:35:05,881 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:35:05,881 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:35:05,881 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:35:05,887 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (1/1) ... [2025-02-06 10:35:05,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:35:05,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:05,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:35:05,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:35:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 10:35:05,938 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 10:35:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:35:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:35:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:35:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:35:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:35:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:35:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:35:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:35:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:35:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:35:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:35:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:35:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:35:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:35:05,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:35:06,029 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:35:06,031 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:35:06,329 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-02-06 10:35:06,330 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:35:06,337 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:35:06,338 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:35:06,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:06 BoogieIcfgContainer [2025-02-06 10:35:06,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:35:06,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:35:06,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:35:06,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:35:06,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:35:05" (1/3) ... [2025-02-06 10:35:06,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d56a76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:35:06, skipping insertion in model container [2025-02-06 10:35:06,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:35:05" (2/3) ... [2025-02-06 10:35:06,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d56a76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:35:06, skipping insertion in model container [2025-02-06 10:35:06,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:35:06" (3/3) ... [2025-02-06 10:35:06,345 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-token-2.i [2025-02-06 10:35:06,355 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:35:06,356 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-token-2.i that has 2 procedures, 132 locations, 1 initial locations, 9 loop locations, and 49 error locations. [2025-02-06 10:35:06,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:35:06,394 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;@dfdfa10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:35:06,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-02-06 10:35:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 124 states have internal predecessors, (149), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:35:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:35:06,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:06,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:35:06,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:06,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash 186651, now seen corresponding path program 1 times [2025-02-06 10:35:06,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496025053] [2025-02-06 10:35:06,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:06,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:35:06,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:35:06,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:06,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:06,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:06,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496025053] [2025-02-06 10:35:06,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496025053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:06,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:06,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:35:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678668401] [2025-02-06 10:35:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:06,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:35:06,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:06,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:35:06,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:35:06,537 INFO L87 Difference]: Start difference. First operand has 132 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 124 states have internal predecessors, (149), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-02-06 10:35:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:06,627 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2025-02-06 10:35:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:35:06,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-06 10:35:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:06,632 INFO L225 Difference]: With dead ends: 122 [2025-02-06 10:35:06,632 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 10:35:06,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:35:06,635 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 73 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:06,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 119 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 10:35:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 10:35:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.8059701492537314) internal successors, (121), 118 states have internal predecessors, (121), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2025-02-06 10:35:06,659 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 3 [2025-02-06 10:35:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:06,659 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2025-02-06 10:35:06,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-02-06 10:35:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2025-02-06 10:35:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:35:06,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:06,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:35:06,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:35:06,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:06,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:06,661 INFO L85 PathProgramCache]: Analyzing trace with hash 186652, now seen corresponding path program 1 times [2025-02-06 10:35:06,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:06,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554716363] [2025-02-06 10:35:06,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:06,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:06,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:35:06,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:35:06,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:06,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:06,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:06,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554716363] [2025-02-06 10:35:06,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554716363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:06,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:06,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:35:06,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297776293] [2025-02-06 10:35:06,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:06,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:35:06,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:06,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:35:06,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:35:06,732 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-02-06 10:35:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:06,794 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2025-02-06 10:35:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:35:06,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-06 10:35:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:06,796 INFO L225 Difference]: With dead ends: 118 [2025-02-06 10:35:06,796 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 10:35:06,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:35:06,796 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 73 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:06,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 119 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 10:35:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 10:35:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 116 states have internal predecessors, (119), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2025-02-06 10:35:06,801 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 3 [2025-02-06 10:35:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:06,801 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2025-02-06 10:35:06,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2025-02-06 10:35:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2025-02-06 10:35:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:35:06,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:06,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:06,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:35:06,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:06,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash 835785124, now seen corresponding path program 1 times [2025-02-06 10:35:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:06,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668620774] [2025-02-06 10:35:06,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:06,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:35:06,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:35:06,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:06,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:06,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:06,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668620774] [2025-02-06 10:35:06,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668620774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:06,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:06,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:35:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798945159] [2025-02-06 10:35:06,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:06,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:35:06,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:06,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:35:06,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:35:06,859 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:06,984 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2025-02-06 10:35:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:06,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:35:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:06,986 INFO L225 Difference]: With dead ends: 109 [2025-02-06 10:35:06,988 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 10:35:06,988 INFO L434 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 [2025-02-06 10:35:06,989 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:06,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 86 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 10:35:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-06 10:35:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 107 states have internal predecessors, (112), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2025-02-06 10:35:06,999 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 8 [2025-02-06 10:35:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:06,999 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2025-02-06 10:35:06,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-02-06 10:35:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2025-02-06 10:35:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:35:06,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:06,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:07,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:35:07,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:07,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 835785125, now seen corresponding path program 1 times [2025-02-06 10:35:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:07,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640179874] [2025-02-06 10:35:07,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:07,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:07,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:35:07,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:35:07,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:07,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:07,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:07,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640179874] [2025-02-06 10:35:07,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640179874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:07,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:07,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:35:07,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531645100] [2025-02-06 10:35:07,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:07,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:35:07,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:07,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:35:07,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:35:07,164 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:07,320 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2025-02-06 10:35:07,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:07,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:35:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:07,321 INFO L225 Difference]: With dead ends: 149 [2025-02-06 10:35:07,321 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 10:35:07,321 INFO L434 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 [2025-02-06 10:35:07,322 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 128 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:07,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 133 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 10:35:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2025-02-06 10:35:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 105 states have (on average 1.457142857142857) internal successors, (153), 141 states have internal predecessors, (153), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2025-02-06 10:35:07,334 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 8 [2025-02-06 10:35:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:07,334 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2025-02-06 10:35:07,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-02-06 10:35:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2025-02-06 10:35:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:35:07,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:07,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:07,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:35:07,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:07,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:07,335 INFO L85 PathProgramCache]: Analyzing trace with hash -589572464, now seen corresponding path program 1 times [2025-02-06 10:35:07,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:07,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39304803] [2025-02-06 10:35:07,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:07,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:07,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:35:07,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:35:07,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:07,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39304803] [2025-02-06 10:35:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39304803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:07,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:07,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:35:07,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142443918] [2025-02-06 10:35:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:07,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:35:07,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:07,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:35:07,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:35:07,480 INFO L87 Difference]: Start difference. First operand 143 states and 159 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) [2025-02-06 10:35:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:07,633 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2025-02-06 10:35:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:35:07,634 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 [2025-02-06 10:35:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:07,635 INFO L225 Difference]: With dead ends: 142 [2025-02-06 10:35:07,635 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 10:35:07,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:35:07,635 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 39 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:07,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 255 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 10:35:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-02-06 10:35:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 140 states have internal predecessors, (152), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2025-02-06 10:35:07,640 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 12 [2025-02-06 10:35:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:07,641 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2025-02-06 10:35:07,641 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) [2025-02-06 10:35:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2025-02-06 10:35:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:35:07,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:07,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:07,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:35:07,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash -589572463, now seen corresponding path program 1 times [2025-02-06 10:35:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:07,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771940428] [2025-02-06 10:35:07,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:07,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:07,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:35:07,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:35:07,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:07,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:07,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771940428] [2025-02-06 10:35:07,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771940428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:07,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:07,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:35:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406131612] [2025-02-06 10:35:07,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:07,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:35:07,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:07,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:35:07,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:35:07,782 INFO L87 Difference]: Start difference. First operand 142 states and 158 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) [2025-02-06 10:35:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:07,940 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2025-02-06 10:35:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:35:07,940 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 [2025-02-06 10:35:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:07,941 INFO L225 Difference]: With dead ends: 136 [2025-02-06 10:35:07,941 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 10:35:07,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:35:07,942 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 12 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:07,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 341 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 10:35:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2025-02-06 10:35:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 124 states have internal predecessors, (135), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2025-02-06 10:35:07,966 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 12 [2025-02-06 10:35:07,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:07,966 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2025-02-06 10:35:07,966 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) [2025-02-06 10:35:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2025-02-06 10:35:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:35:07,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:07,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:07,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:35:07,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:07,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1748500851, now seen corresponding path program 1 times [2025-02-06 10:35:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:07,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750896363] [2025-02-06 10:35:07,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:07,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:35:07,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:35:07,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:07,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:08,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:08,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750896363] [2025-02-06 10:35:08,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750896363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:08,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:08,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:35:08,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879089670] [2025-02-06 10:35:08,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:08,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:35:08,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:08,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:35:08,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:08,071 INFO L87 Difference]: Start difference. First operand 126 states and 141 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) [2025-02-06 10:35:08,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:08,159 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-02-06 10:35:08,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:08,160 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 [2025-02-06 10:35:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:08,161 INFO L225 Difference]: With dead ends: 125 [2025-02-06 10:35:08,161 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 10:35:08,161 INFO L434 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 [2025-02-06 10:35:08,162 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:08,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 10:35:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-02-06 10:35:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 123 states have internal predecessors, (134), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2025-02-06 10:35:08,170 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 13 [2025-02-06 10:35:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:08,171 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2025-02-06 10:35:08,171 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) [2025-02-06 10:35:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2025-02-06 10:35:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:35:08,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:08,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:08,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:35:08,171 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:08,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:08,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1748500852, now seen corresponding path program 1 times [2025-02-06 10:35:08,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:08,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732989901] [2025-02-06 10:35:08,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:08,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:08,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:35:08,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:35:08,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:08,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732989901] [2025-02-06 10:35:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732989901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:08,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:35:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267812651] [2025-02-06 10:35:08,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:08,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:35:08,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:08,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:35:08,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:08,339 INFO L87 Difference]: Start difference. First operand 125 states and 140 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) [2025-02-06 10:35:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:08,416 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2025-02-06 10:35:08,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:08,416 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 [2025-02-06 10:35:08,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:08,417 INFO L225 Difference]: With dead ends: 124 [2025-02-06 10:35:08,417 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 10:35:08,418 INFO L434 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 [2025-02-06 10:35:08,418 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:08,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 10:35:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-06 10:35:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 95 states have (on average 1.4) internal successors, (133), 122 states have internal predecessors, (133), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2025-02-06 10:35:08,434 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 13 [2025-02-06 10:35:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:08,434 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2025-02-06 10:35:08,434 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) [2025-02-06 10:35:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2025-02-06 10:35:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:35:08,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:08,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:08,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:35:08,435 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:08,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 479335483, now seen corresponding path program 1 times [2025-02-06 10:35:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:08,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071892934] [2025-02-06 10:35:08,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:08,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:35:08,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:35:08,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:08,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071892934] [2025-02-06 10:35:08,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071892934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:08,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:08,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:35:08,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318452047] [2025-02-06 10:35:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:35:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:08,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:35:08,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:35:08,498 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:08,581 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2025-02-06 10:35:08,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:35:08,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:35:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:08,582 INFO L225 Difference]: With dead ends: 133 [2025-02-06 10:35:08,582 INFO L226 Difference]: Without dead ends: 133 [2025-02-06 10:35:08,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:35:08,582 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:08,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 409 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:08,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-06 10:35:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2025-02-06 10:35:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 121 states have internal predecessors, (132), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2025-02-06 10:35:08,585 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 17 [2025-02-06 10:35:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:08,585 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2025-02-06 10:35:08,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2025-02-06 10:35:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:35:08,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:08,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:08,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:35:08,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:08,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:08,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1798092532, now seen corresponding path program 1 times [2025-02-06 10:35:08,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:08,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126062345] [2025-02-06 10:35:08,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:08,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:08,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:35:08,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:35:08,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:08,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:08,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:08,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126062345] [2025-02-06 10:35:08,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126062345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:08,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:08,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:35:08,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198890176] [2025-02-06 10:35:08,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:08,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:35:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:08,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:35:08,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:35:08,620 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:08,683 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2025-02-06 10:35:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:08,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:35:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:08,684 INFO L225 Difference]: With dead ends: 142 [2025-02-06 10:35:08,684 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 10:35:08,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:08,685 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:08,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 150 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 10:35:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2025-02-06 10:35:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 120 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2025-02-06 10:35:08,687 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 19 [2025-02-06 10:35:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:08,687 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2025-02-06 10:35:08,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2025-02-06 10:35:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:35:08,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:08,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:08,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:35:08,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:08,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:08,689 INFO L85 PathProgramCache]: Analyzing trace with hash 209273101, now seen corresponding path program 1 times [2025-02-06 10:35:08,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:08,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273035872] [2025-02-06 10:35:08,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:08,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:08,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:35:08,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:35:08,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:08,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:08,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:08,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273035872] [2025-02-06 10:35:08,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273035872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:08,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:08,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:35:08,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939753583] [2025-02-06 10:35:08,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:08,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:35:08,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:08,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:35:08,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:08,729 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:08,803 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2025-02-06 10:35:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:08,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:35:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:08,804 INFO L225 Difference]: With dead ends: 121 [2025-02-06 10:35:08,804 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 10:35:08,804 INFO L434 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 [2025-02-06 10:35:08,804 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 5 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:08,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 261 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 10:35:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-02-06 10:35:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 119 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2025-02-06 10:35:08,807 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 26 [2025-02-06 10:35:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:08,807 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2025-02-06 10:35:08,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2025-02-06 10:35:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:35:08,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:08,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:08,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:35:08,808 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:08,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash -234491713, now seen corresponding path program 1 times [2025-02-06 10:35:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:08,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181828020] [2025-02-06 10:35:08,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:08,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:35:08,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:35:08,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:08,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:09,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:09,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181828020] [2025-02-06 10:35:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181828020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 10:35:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857936818] [2025-02-06 10:35:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:09,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:35:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:09,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:35:09,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:35:09,298 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:09,658 INFO L93 Difference]: Finished difference Result 238 states and 260 transitions. [2025-02-06 10:35:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:35:09,658 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:35:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:09,661 INFO L225 Difference]: With dead ends: 238 [2025-02-06 10:35:09,661 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 10:35:09,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:35:09,662 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 212 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:09,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 663 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:35:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 10:35:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 139. [2025-02-06 10:35:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 137 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2025-02-06 10:35:09,667 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 26 [2025-02-06 10:35:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:09,667 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2025-02-06 10:35:09,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2025-02-06 10:35:09,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:35:09,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:09,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:09,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:35:09,669 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:09,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:09,670 INFO L85 PathProgramCache]: Analyzing trace with hash -808254323, now seen corresponding path program 1 times [2025-02-06 10:35:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:09,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635044128] [2025-02-06 10:35:09,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:09,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:35:09,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:35:09,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:09,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:09,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:09,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635044128] [2025-02-06 10:35:09,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635044128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:09,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:09,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:35:09,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928572063] [2025-02-06 10:35:09,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:09,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:35:09,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:09,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:35:09,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:35:09,916 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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) [2025-02-06 10:35:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:10,183 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2025-02-06 10:35:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:35:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 28 [2025-02-06 10:35:10,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:10,184 INFO L225 Difference]: With dead ends: 201 [2025-02-06 10:35:10,185 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 10:35:10,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:35:10,186 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 195 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:10,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 344 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:35:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 10:35:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 147. [2025-02-06 10:35:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.3057851239669422) internal successors, (158), 145 states have internal predecessors, (158), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2025-02-06 10:35:10,190 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 28 [2025-02-06 10:35:10,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:10,190 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2025-02-06 10:35:10,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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) [2025-02-06 10:35:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2025-02-06 10:35:10,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:35:10,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:10,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:10,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:35:10,193 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:10,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:10,195 INFO L85 PathProgramCache]: Analyzing trace with hash -808254322, now seen corresponding path program 1 times [2025-02-06 10:35:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:10,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041358785] [2025-02-06 10:35:10,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:10,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:35:10,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:35:10,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:10,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:10,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:10,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041358785] [2025-02-06 10:35:10,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041358785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:10,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:10,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:35:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638014413] [2025-02-06 10:35:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:10,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:35:10,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:10,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:35:10,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:35:10,498 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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) [2025-02-06 10:35:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:10,795 INFO L93 Difference]: Finished difference Result 206 states and 225 transitions. [2025-02-06 10:35:10,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:35:10,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 28 [2025-02-06 10:35:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:10,797 INFO L225 Difference]: With dead ends: 206 [2025-02-06 10:35:10,797 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 10:35:10,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:35:10,798 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 139 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:10,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 392 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:35:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 10:35:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 147. [2025-02-06 10:35:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 145 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2025-02-06 10:35:10,802 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 28 [2025-02-06 10:35:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:10,802 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2025-02-06 10:35:10,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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) [2025-02-06 10:35:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2025-02-06 10:35:10,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:35:10,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:10,803 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:10,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:35:10,804 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 46 more)] === [2025-02-06 10:35:10,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2052010036, now seen corresponding path program 1 times [2025-02-06 10:35:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:10,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303261880] [2025-02-06 10:35:10,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:10,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:10,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:35:10,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:35:10,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:10,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:11,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:11,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303261880] [2025-02-06 10:35:11,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303261880] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:35:11,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001648982] [2025-02-06 10:35:11,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:11,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:11,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:11,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:11,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:35:11,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:35:11,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:35:11,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:11,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:11,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 10:35:11,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:11,207 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:35:11,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:35:11,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:35:11,315 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:35:11,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:35:11,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:35:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:11,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:35:11,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:35:11,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-02-06 10:35:11,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:35:11,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2025-02-06 10:35:11,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-02-06 10:35:13,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:35:13,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 225 treesize of output 1413