./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-fst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/memsafety-broom/sll-fst-shared.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash b71f005f6b63440309c4e24d3866ac559942cc4e42efba34dd3f9c28733bd7e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:33:19,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:33:19,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 06:33:19,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:33:19,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:33:19,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:33:19,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:33:19,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:33:19,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:33:19,349 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:33:19,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:33:19,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:33:19,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:33:19,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:33:19,350 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:33:19,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:33:19,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:33:19,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:33:19,350 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:33:19,350 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:33:19,350 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:33:19,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:33:19,351 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:33:19,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:33:19,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:33:19,351 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b71f005f6b63440309c4e24d3866ac559942cc4e42efba34dd3f9c28733bd7e5 [2025-02-08 06:33:19,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:33:19,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:33:19,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:33:19,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:33:19,584 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:33:19,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-fst-shared.i [2025-02-08 06:33:20,801 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a241479b6/c970390b45894f29b0de38d693e75509/FLAG3976aafb3 [2025-02-08 06:33:21,082 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:33:21,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-fst-shared.i [2025-02-08 06:33:21,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a241479b6/c970390b45894f29b0de38d693e75509/FLAG3976aafb3 [2025-02-08 06:33:21,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a241479b6/c970390b45894f29b0de38d693e75509 [2025-02-08 06:33:21,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:33:21,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:33:21,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:33:21,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:33:21,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:33:21,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458bfc64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21, skipping insertion in model container [2025-02-08 06:33:21,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:33:21,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:33:21,387 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:33:21,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:33:21,453 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:33:21,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21 WrapperNode [2025-02-08 06:33:21,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:33:21,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:33:21,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:33:21,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:33:21,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,495 INFO L138 Inliner]: procedures = 121, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 67 [2025-02-08 06:33:21,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:33:21,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:33:21,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:33:21,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:33:21,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,521 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2025-02-08 06:33:21,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:33:21,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:33:21,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:33:21,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:33:21,539 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (1/1) ... [2025-02-08 06:33:21,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:33:21,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:21,568 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-08 06:33:21,576 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-08 06:33:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:33:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-02-08 06:33:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-02-08 06:33:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:33:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:33:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:33:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:33:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:33:21,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:33:21,690 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:33:21,692 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:33:21,907 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-02-08 06:33:21,907 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:33:21,914 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:33:21,915 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:33:21,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:33:21 BoogieIcfgContainer [2025-02-08 06:33:21,915 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:33:21,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:33:21,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:33:21,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:33:21,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:33:21" (1/3) ... [2025-02-08 06:33:21,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311ebac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:33:21, skipping insertion in model container [2025-02-08 06:33:21,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:33:21" (2/3) ... [2025-02-08 06:33:21,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311ebac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:33:21, skipping insertion in model container [2025-02-08 06:33:21,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:33:21" (3/3) ... [2025-02-08 06:33:21,922 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-fst-shared.i [2025-02-08 06:33:21,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:33:21,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-fst-shared.i that has 2 procedures, 70 locations, 1 initial locations, 3 loop locations, and 29 error locations. [2025-02-08 06:33:21,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:33:21,974 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;@4ea26d39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:33:21,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-08 06:33:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:33:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:33:21,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:21,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:33:21,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:21,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:21,987 INFO L85 PathProgramCache]: Analyzing trace with hash 3110883, now seen corresponding path program 1 times [2025-02-08 06:33:21,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:21,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136607164] [2025-02-08 06:33:21,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:21,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:22,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:33:22,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:33:22,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:22,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:22,144 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-08 06:33:22,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:22,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136607164] [2025-02-08 06:33:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136607164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:22,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:33:22,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737413276] [2025-02-08 06:33:22,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:22,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:33:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:22,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:33:22,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:33:22,171 INFO L87 Difference]: Start difference. First operand has 70 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-08 06:33:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:22,251 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2025-02-08 06:33:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:33:22,253 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), 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 4 [2025-02-08 06:33:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:22,258 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:33:22,258 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 06:33:22,259 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-08 06:33:22,263 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:22,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 06:33:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-08 06:33:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:33:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2025-02-08 06:33:22,294 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 4 [2025-02-08 06:33:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:22,295 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2025-02-08 06:33:22,295 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), 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-08 06:33:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2025-02-08 06:33:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:33:22,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:22,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:33:22,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:33:22,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:22,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 3110884, now seen corresponding path program 1 times [2025-02-08 06:33:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:22,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000579587] [2025-02-08 06:33:22,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:22,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:33:22,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:33:22,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:22,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:22,386 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-08 06:33:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000579587] [2025-02-08 06:33:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000579587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:22,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:22,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:33:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195649544] [2025-02-08 06:33:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:22,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:33:22,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:22,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:33:22,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:33:22,389 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-08 06:33:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:22,450 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2025-02-08 06:33:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:33:22,450 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), 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 4 [2025-02-08 06:33:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:22,451 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:33:22,451 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 06:33:22,452 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-08 06:33:22,452 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:22,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 06:33:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-08 06:33:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:33:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2025-02-08 06:33:22,457 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 4 [2025-02-08 06:33:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:22,458 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2025-02-08 06:33:22,458 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), 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-08 06:33:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2025-02-08 06:33:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:33:22,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:22,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:22,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:33:22,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:22,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1468895523, now seen corresponding path program 1 times [2025-02-08 06:33:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:22,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460306645] [2025-02-08 06:33:22,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:22,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:33:22,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:33:22,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:22,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:22,526 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-08 06:33:22,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:22,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460306645] [2025-02-08 06:33:22,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460306645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:22,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:22,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:33:22,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962343139] [2025-02-08 06:33:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:22,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:33:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:22,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:33:22,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:33:22,528 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:22,573 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2025-02-08 06:33:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:33:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2025-02-08 06:33:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:22,575 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:33:22,575 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:33:22,575 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-08 06:33:22,576 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:22,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 100 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:33:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:33:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2025-02-08 06:33:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:33:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2025-02-08 06:33:22,587 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 9 [2025-02-08 06:33:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:22,588 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2025-02-08 06:33:22,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2025-02-08 06:33:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:33:22,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:22,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:22,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:33:22,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:22,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1468895524, now seen corresponding path program 1 times [2025-02-08 06:33:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:22,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957494142] [2025-02-08 06:33:22,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:22,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:22,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:33:22,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:33:22,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:22,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:22,692 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-08 06:33:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957494142] [2025-02-08 06:33:22,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957494142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:22,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:22,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:33:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202868972] [2025-02-08 06:33:22,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:22,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:33:22,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:22,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:33:22,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:33:22,693 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:22,724 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2025-02-08 06:33:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:33:22,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2025-02-08 06:33:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:22,725 INFO L225 Difference]: With dead ends: 68 [2025-02-08 06:33:22,725 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 06:33:22,726 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-08 06:33:22,727 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:22,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 105 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:33:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 06:33:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-02-08 06:33:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:33:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2025-02-08 06:33:22,734 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 9 [2025-02-08 06:33:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:22,734 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2025-02-08 06:33:22,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2025-02-08 06:33:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:33:22,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:22,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:22,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:33:22,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:22,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1435641663, now seen corresponding path program 1 times [2025-02-08 06:33:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:22,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130168463] [2025-02-08 06:33:22,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:22,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:22,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:33:22,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:33:22,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:22,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:22,966 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-08 06:33:22,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130168463] [2025-02-08 06:33:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130168463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:33:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328855862] [2025-02-08 06:33:22,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:22,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:33:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:22,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:33:22,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:33:22,967 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:23,081 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-02-08 06:33:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:33:23,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 06:33:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:23,082 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:33:23,082 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 06:33:23,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:33:23,083 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:23,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 06:33:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-02-08 06:33:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.75) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:33:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-02-08 06:33:23,096 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2025-02-08 06:33:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:23,096 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-02-08 06:33:23,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-02-08 06:33:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:33:23,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:23,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:23,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:33:23,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:23,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1435641664, now seen corresponding path program 1 times [2025-02-08 06:33:23,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:23,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885086252] [2025-02-08 06:33:23,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:23,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:33:23,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:33:23,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:23,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:23,202 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-08 06:33:23,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885086252] [2025-02-08 06:33:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885086252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:23,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:23,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:33:23,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055461061] [2025-02-08 06:33:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:23,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:33:23,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:23,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:33:23,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:33:23,206 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:23,297 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2025-02-08 06:33:23,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:33:23,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 06:33:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:23,297 INFO L225 Difference]: With dead ends: 64 [2025-02-08 06:33:23,298 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 06:33:23,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:33:23,298 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 20 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:23,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 176 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 06:33:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2025-02-08 06:33:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:33:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2025-02-08 06:33:23,301 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 11 [2025-02-08 06:33:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:23,301 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2025-02-08 06:33:23,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2025-02-08 06:33:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:33:23,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:23,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:23,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:33:23,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:23,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1311786583, now seen corresponding path program 1 times [2025-02-08 06:33:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:23,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106891017] [2025-02-08 06:33:23,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:23,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:33:23,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:33:23,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:23,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:23,365 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-08 06:33:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:23,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106891017] [2025-02-08 06:33:23,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106891017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:23,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:23,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:33:23,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297833575] [2025-02-08 06:33:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:23,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:33:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:23,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:33:23,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:33:23,368 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:23,446 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2025-02-08 06:33:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:33:23,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-08 06:33:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:23,447 INFO L225 Difference]: With dead ends: 80 [2025-02-08 06:33:23,447 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 06:33:23,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:33:23,448 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 25 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:23,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 147 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 06:33:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2025-02-08 06:33:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.66) internal successors, (83), 69 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2025-02-08 06:33:23,454 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 16 [2025-02-08 06:33:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:23,455 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2025-02-08 06:33:23,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2025-02-08 06:33:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:33:23,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:23,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:23,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:33:23,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:23,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1311786582, now seen corresponding path program 1 times [2025-02-08 06:33:23,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:23,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671118962] [2025-02-08 06:33:23,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:23,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:23,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:33:23,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:33:23,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:23,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:23,604 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-08 06:33:23,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:23,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671118962] [2025-02-08 06:33:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671118962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:33:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860709225] [2025-02-08 06:33:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:23,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:33:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:23,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:33:23,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:33:23,606 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:23,698 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2025-02-08 06:33:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:33:23,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-08 06:33:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:23,699 INFO L225 Difference]: With dead ends: 81 [2025-02-08 06:33:23,699 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 06:33:23,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:33:23,700 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:23,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 295 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 06:33:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-02-08 06:33:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 74 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2025-02-08 06:33:23,703 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 16 [2025-02-08 06:33:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:23,703 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2025-02-08 06:33:23,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2025-02-08 06:33:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:33:23,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:23,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:23,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:33:23,704 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:23,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2010687310, now seen corresponding path program 1 times [2025-02-08 06:33:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:23,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633615033] [2025-02-08 06:33:23,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:23,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:23,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:33:23,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:33:23,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:23,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:23,765 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-08 06:33:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633615033] [2025-02-08 06:33:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633615033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:23,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:23,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:33:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100054382] [2025-02-08 06:33:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:23,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:33:23,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:23,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:33:23,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:33:23,767 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:23,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:23,803 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2025-02-08 06:33:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:33:23,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-02-08 06:33:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:23,805 INFO L225 Difference]: With dead ends: 83 [2025-02-08 06:33:23,805 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 06:33:23,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:33:23,805 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 17 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:23,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 306 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:33:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 06:33:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2025-02-08 06:33:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 75 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2025-02-08 06:33:23,808 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 17 [2025-02-08 06:33:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:23,808 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2025-02-08 06:33:23,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2025-02-08 06:33:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:33:23,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:23,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:23,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:33:23,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:23,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1611085915, now seen corresponding path program 1 times [2025-02-08 06:33:23,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:23,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533366401] [2025-02-08 06:33:23,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:23,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:23,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:33:23,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:33:23,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:23,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:23,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533366401] [2025-02-08 06:33:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533366401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:23,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:23,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:33:23,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595634504] [2025-02-08 06:33:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:23,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:33:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:23,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:33:23,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:33:23,945 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:33:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:24,046 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-02-08 06:33:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:33:24,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-02-08 06:33:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:24,047 INFO L225 Difference]: With dead ends: 80 [2025-02-08 06:33:24,047 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 06:33:24,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:33:24,048 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:24,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 06:33:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-08 06:33:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2025-02-08 06:33:24,056 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 20 [2025-02-08 06:33:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:24,056 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2025-02-08 06:33:24,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:33:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2025-02-08 06:33:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:33:24,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:24,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:24,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:33:24,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:24,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1611085916, now seen corresponding path program 1 times [2025-02-08 06:33:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:24,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685124970] [2025-02-08 06:33:24,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:24,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:24,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:33:24,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:33:24,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:24,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:24,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:24,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685124970] [2025-02-08 06:33:24,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685124970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:24,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583902684] [2025-02-08 06:33:24,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:24,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:24,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:24,249 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-08 06:33:24,250 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-08 06:33:24,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:33:24,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:33:24,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:24,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:24,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 06:33:24,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:24,450 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-02-08 06:33:24,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:33:24,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:33:24,510 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:33:24,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:33:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-08 06:33:24,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:33:24,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583902684] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:24,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:33:24,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-02-08 06:33:24,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894066342] [2025-02-08 06:33:24,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:33:24,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:33:24,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:24,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:33:24,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:33:24,639 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:33:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:24,798 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-02-08 06:33:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:33:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2025-02-08 06:33:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:24,799 INFO L225 Difference]: With dead ends: 82 [2025-02-08 06:33:24,799 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 06:33:24,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=351, Unknown=1, NotChecked=38, Total=462 [2025-02-08 06:33:24,800 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 21 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:24,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 481 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2025-02-08 06:33:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 06:33:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-02-08 06:33:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.5) internal successors, (84), 75 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2025-02-08 06:33:24,803 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 20 [2025-02-08 06:33:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:24,803 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2025-02-08 06:33:24,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:33:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2025-02-08 06:33:24,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:33:24,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:24,804 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] [2025-02-08 06:33:24,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:33:25,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:33:25,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:25,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:25,009 INFO L85 PathProgramCache]: Analyzing trace with hash -388703527, now seen corresponding path program 1 times [2025-02-08 06:33:25,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:25,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060470237] [2025-02-08 06:33:25,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:25,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:25,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:33:25,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:33:25,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:25,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060470237] [2025-02-08 06:33:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060470237] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547880783] [2025-02-08 06:33:25,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:25,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:25,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:25,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:33:25,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:33:25,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:33:25,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:33:25,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:25,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:25,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 06:33:25,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:25,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:33:25,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:33:25,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:33:25,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:33:25,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:33:25,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:33:25,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:33:25,729 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:33:25,729 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2025-02-08 06:33:25,743 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:33:25,744 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2025-02-08 06:33:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:25,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:33:26,184 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_266 (Array Int Int)) (|v_ULTIMATE.start_loop_~x#1.offset_13| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_266))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~sll~0#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_13|) 0) (< |v_ULTIMATE.start_loop_~x#1.offset_13| 0) (< |c_ULTIMATE.start_create_~sll~0#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_13|))) (forall ((v_ArrVal_267 Int) (v_ArrVal_265 (Array Int Int)) (|v_ULTIMATE.start_loop_~x#1.offset_13| Int)) (or (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_265))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 v_ArrVal_267))) |c_ULTIMATE.start_create_~sll~0#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_13|) 0) (< |v_ULTIMATE.start_loop_~x#1.offset_13| 0) (< |c_ULTIMATE.start_create_~sll~0#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_13|))))) is different from false [2025-02-08 06:33:26,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:26,570 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 18 treesize of output 19 [2025-02-08 06:33:26,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:26,578 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 30 treesize of output 30 [2025-02-08 06:33:26,584 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 9 treesize of output 7 [2025-02-08 06:33:26,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:26,613 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 18 treesize of output 19 [2025-02-08 06:33:26,615 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:33:26,621 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 06:33:26,621 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 16 treesize of output 11 [2025-02-08 06:33:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547880783] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:33:26,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:33:26,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-02-08 06:33:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172422750] [2025-02-08 06:33:26,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:33:26,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 06:33:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:26,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 06:33:26,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=576, Unknown=1, NotChecked=48, Total=702 [2025-02-08 06:33:26,659 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:33:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:27,105 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-02-08 06:33:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:33:27,106 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2025-02-08 06:33:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:27,106 INFO L225 Difference]: With dead ends: 82 [2025-02-08 06:33:27,106 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 06:33:27,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=714, Unknown=1, NotChecked=54, Total=870 [2025-02-08 06:33:27,107 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:27,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 813 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 456 Invalid, 0 Unknown, 35 Unchecked, 0.3s Time] [2025-02-08 06:33:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 06:33:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-08 06:33:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 77 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-02-08 06:33:27,112 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 21 [2025-02-08 06:33:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:27,112 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-02-08 06:33:27,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:33:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-02-08 06:33:27,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:33:27,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:27,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:27,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:33:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:27,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:27,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash -399016295, now seen corresponding path program 1 times [2025-02-08 06:33:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18442976] [2025-02-08 06:33:27,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:27,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:33:27,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:33:27,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:27,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:33:27,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:27,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18442976] [2025-02-08 06:33:27,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18442976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:27,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:27,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:33:27,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549955568] [2025-02-08 06:33:27,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:27,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:33:27,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:27,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:33:27,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:33:27,398 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:33:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:27,479 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2025-02-08 06:33:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:33:27,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-08 06:33:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:27,480 INFO L225 Difference]: With dead ends: 81 [2025-02-08 06:33:27,480 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 06:33:27,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:33:27,480 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:27,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 213 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 06:33:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 06:33:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2025-02-08 06:33:27,485 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 23 [2025-02-08 06:33:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:27,486 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2025-02-08 06:33:27,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:33:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2025-02-08 06:33:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:33:27,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:27,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:27,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:33:27,486 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:27,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -399016294, now seen corresponding path program 1 times [2025-02-08 06:33:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455433344] [2025-02-08 06:33:27,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:27,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:33:27,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:33:27,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:27,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:33:27,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:27,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455433344] [2025-02-08 06:33:27,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455433344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:27,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:27,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:33:27,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352439310] [2025-02-08 06:33:27,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:27,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:33:27,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:27,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:33:27,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:33:27,666 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:33:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:27,740 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2025-02-08 06:33:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:33:27,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-08 06:33:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:27,741 INFO L225 Difference]: With dead ends: 80 [2025-02-08 06:33:27,741 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 06:33:27,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:33:27,741 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:27,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 231 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 06:33:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-08 06:33:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-02-08 06:33:27,745 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 23 [2025-02-08 06:33:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:27,745 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-02-08 06:33:27,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:33:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-02-08 06:33:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:33:27,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:27,746 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] [2025-02-08 06:33:27,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:33:27,746 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:27,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:27,746 INFO L85 PathProgramCache]: Analyzing trace with hash 835083650, now seen corresponding path program 1 times [2025-02-08 06:33:27,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:27,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060414498] [2025-02-08 06:33:27,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:27,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:33:27,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:33:27,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:27,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:33:27,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:27,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060414498] [2025-02-08 06:33:27,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060414498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:27,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:33:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581714692] [2025-02-08 06:33:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:27,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:33:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:27,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:33:27,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:33:27,804 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:27,898 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2025-02-08 06:33:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:33:27,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-08 06:33:27,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:27,899 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:33:27,899 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:33:27,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:33:27,900 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:27,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 138 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:33:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2025-02-08 06:33:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.462686567164179) internal successors, (98), 83 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2025-02-08 06:33:27,902 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 22 [2025-02-08 06:33:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:27,902 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2025-02-08 06:33:27,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2025-02-08 06:33:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:33:27,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:27,902 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] [2025-02-08 06:33:27,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:33:27,903 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:27,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash 835083651, now seen corresponding path program 1 times [2025-02-08 06:33:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:27,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125003735] [2025-02-08 06:33:27,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:27,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:33:27,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:33:27,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:27,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:28,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:28,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125003735] [2025-02-08 06:33:28,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125003735] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:28,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701532072] [2025-02-08 06:33:28,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:28,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:28,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:28,036 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:33:28,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:33:28,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:33:28,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:33:28,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:28,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:28,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 06:33:28,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:28,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:33:28,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:28,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-08 06:33:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701532072] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:33:28,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:33:28,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2025-02-08 06:33:28,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495613428] [2025-02-08 06:33:28,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:33:28,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:33:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:28,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:33:28,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:33:28,266 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:33:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:28,425 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2025-02-08 06:33:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:33:28,425 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-02-08 06:33:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:28,426 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:33:28,426 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:33:28,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:33:28,427 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:28,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 404 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:33:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-02-08 06:33:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 91 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2025-02-08 06:33:28,429 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 22 [2025-02-08 06:33:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:28,429 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2025-02-08 06:33:28,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:33:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2025-02-08 06:33:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:33:28,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:28,430 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] [2025-02-08 06:33:28,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:33:28,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:28,634 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:28,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash 117789368, now seen corresponding path program 1 times [2025-02-08 06:33:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722099315] [2025-02-08 06:33:28,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:28,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:33:28,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:33:28,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:28,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:33:28,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:28,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722099315] [2025-02-08 06:33:28,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722099315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:28,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:28,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:33:28,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172362852] [2025-02-08 06:33:28,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:28,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:33:28,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:28,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:33:28,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:33:28,819 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:28,948 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2025-02-08 06:33:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:33:28,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-02-08 06:33:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:28,950 INFO L225 Difference]: With dead ends: 109 [2025-02-08 06:33:28,950 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 06:33:28,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:33:28,950 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:28,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 310 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 06:33:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2025-02-08 06:33:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 94 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2025-02-08 06:33:28,955 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 23 [2025-02-08 06:33:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:28,955 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2025-02-08 06:33:28,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2025-02-08 06:33:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:33:28,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:28,956 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] [2025-02-08 06:33:28,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:33:28,957 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:28,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash 117789753, now seen corresponding path program 1 times [2025-02-08 06:33:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991732203] [2025-02-08 06:33:28,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:28,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:33:28,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:33:28,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:28,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:33:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:29,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991732203] [2025-02-08 06:33:29,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991732203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:29,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:29,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:33:29,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485201877] [2025-02-08 06:33:29,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:29,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:33:29,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:29,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:33:29,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:33:29,027 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:29,071 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-02-08 06:33:29,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:33:29,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-02-08 06:33:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:29,073 INFO L225 Difference]: With dead ends: 99 [2025-02-08 06:33:29,073 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 06:33:29,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:33:29,073 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:29,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 268 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:33:29,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 06:33:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-02-08 06:33:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 92 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-02-08 06:33:29,076 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 23 [2025-02-08 06:33:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:29,076 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-02-08 06:33:29,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-02-08 06:33:29,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:33:29,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:29,077 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] [2025-02-08 06:33:29,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:33:29,077 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:29,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash -643496896, now seen corresponding path program 1 times [2025-02-08 06:33:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:29,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951316430] [2025-02-08 06:33:29,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:29,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:33:29,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:33:29,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:29,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:33:29,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:29,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951316430] [2025-02-08 06:33:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951316430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:29,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:33:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934419266] [2025-02-08 06:33:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:29,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:33:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:29,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:33:29,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:33:29,277 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:29,455 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2025-02-08 06:33:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:33:29,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-08 06:33:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:29,456 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:33:29,456 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:33:29,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:33:29,457 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:29,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 274 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:33:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2025-02-08 06:33:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.358974358974359) internal successors, (106), 93 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2025-02-08 06:33:29,459 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 24 [2025-02-08 06:33:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:29,459 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2025-02-08 06:33:29,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2025-02-08 06:33:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:33:29,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:29,460 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] [2025-02-08 06:33:29,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:33:29,460 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:29,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1526432694, now seen corresponding path program 1 times [2025-02-08 06:33:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:29,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664901366] [2025-02-08 06:33:29,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:29,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:33:29,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:33:29,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:29,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:33:29,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:29,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664901366] [2025-02-08 06:33:29,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664901366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:29,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:29,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:33:29,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621543626] [2025-02-08 06:33:29,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:29,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:33:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:29,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:33:29,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:33:29,640 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:29,771 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2025-02-08 06:33:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:33:29,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-08 06:33:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:29,772 INFO L225 Difference]: With dead ends: 99 [2025-02-08 06:33:29,772 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 06:33:29,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:33:29,772 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:29,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 334 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 06:33:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 06:33:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 94 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2025-02-08 06:33:29,775 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 25 [2025-02-08 06:33:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:29,775 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2025-02-08 06:33:29,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2025-02-08 06:33:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:33:29,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:29,775 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] [2025-02-08 06:33:29,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:33:29,776 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:29,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1976996653, now seen corresponding path program 1 times [2025-02-08 06:33:29,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:29,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580337471] [2025-02-08 06:33:29,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:29,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:33:29,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:33:29,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:29,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:33:30,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:30,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580337471] [2025-02-08 06:33:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580337471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:30,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 06:33:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101096654] [2025-02-08 06:33:30,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:30,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:33:30,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:30,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:33:30,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:33:30,080 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:30,249 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2025-02-08 06:33:30,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:33:30,249 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-08 06:33:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:30,250 INFO L225 Difference]: With dead ends: 103 [2025-02-08 06:33:30,250 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 06:33:30,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:33:30,251 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:30,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 212 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 06:33:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-02-08 06:33:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.345679012345679) internal successors, (109), 96 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2025-02-08 06:33:30,254 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 27 [2025-02-08 06:33:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:30,254 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2025-02-08 06:33:30,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2025-02-08 06:33:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:33:30,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:30,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:30,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:33:30,255 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:30,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1353836468, now seen corresponding path program 1 times [2025-02-08 06:33:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:30,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949257958] [2025-02-08 06:33:30,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:30,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:33:30,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:33:30,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:30,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:30,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:30,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949257958] [2025-02-08 06:33:30,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949257958] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:30,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797380787] [2025-02-08 06:33:30,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:30,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:30,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:30,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:33:30,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:33:30,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:33:30,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:33:30,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:30,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:30,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 06:33:30,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:30,792 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:33:30,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:33:30,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:33:30,824 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-08 06:33:30,862 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 8 treesize of output 4 [2025-02-08 06:33:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:30,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:33:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797380787] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:31,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:33:31,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2025-02-08 06:33:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142221432] [2025-02-08 06:33:31,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:33:31,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:33:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:31,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:33:31,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-02-08 06:33:31,038 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:33:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:31,245 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-02-08 06:33:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:33:31,249 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2025-02-08 06:33:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:31,250 INFO L225 Difference]: With dead ends: 102 [2025-02-08 06:33:31,250 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 06:33:31,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:33:31,251 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:31,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 466 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:31,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 06:33:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-02-08 06:33:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 96 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-02-08 06:33:31,254 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 31 [2025-02-08 06:33:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:31,254 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-02-08 06:33:31,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:33:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-02-08 06:33:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:33:31,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:31,255 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, 1, 1] [2025-02-08 06:33:31,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:33:31,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-08 06:33:31,456 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:31,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 179225564, now seen corresponding path program 1 times [2025-02-08 06:33:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:31,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268513848] [2025-02-08 06:33:31,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:31,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:33:31,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:33:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:31,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:33:31,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268513848] [2025-02-08 06:33:31,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268513848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:33:31,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:33:31,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:33:31,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117258923] [2025-02-08 06:33:31,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:33:31,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:33:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:31,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:33:31,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:33:31,524 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:31,583 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-02-08 06:33:31,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:33:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-02-08 06:33:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:31,584 INFO L225 Difference]: With dead ends: 102 [2025-02-08 06:33:31,584 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 06:33:31,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:33:31,585 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:31,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 238 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:33:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 06:33:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-08 06:33:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.329268292682927) internal successors, (109), 97 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-02-08 06:33:31,587 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 30 [2025-02-08 06:33:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:31,587 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-02-08 06:33:31,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-02-08 06:33:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:33:31,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:31,587 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:31,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 06:33:31,587 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:31,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1185894757, now seen corresponding path program 1 times [2025-02-08 06:33:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:31,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564129730] [2025-02-08 06:33:31,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:31,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:33:31,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:33:31,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:31,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:33:31,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:31,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564129730] [2025-02-08 06:33:31,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564129730] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:31,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197778874] [2025-02-08 06:33:31,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:31,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:31,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:31,839 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:33:31,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:33:31,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:33:31,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:33:31,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:31,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:31,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 06:33:31,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:31,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:33:31,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:33:31,980 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-08 06:33:32,019 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:33:32,020 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-08 06:33:32,027 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-08 06:33:32,038 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-02-08 06:33:32,059 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:33:32,059 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 19 treesize of output 16 [2025-02-08 06:33:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2025-02-08 06:33:32,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:33:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197778874] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:32,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:33:32,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2025-02-08 06:33:32,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741477167] [2025-02-08 06:33:32,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:33:32,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:33:32,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:32,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:33:32,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2025-02-08 06:33:32,103 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 06:33:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:32,306 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2025-02-08 06:33:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:33:32,307 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-02-08 06:33:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:32,307 INFO L225 Difference]: With dead ends: 101 [2025-02-08 06:33:32,307 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 06:33:32,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=517, Unknown=1, NotChecked=46, Total=650 [2025-02-08 06:33:32,308 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:32,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 436 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2025-02-08 06:33:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 06:33:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-08 06:33:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 96 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2025-02-08 06:33:32,310 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 35 [2025-02-08 06:33:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:32,310 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2025-02-08 06:33:32,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 06:33:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2025-02-08 06:33:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:33:32,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:32,311 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:33:32,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:33:32,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 06:33:32,512 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:32,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1185894758, now seen corresponding path program 1 times [2025-02-08 06:33:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:32,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271375511] [2025-02-08 06:33:32,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:32,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:32,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:33:32,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:33:32,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:32,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:32,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:32,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271375511] [2025-02-08 06:33:32,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271375511] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:32,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188900754] [2025-02-08 06:33:32,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:32,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:32,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:32,906 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:33:32,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:33:32,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:33:32,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:33:32,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:32,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:33,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-08 06:33:33,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:33,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:33:33,066 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:33:33,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:33:33,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:33:33,094 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-08 06:33:33,155 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:33:33,156 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 59 treesize of output 52 [2025-02-08 06:33:33,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:33:33,196 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 34 treesize of output 18 [2025-02-08 06:33:33,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:33:33,259 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-02-08 06:33:33,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:33:33,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:33:33,283 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:33:33,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:33:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-08 06:33:33,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:33:33,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188900754] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:33,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:33:33,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2025-02-08 06:33:33,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379343070] [2025-02-08 06:33:33,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:33:33,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 06:33:33,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:33,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 06:33:33,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=676, Unknown=1, NotChecked=52, Total=812 [2025-02-08 06:33:33,382 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:33:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:33,753 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2025-02-08 06:33:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:33:33,754 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2025-02-08 06:33:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:33,754 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:33:33,754 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:33:33,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=1042, Unknown=1, NotChecked=66, Total=1260 [2025-02-08 06:33:33,755 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:33,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 502 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 439 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2025-02-08 06:33:33,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:33:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:33:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 93 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-02-08 06:33:33,757 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 35 [2025-02-08 06:33:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:33,757 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-02-08 06:33:33,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:33:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-02-08 06:33:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:33:33,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:33,757 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, 1, 1, 1, 1, 1] [2025-02-08 06:33:33,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 06:33:33,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 06:33:33,961 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:33,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash 664407660, now seen corresponding path program 1 times [2025-02-08 06:33:33,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:33,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197453356] [2025-02-08 06:33:33,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:33,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:33,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:33:33,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:33:33,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:33,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:34,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197453356] [2025-02-08 06:33:34,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197453356] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064571599] [2025-02-08 06:33:34,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:34,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:34,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:34,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:33:34,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:33:34,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:33:34,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:33:34,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:34,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:34,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 06:33:34,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:34,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:34,301 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 15 treesize of output 15 [2025-02-08 06:33:34,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:34,307 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 15 treesize of output 15 [2025-02-08 06:33:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:34,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:33:34,516 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-08 06:33:34,516 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 24 treesize of output 23 [2025-02-08 06:33:34,523 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-02-08 06:33:34,523 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 20 treesize of output 12 [2025-02-08 06:33:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:34,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064571599] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:33:34,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:33:34,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 24 [2025-02-08 06:33:34,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657175195] [2025-02-08 06:33:34,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:33:34,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:33:34,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:34,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:33:34,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:33:34,621 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:33:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:34,990 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2025-02-08 06:33:34,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:33:34,991 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-02-08 06:33:34,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:34,995 INFO L225 Difference]: With dead ends: 125 [2025-02-08 06:33:34,995 INFO L226 Difference]: Without dead ends: 125 [2025-02-08 06:33:34,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:33:34,996 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:34,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 547 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:33:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-08 06:33:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2025-02-08 06:33:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 100 states have (on average 1.3) internal successors, (130), 111 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions. [2025-02-08 06:33:34,999 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 33 [2025-02-08 06:33:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:34,999 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 136 transitions. [2025-02-08 06:33:34,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:33:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions. [2025-02-08 06:33:34,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:33:34,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:34,999 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, 1, 1, 1, 1, 1] [2025-02-08 06:33:35,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 06:33:35,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:35,200 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:35,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash 664407309, now seen corresponding path program 1 times [2025-02-08 06:33:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:35,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607370771] [2025-02-08 06:33:35,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:35,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:35,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:33:35,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:33:35,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:35,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:33:35,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:35,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607370771] [2025-02-08 06:33:35,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607370771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:35,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912351976] [2025-02-08 06:33:35,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:35,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:35,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:35,578 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:33:35,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:33:35,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:33:35,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:33:35,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:35,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:35,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-08 06:33:35,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:35,717 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:33:35,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2025-02-08 06:33:35,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:33:35,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:35,822 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 23 treesize of output 21 [2025-02-08 06:33:35,876 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-02-08 06:33:35,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 87 [2025-02-08 06:33:36,039 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_#t~mem13#1.base_11| Int) (v_arrayElimCell_46 Int) (v_DerPreprocessor_1 Int)) (and (= (store (store |c_#valid| |v_ULTIMATE.start_destroy_#t~mem13#1.base_11| 0) |c_ULTIMATE.start_destroy_~l#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= 0 (select |c_#valid| |v_ULTIMATE.start_destroy_#t~mem13#1.base_11|)) (= v_DerPreprocessor_1 (select (store (store (store |c_#valid| |v_ULTIMATE.start_destroy_#t~mem13#1.base_11| v_DerPreprocessor_1) v_arrayElimCell_46 0) |c_ULTIMATE.start_destroy_~l#1.base| 0) |v_ULTIMATE.start_destroy_#t~mem13#1.base_11|)))) is different from true [2025-02-08 06:33:36,060 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-02-08 06:33:36,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 75 [2025-02-08 06:33:36,072 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_#t~mem13#1.base_11| Int) (|v_ULTIMATE.start_destroy_~l#1.base_22| Int)) (and (= 0 (select |c_#valid| |v_ULTIMATE.start_destroy_#t~mem13#1.base_11|)) (= (store (store |c_#valid| |v_ULTIMATE.start_destroy_#t~mem13#1.base_11| 0) |v_ULTIMATE.start_destroy_~l#1.base_22| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= (select |c_#valid| |v_ULTIMATE.start_destroy_~l#1.base_22|) 0))) is different from true [2025-02-08 06:33:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-02-08 06:33:36,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:33:36,196 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 48 treesize of output 44 [2025-02-08 06:33:39,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912351976] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:39,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:33:39,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2025-02-08 06:33:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008183665] [2025-02-08 06:33:39,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:33:39,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 06:33:39,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:39,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 06:33:39,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=636, Unknown=2, NotChecked=102, Total=812 [2025-02-08 06:33:39,038 INFO L87 Difference]: Start difference. First operand 116 states and 136 transitions. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 19 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:43,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 06:33:48,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 06:33:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:48,747 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2025-02-08 06:33:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:33:48,747 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 19 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-02-08 06:33:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:48,747 INFO L225 Difference]: With dead ends: 122 [2025-02-08 06:33:48,747 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 06:33:48,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=131, Invalid=1065, Unknown=2, NotChecked=134, Total=1332 [2025-02-08 06:33:48,748 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:48,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 342 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 562 Invalid, 3 Unknown, 152 Unchecked, 9.3s Time] [2025-02-08 06:33:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 06:33:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-08 06:33:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 97 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2025-02-08 06:33:48,750 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 33 [2025-02-08 06:33:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:48,750 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2025-02-08 06:33:48,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 19 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:33:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2025-02-08 06:33:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:33:48,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:48,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-08 06:33:48,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:33:48,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-08 06:33:48,955 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:48,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash -684727537, now seen corresponding path program 1 times [2025-02-08 06:33:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:48,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610325311] [2025-02-08 06:33:48,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:48,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:48,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:33:48,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:33:48,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:48,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610325311] [2025-02-08 06:33:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610325311] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069136171] [2025-02-08 06:33:49,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:49,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:49,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:49,209 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:33:49,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:33:49,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:33:49,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:33:49,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:49,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:49,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 06:33:49,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:49,398 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:33:49,399 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-08 06:33:49,434 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-08 06:33:49,493 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:33:49,493 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-08 06:33:49,566 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-08 06:33:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:49,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:33:49,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1042) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|)) 1)) is different from false [2025-02-08 06:33:49,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:49,677 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-08 06:33:49,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:49,684 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-08 06:33:49,687 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 7 treesize of output 5 [2025-02-08 06:33:53,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069136171] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:53,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:33:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2025-02-08 06:33:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836126167] [2025-02-08 06:33:53,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:33:53,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 06:33:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:53,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 06:33:53,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=655, Unknown=12, NotChecked=52, Total=812 [2025-02-08 06:33:53,819 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 22 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:33:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:54,064 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2025-02-08 06:33:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:33:54,064 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 22 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-02-08 06:33:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:54,065 INFO L225 Difference]: With dead ends: 106 [2025-02-08 06:33:54,065 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 06:33:54,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=106, Invalid=698, Unknown=12, NotChecked=54, Total=870 [2025-02-08 06:33:54,065 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:54,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 387 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:33:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 06:33:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2025-02-08 06:33:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 98 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2025-02-08 06:33:54,068 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 36 [2025-02-08 06:33:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:54,068 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2025-02-08 06:33:54,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 22 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:33:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2025-02-08 06:33:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:33:54,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:54,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-08 06:33:54,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:33:54,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:54,273 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:54,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash -684727536, now seen corresponding path program 1 times [2025-02-08 06:33:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:54,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498249872] [2025-02-08 06:33:54,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:54,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:33:54,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:33:54,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:54,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:54,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:54,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498249872] [2025-02-08 06:33:54,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498249872] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:54,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745776810] [2025-02-08 06:33:54,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:54,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:54,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:54,596 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:33:54,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:33:54,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:33:54,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:33:54,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:54,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:54,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 06:33:54,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:54,766 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:33:54,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:33:54,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:33:54,802 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-08 06:33:54,857 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:33:54,857 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 56 treesize of output 51 [2025-02-08 06:33:54,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2025-02-08 06:33:54,944 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 31 treesize of output 19 [2025-02-08 06:33:54,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-08 06:33:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:54,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:33:55,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:55,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2025-02-08 06:33:55,115 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_16 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_prenex_16) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) (+ |c_ULTIMATE.start_create_#t~mem9#1.offset| 1))) (forall ((v_ArrVal_1132 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1132) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|)))) (forall ((v_ArrVal_1131 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1131) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|)))) is different from false [2025-02-08 06:33:55,128 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_prenex_16 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_prenex_16) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) 1))) (forall ((v_ArrVal_1132 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1132) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) 8))) (forall ((v_ArrVal_1131 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1131) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) .cse0)))) is different from false [2025-02-08 06:33:55,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:55,142 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 59 treesize of output 52 [2025-02-08 06:33:55,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:55,147 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 45 treesize of output 46 [2025-02-08 06:33:55,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:55,154 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 75 treesize of output 66 [2025-02-08 06:33:55,158 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 51 treesize of output 49 [2025-02-08 06:33:55,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:33:55,167 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 70 treesize of output 73 [2025-02-08 06:33:55,171 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 57 treesize of output 55 [2025-02-08 06:33:55,176 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 55 treesize of output 53 [2025-02-08 06:33:55,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745776810] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:55,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:33:55,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2025-02-08 06:33:55,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425618893] [2025-02-08 06:33:55,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:33:55,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:33:55,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:33:55,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:33:55,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=781, Unknown=2, NotChecked=114, Total=992 [2025-02-08 06:33:55,288 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:33:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:33:55,601 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2025-02-08 06:33:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:33:55,602 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-02-08 06:33:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:33:55,602 INFO L225 Difference]: With dead ends: 106 [2025-02-08 06:33:55,602 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 06:33:55,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=995, Unknown=2, NotChecked=130, Total=1260 [2025-02-08 06:33:55,603 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:33:55,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 615 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:33:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 06:33:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-08 06:33:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 100 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:33:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2025-02-08 06:33:55,605 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 36 [2025-02-08 06:33:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:33:55,605 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2025-02-08 06:33:55,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:33:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2025-02-08 06:33:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:33:55,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:33:55,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1] [2025-02-08 06:33:55,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 06:33:55,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 06:33:55,810 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:33:55,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:33:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash -893442706, now seen corresponding path program 1 times [2025-02-08 06:33:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:33:55,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427169014] [2025-02-08 06:33:55,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:33:55,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:33:55,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:33:55,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:55,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:56,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:33:56,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427169014] [2025-02-08 06:33:56,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427169014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:33:56,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536382884] [2025-02-08 06:33:56,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:33:56,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:33:56,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:33:56,044 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:33:56,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:33:56,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:33:56,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:33:56,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:33:56,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:33:56,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-08 06:33:56,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:33:56,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:33:56,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:33:56,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-08 06:33:56,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:33:56,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:33:56,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:33:56,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2025-02-08 06:33:56,448 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 24 treesize of output 12 [2025-02-08 06:33:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:33:56,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:34:00,577 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 178 treesize of output 170 [2025-02-08 06:34:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536382884] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:34:00,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:34:00,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2025-02-08 06:34:00,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701488965] [2025-02-08 06:34:00,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:34:00,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:34:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:00,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:34:00,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=948, Unknown=1, NotChecked=0, Total=1056 [2025-02-08 06:34:00,717 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 25 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:34:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:00,981 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2025-02-08 06:34:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:34:00,982 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 25 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2025-02-08 06:34:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:00,982 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:34:00,983 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:34:00,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=147, Invalid=1184, Unknown=1, NotChecked=0, Total=1332 [2025-02-08 06:34:00,983 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:00,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 817 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:34:00,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:34:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-02-08 06:34:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 98 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:34:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2025-02-08 06:34:00,985 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 38 [2025-02-08 06:34:00,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:00,985 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2025-02-08 06:34:00,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 25 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:34:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2025-02-08 06:34:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:34:00,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:00,986 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:00,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 06:34:01,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:34:01,186 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 26 more)] === [2025-02-08 06:34:01,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:01,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1003183821, now seen corresponding path program 2 times [2025-02-08 06:34:01,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:01,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047354626] [2025-02-08 06:34:01,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:34:01,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:01,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-08 06:34:01,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:34:01,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:34:01,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:01,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047354626] [2025-02-08 06:34:01,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047354626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:34:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704719494] [2025-02-08 06:34:01,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:34:01,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:34:01,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:34:01,755 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:34:01,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:34:01,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-08 06:34:01,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:34:01,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:34:01,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:01,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-08 06:34:01,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:34:01,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:34:01,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:34:02,025 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:34:02,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:34:02,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 06:34:02,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-08 06:34:02,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:34:02,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:34:02,207 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:34:02,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 66 [2025-02-08 06:34:02,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:34:02,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2025-02-08 06:34:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:02,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:34:10,953 INFO L349 Elim1Store]: treesize reduction 511, result has 46.8 percent of original size [2025-02-08 06:34:10,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 1019 treesize of output 1189 [2025-02-08 06:34:11,414 INFO L349 Elim1Store]: treesize reduction 231, result has 54.1 percent of original size [2025-02-08 06:34:11,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 4102 treesize of output 2541 [2025-02-08 06:34:11,816 INFO L349 Elim1Store]: treesize reduction 192, result has 40.9 percent of original size [2025-02-08 06:34:11,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 3642 treesize of output 2978 [2025-02-08 06:34:12,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:34:12,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 2727 treesize of output 2779 [2025-02-08 06:34:12,446 INFO L349 Elim1Store]: treesize reduction 304, result has 42.1 percent of original size [2025-02-08 06:34:12,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 2005 treesize of output 2166 [2025-02-08 06:34:12,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:34:12,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2188 treesize of output 2305 [2025-02-08 06:34:15,425 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 6 treesize of output 4